A novel threshold accepting meta-heuristic for the job-shop scheduling problem
From MaRDI portal
Publication:1885997
DOI10.1016/S0305-0548(03)00172-2zbMath1071.68016MaRDI QIDQ1885997
Dae Sung Lee, Vassilios S. Vassiliadis, Jong Moon Park
Publication date: 12 November 2004
Published in: Computers \& Operations Research (Search for Journal in Brave)
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Optimization of manufacturing processes by distributed simulation, A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem, Multiple colony ant algorithm for job-shop scheduling problem
Uses Software
Cites Work
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- NP-complete scheduling problems
- The job shop scheduling problem: Conventional and new solution techniques
- A genetic algorithm for the job shop problem
- Evolution based learning in a job shop scheduling environment
- A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems
- Insertion techniques for the heuristic solution of the job shop problem
- Some new results on simulated annealing applied to the job shop scheduling problem
- Deterministic job-shop scheduling: Past, present and future
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Job Shop Scheduling by Simulated Annealing
- A Computational Study of the Job-Shop Scheduling Problem
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Job Shop Scheduling by Local Search
