Abstract
We consider a flow shop consisting of m machines, an input device and an output device, in which one type of product is to be produced. There are no buffers in the flow shop and the transportation of items between machines is taken care of by a robot. The 1-part cyclic scheduling problem consists in finding the shortest cyclic schedule for the robot, i.e. a schedule that outputs one part in each cycle, can be repeated infinitely many times and has maximum throughput rate. The problem has been solved by Sethi et al. (1992) in the case where m ≤ 3. We present an algorithm solving the 1-part cyclic scheduling problem in polynomial time for arbitrary values of m. Our approach is based on dynamic programming techniques.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Literature
Cohen G., Dubois D., Quadrat J.P. and Viot M. (1985) A Linear System-Theoretic View of Discrete Event Processes and Its Use for Performance Evaluation in Manufacturing. IEEE Transactions on Automatic Control, vol AC-30 No. 3 pp 210–220.
Cunninghame-Green R. (1979) Minimax Algebra. Lecture Notes in Economics and Mathematical Systems. Springer Verlag. Berlin Heidelberg New York.
Gilmore P.C., Lawler E.L. and Shmoys D.B. (1985) Well Solved Special Cases. In Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. and Shmoys D.B., The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley Interscience Series in Discrete Mathematics. John Wiley andSons. Chichester New York Brisbane Toronto Singapore.
Sethi S.P., Sriskandarajah C., Sorger G., Blazewicz J. and Kubiak W. (1992) Scheduling of Parts and Robot Moves in a Robotic Cell. International Journal of Flexible Manufacturing Systems 4 pp 331–358.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Physica-Verlag Heidelberg
About this paper
Cite this paper
Crama, Y., van de Klundert, J. (1994). The 1-part m-machine cyclic scheduling problem in robotic cells. In: Bachem, A., Derigs, U., Jünger, M., Schrader, R. (eds) Operations Research ’93. Physica, Heidelberg. https://doi.org/10.1007/978-3-642-46955-8_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-46955-8_26
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-0794-3
Online ISBN: 978-3-642-46955-8
eBook Packages: Springer Book Archive