A scheduling algorithm for flexible flow lines with limited intermediate buffers

Tadeusz Sawik

Applied Stochastic Models and Data Analysis, 1993, vol. 9, issue 2, 127-138

Abstract: A new heuristic algorithm is proposed for scheduling a flexible flow line with limited in‐process buffers. The line is made up of a certain number of processing stages. Each stage has one or more identical parallel machines with limited buffers. Each part is processed by at most one machine in each stage. The problem objective is to minimize the makespan of the schedule for a set of part types selected for processing. The computational results for a set of test problems used in the literature are reported. In addition, the efficiency of the algorithm is tested on several groups of random problems.

Date: 1993
References: View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
https://doi.org/10.1002/asm.3150090206

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:apsmda:v:9:y:1993:i:2:p:127-138

Access Statistics for this article

More articles in Applied Stochastic Models and Data Analysis from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().