Job-shop scheduling: Computational study of local search and large-step optimization methods
- 8 June 1995
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 83 (2), 347-364
- https://doi.org/10.1016/0377-2217(95)00012-f
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A Computational Study of Local Search Algorithms for Job Shop SchedulingINFORMS Journal on Computing, 1994
- A branch and bound algorithm for the job-shop scheduling problemDiscrete Applied Mathematics, 1994
- Applying tabu search to the job-shop scheduling problemAnnals of Operations Research, 1993
- Large-step markov chains for the TSP incorporating local search heuristicsOperations Research Letters, 1992
- A Computational Study of the Job-Shop Scheduling ProblemINFORMS Journal on Computing, 1991
- An Algorithm for Solving the Job-Shop ProblemManagement Science, 1989
- Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithmJournal of Optimization Theory and Applications, 1985
- Optimization by Simulated AnnealingScience, 1983
- The one-machine sequencing problemEuropean Journal of Operational Research, 1982
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976