Assembly/Disassembly Systems: An Efficient Decomposition Algorithm for Tree-Structured Networks

Gershwin, Stanley B.

doi:10.1080/07408179108963865

Cited by 92 publications

(19 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The sample path behavior of A/D networks can still be described by means of evolution equations that are generalizations of those presented in Section 3.3; see Towsley (1990, 1991). As a result, properties like conservation of flow, monotonicity, reversibility, can again be established using these evolution equations; see Ammar (1980), Adan and Van der Wal (1989), Shanthikumar and Yao (1989), Liu (1990), and 1991). Duality properties do also exist for general A/D networks; see Ammar and Gershwin (1989), Dallery, Liu, and Towsley (1990) and Liu (1990).…”

Section: Assembly/disassembly (Fork/join) Networkmentioning

confidence: 99%

“…As in flow lines, all decomposition methods for tree structured A/D networks decompose the original system into a set of two-machine, one-buffer systems (that is, two-machine flow lines). Details can be found in Gershwin (1986aGershwin ( , b, 1991a, Di Mascolo, David, and Dallery (1991), Liu (1990), , 1988a Closed loop systems are more complex to analyze than flow line systems because of the population constraint imposed by the closed loop structure, i.e., the total number of entities in the different buffers is a constant. This quantity corresponds, for instance, to the total number of pallets available.…”

Section: Assembly/disassembly (Fork/join) Networkmentioning

confidence: 99%

See 1 more Smart Citation

Manufacturing flow line systems: a review of models and analytical results

1992

Self Cite

View full text Add to dashboard Cite

The most important models and results of the manufacturing flow line literature are described. These include the major classes of models (asynchronous, synchronous, and continuous); the major features (blocking, processing times, failures and repairs); the major properties (conservation of flow, flow rate-idle time, reversibility, and others); and the relationships among different models. Exact and approximate methods for obtaining quantitative measures of performance are also reviewed. The exact methods are appropriate for small systems. The approximate methods, which are the only means available for large systems, are generally based on decomposition, and make use of the exact methods for small systems. Extensions are briefly discussed. Directions for future research are suggested.

show abstract

Section: Assembly/disassembly (Fork/join) Networkmentioning

confidence: 99%

Section: Assembly/disassembly (Fork/join) Networkmentioning

confidence: 99%

Manufacturing flow line systems: a review of models and analytical results

1992

Self Cite

View full text Add to dashboard Cite

show abstract

“…Furthermore, due to the complexity in the dynamics of assembly-type queues, many researchers have focused on obtaining approximations for the throughput and congestion levels in assembly-type systems, for example, by means of decomposition algorithms. For articles in this category, see, e.g., Gershwin [15], Di Mascolo et al [12], Lipper and Sengupta [25], Hopp and Simon [20], Jeong and Kim [23], and Asadothorn and Chao [8]. Articles that obtain exact expressions for some performance measures related to assembly-type queues under certain assumptions include Bhat [11], Simon and Hopp [31], and Yuan and Liu [34].…”

Section: Introductionmentioning

confidence: 99%

Dynamic server assignment policies for assembly‐type queues with flexible servers

Tsai¹,

Argon²

2008

Naval Research Logistics

View full text Add to dashboard Cite

Abstract:We seek dynamic server assignment policies in finite-capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady-state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her "primary" station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near-optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly-type systems also work well in tandem systems.

show abstract

“…We will not discuss such extensions in this paper. Secondly, we want to provide an analytical modules which can be used to study large scale complex manufacturing systems in incorporation with some decomposition methods, such as equivalent station method developed in Gershwin [3], and those decomposition methods presented in Ovacik and Uzsoy [10]. For instance, we can consider a multi-stage assembly line with one and only one component or module is assembled to the assembly at each stage.…”

Section: Introductionmentioning

confidence: 99%

“…Assembly systems with infinite buffers are known to be statistically unstable. The existing literature on performance of assembly systems usually focus on problems with finite buffer capacity, e.g., [1][2][3][4][5][6][7][8], and [11][12][13] among the others.…”

Section: Introductionmentioning

confidence: 99%