Sciweavers

81
Voted
EOR
2006
107views more  EOR 2006»
14 years 11 months ago
Longest path analysis in networks of queues: Dynamic scheduling problems
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...
76
Voted
EOR
2006
68views more  EOR 2006»
14 years 11 months ago
Modelling complex assemblies as a queueing network for lead time control
In this paper we develop an open queueing network for optimal design of multi-stage assemblies, in which each service station represents a manufacturing or assembly operation. The...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...