Abstract
Besides the problem of minimizing the total waiting time for one process, another problem connected with sequencing analysis that we have encountered in factories is the following machine scheduling problem:
Problem. Given n jobs X1,..., Xn on s machines A1, ..., As, where each job is to be processed successively on each machine according to the order Al ... As. The processing time, in terms of hours say, of each job on each machine is assumed to be given. How can the jobs be scheduled so that the time between the start of the first job and the completion of the last job is a minimum?
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Johnson, S.M. Optimal Two and Three Stage Production Schedules with Setup Time Included, Naval Reasearch Logistics Quarterly, 1, 1954, 6168.
Wu Fang. Remarks on Johnson’s rule for the Two-Machine Problem, 1981, unpublished.
Yu Ming-I and Han Ji Ye, Some Mathematical Problems in Sequencing Analysis, Math. Recognition and Practice, 3, 1976, 59–70;
Yu Ming-I and Han Ji Ye, Some Mathematical Problems in Sequencing Analysis, Math. Recognition and Practice, 4, 1976, 62–77.
Bellman, R., A.O. Esogbue and I.Nabeshima. Mathematical Aspects of Scheduling and Applications. Pergamon Press, 1982.
Blażewicz, Selected Topics in Scheduling Theory. 1–60. In Martello, S., G. Laporte, M. Minoux and C. Ribeiro, Surveys in Combinatorial Optimization, Annals of Discrete Mathematics, 31, North Holland, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Birkhäuser Boston
About this chapter
Cite this chapter
Hua, LK., Wang, Y., Heijmans, J.G.C. (1989). Machine Scheduling. In: Heijmans, J.G.C. (eds) Popularizing Mathematical Methods in the People’s Republic of China. Mathematical Modeling, vol 2. Birkhäuser Boston. https://doi.org/10.1007/978-1-4684-6757-4_9
Download citation
DOI: https://doi.org/10.1007/978-1-4684-6757-4_9
Publisher Name: Birkhäuser Boston
Print ISBN: 978-1-4684-6759-8
Online ISBN: 978-1-4684-6757-4
eBook Packages: Springer Book Archive