Author:
Caffrey James,Hitchings Graham
Abstract
Concerns scheduling five jobs through a flow shop with five
machines. The distribution of makespans and the distribution of the
optimal makespans was obtained by complete enumeration of all the
schedules. The effect of the processing times on these distributions was
investigated. Three priority rules were evaluated as to their
performance on minimizing the makespan. These rules were the
“greatest total processing time” first rule, the
“least total processing time” first rule and a
“RANDOM” assignment rule. Statistical tests were used to
evaluate the efficacy of the rules.
Subject
Management of Technology and Innovation,Strategy and Management,General Decision Sciences
Reference5 articles.
1. 1. French, S., Sequencing and
Scheduling – An Introduction to the Mathematics of the Job Shop, Ellis Horwood Limited, Chichester, 1982, p. 16.
2. 2. Lenstra, J.K., Rinnooy Kan, A.H.G. and Brucker, P., “Complexity of machine
scheduling problems”, Annals of Discrete Mathematics, Vol. 7 No. 3, 1977, pp.
343‐62.
3. 3. Eilon, S. and Chowdhury, I.G., “Studies in a simulated job‐shop”,
Proceedings of the Institution of Mechanical Engineers, Vol.
30 No. 75, 1975, p. 417.
4. 4. Schrage, L., “Solving
resource constrained network problems by implicit enumeration –
non pre‐emptive case”, Operations Research, Vol.
18 No. 2, 1970, pp. 263‐78.
5. 5. Caffrey, J.F., “A
distributional approach to flow shop scheduling”, internal publication technical monograph, PE 021,
University of Limerick, June 1992.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献