Job and Family Scheduling of a Flow-Line Manufacturing Cell: A Simulation Study
- 1 December 1991
- journal article
- research article
- Published by Taylor & Francis in IIE Transactions
- Vol. 23 (4) , 383-393
- https://doi.org/10.1080/07408179108963871
Abstract
This paper compares four part family scheduling procedures, which seek to avoid setups by sequencing similar jobs consecutively, with four job scheduling procedures which are oblivious of part family affiliations. Of these eight scheduling procedures, four are applied intermittently to finite job sets in stochastic and dynamic environments while the other four rules are dispatching heuristics applied dynamically in the same environments. The shop configuration is a 5-stage pure flow-line manufacturing cell. Besides determining the ranking of the procedures in various operating environments, the impact on relative scheduling performance of the mean time between job arrivals, the number of part families processed, and the family setup-to-job processing time ratio is investigated. Significant interaction effects between all these factors were detected. It can be concluded that, for the scheduling procedures and conditions used in this study, family-based scheduling approaches can generate marked improvements with respect to flow time and lateness-oriented measures.Keywords
This publication has 15 references indexed in Scilit:
- REPETITIVE LOTS: FLOW‐TIME REDUCTIONS THROUGH SEQUENCING AND DYNAMIC BATCH SIZINGDecision Sciences, 1988
- Analysis of group technology scheduling heuristicsInternational Journal of Production Research, 1984
- The Effect of Workload Dependent Due-Dates on Job Shop PerformanceManagement Science, 1983
- A Review of Production SchedulingOperations Research, 1981
- Heuristics for flow-shop schedulingInternational Journal of Production Research, 1980
- Performance Guarantees for Scheduling AlgorithmsOperations Research, 1978
- An Evaluation of Flow Shop Sequencing HeuristicsManagement Science, 1977
- A Heuristic Algorithm for the n Job, m Machine Sequencing ProblemManagement Science, 1970
- Application of the Branch and Bound Technique to Some Flow-Shop Scheduling ProblemsOperations Research, 1965
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954