Abstract
The purpose of this paper is to solve the lot streaming problem in job shop scheduling systems, where both equal and consistent sublots are considered. The presented algorithm incorporates a tabu search procedure to determine schedules and a specific heuristic for improving sublot sizes. Computational results confirm that, by applying the lot streaming strategy, production can be significantly accelerated. Moreover, this algorithm yields superior solutions compared to various approaches proposed in the literature and all tested instances show a rapid convergence to their lower bounds.
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
Adams J, Balas E, Zawack D (1998) The shifting bottleneck procedure for job shop scheduling. Management Science 34: 391–401
Battiti R, Giampietro T (1994) The reactive tabu search. ORSA Journal on Computing 6(2): 126–140
Dauzère-Pérès S, Lasserre J (1997) Lot streaming in job-shop scheduling. Operations Research 45:584–595
Dell’amico M, Trubian M (1993) Applying tabu search to the job-shop problem. Annals of Operations Research 41: 231–252
Fisher H, Thompson GL (1963) Probabilistic learning combinations of local job-shop scheduling rules. In: Muth JF, Thompson GL (eds) Industrial Scheduling. Prentice Hall, Englewood Cliffs, New Jersey
French S (1982) Sequencing and scheduling: an introduction to the mathematics of the job-shop. Horwood, Chichester, U.K.
Geyik F, Cedimoglu IH (2004) The strategies and parameters of tabu search for job-shop scheduling. Journal of Intelligent Manufacturing 15: 439–448
Lawler EL, Lenstra JK, Rinnooy Kan AHJ (1982) Recent developments in deterministic sequencing and scheduling: A survey. In: Dempster MSH, Lenstra JK, Rinnooy Kan AHJ (eds) Deterministic and stochastic scheduling. Reichel, Dordrecht, The Netherlands
Lawrence S (1984) Resource constrained project scheduling: An experimental investigation of heuristic scheduling techniques (supplement). Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA
Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the job shop problem. Management Science 42(6): 797–813
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shen, L. (2008). An Extensive Tabu Search Algorithm for Solving the Lot Streaming Problem in a Job Shop Environment. In: Kalcsics, J., Nickel, S. (eds) Operations Research Proceedings 2007. Operations Research Proceedings, vol 2007. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77903-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-77903-2_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77902-5
Online ISBN: 978-3-540-77903-2
eBook Packages: Business and EconomicsBusiness and Management (R0)