A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems
From MaRDI portal
Publication:1388828
DOI10.1016/0377-2217(95)00011-EzbMath0904.90140MaRDI QIDQ1388828
C. K. Y. Lin, K. B. Haley, C. Sparks
Publication date: 11 June 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
simulated annealing; local search; threshold accepting; maximum completion time; mean completion time; single-server system; adaptive neighbourhood search; jobs with arbitrary time lags
Related Items
On scheduling around large restrictive common due windows, A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem, The general lotsizing and scheduling problem, A novel threshold accepting meta-heuristic for the job-shop scheduling problem, Metaheuristics: A bibliography, GENETIC ALGORITHMS WITH DYNAMIC MUTATION RATES AND THEIR INDUSTRIAL APPLICATIONS
Cites Work
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- A controlled search simulated annealing method for the single machine weighted tardiness problem
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- On the convergence of ``threshold accepting
- Cell formation in manufacturing systems through simulated annealing: An experimental evaluation
- Some experiments with simulated annealing techniques for packing problems
- Simulated annealing for resource-constrained scheduling
- Simulated annealing procedures for forming machine cells in group technology
- Unrelated parallel machine scheduling using local search
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Convergence of an annealing algorithm
- Applying Stochastic Algorithms to a Locomotive Scheduling Problem
- Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- Improving the Efficiency of Tabu Search for Machine Sequencing Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
