A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: The case of job shop scheduling
- 16 March 2007
- journal article
- research article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 177 (3), 1894-1910
- https://doi.org/10.1016/j.ejor.2005.12.013
Abstract
No abstract availableThis publication has 34 references indexed in Scilit:
- An experimental analysis of local minima to improve neighbourhood searchComputers & Operations Research, 2003
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shopsJournal of Scheduling, 2002
- Jointly solving the group scheduling and machining speed selection problems: A hybrid tabu search and simulated annealing approachInternational Journal of Production Research, 1999
- Ant colony system: a cooperative learning approach to the traveling salesman problemIEEE Transactions on Evolutionary Computation, 1997
- Solving the job shop scheduling problem with tabu searchIIE Transactions, 1995
- Greedy Randomized Adaptive Search ProceduresJournal of Global Optimization, 1995
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problemAnnals of Operations Research, 1993
- Applying tabu search to the job-shop scheduling problemAnnals of Operations Research, 1993
- Simulated annealing for permutation flow-shop schedulingOmega, 1989
- Optimization by Simulated AnnealingScience, 1983