Abstract
This paper introduces the problem of scheduling a set of jobs with sequence dependent setup times on a machine with a pair of coupled processing lines, i.e., both lines must be operated simultaneously. A heuristic procedure is developed to find a good schedule which then is used as a starting point for a tabu search. A mixed integer programming formulation of the problem is also given. Computational results on real-world problems are presented.
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
Preview
Unable to display preview. Download preview PDF.
References
J. W. Barnes and M. Laguna, 1993, A tabu search experience in production scheduling, Annals of Operations Research, 41, 141–156.
T. C. E. Cheng and C. C. S. Sin, 1990, A state-of-the-art review of parallel-machine scheduling, European Journal of Operations Research, 47, 27 1292.
F. Glover, 1989, Tabu search, part i, ORSA Journal on Computing, 1, 190–206.
F. Glover, 1990a, Tabu search–part ii, ORSA Journal on Computing, 2, 4–32.
F. Glover, 1990b, Tabu search: a tutorial, Interfaces, 20, 74–94.
F. Glover, 1995, Tabu search fundamentals and uses, Technical report, University of Colorado.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Sewell, E.C., Tan, J.C. (1998). Scheduling Jobs with Sequence Dependent Setups on Coupled Lines. In: Yu, G. (eds) Industrial Applications of Combinatorial Optimization. Applied Optimization, vol 16. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2876-7_5
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2876-7_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4797-0
Online ISBN: 978-1-4757-2876-7
eBook Packages: Springer Book Archive