Abstract
We apply the combined technique of tabu-search and large-step optimization to the job-shop scheduling problem. The job-shop scheduling problem can be defined as follows: given a set of machines and a set of jobs, the objective is to construct a schedule which minimizes the time necessary to complete all the jobs. We also present some diversification strategies for the tabu-search methods and relate them with the large-step optimization method. Relevant computational results and respective conclusions are also 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
P. Brucker, J. Hurink and F. Werner, Improving Neighborhoods for Local Search Heuristics, Working paper, Osnabrücker Schriften zur Mathematik, Universität Osnabrück (1993).
P. Brucker, J. Hurink and F. Werner, Improving Local Search Heuristics for Some Scheduling Problems, Working Paper, Osnabrücker Schriften zur Mathematik, Universität Osnabrück (1994).
J. Carlier, The One-Machine Sequencing Problem, European Journal of Operational Research, 11 (1982) p. 42.
M. Dell’Amico and M. Trubian, Applying Tabu-Search to the Job-Shop Scheduling Problem, Annals of Operations Research, 41 (1993) p. 231.
T.A. Feo and M.G.C. Resende, Greedy Adaptive Search Procedures, to appear in Annals of Operations Research.
F. Glover, Tabu Search — Part I, ORSA Journal on Computing, 1(3) (1989) p. 190.
F. Glover, “Tabu Thresholding: Improved Search in Nonmonotonic Trajectories”, to appear in ORSA Journal on Computing.
F. Glover, M. Laguna, T. Taillard and D. de Werra, Tabu Search, Annals of Operations Research, 41 (1993).
D.S. Johnson, Local Optimization and the Traveling Salesman Problem, in: Proceedings of the 17th Annual Colloquim on Automata, Languages and Programming (Springer-Verlag, 1990) p.446.
D.S. Johnson, Random starts for local optimization, DIMACS Workshop on Randomized Algorithms for Combinatorial Optimization (1993).
D.S Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon, Optimization by Simulated Annealing: an experimental evaluation; part I, graph partitioning, Operations Research, 39(3) (1989) p.865.
M. Laguna, A guide to implementing Tabu Search, Investigacion Operativa, (1994).
H.R. Lourenço, Job-Shop Scheduling: Computational Study of Local Search and Large-Step Optimization Methods, European Journal of Operational Research, 83 (1995) p.347.
V.B.F. Lucks, Large-Step Local Improvement Optimization for the Graph Partitioning Problem, Master’s Dissertation, Cornell University, Ithaca, NY, USA (1992).
O. Martin, S.W. Otto and E.W. Feiten, Large-Step Markov Chains for the TSP Incorporating Local Search Heuristics, Operations Research Letters, 11(1992) p. 219.
P.J.M. van Laarhoven, E.H.L. Aarts and J.K. Lenstra, Job Shop Scheduling by Simulated Annealing, Operations Research, 40(1) (1992) p. 113.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Lourenço, H.R., Zwijnenburg, M. (1996). Combining the Large-Step Optimization with Tabu-Search: Application to The Job-Shop Scheduling Problem. In: Osman, I.H., Kelly, J.P. (eds) Meta-Heuristics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1361-8_14
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1361-8_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8587-8
Online ISBN: 978-1-4613-1361-8
eBook Packages: Springer Book Archive