A list-based threshold accepting method for job shop scheduling problems

International Journal of Production Economics

Volumn 77, Issue 2, 2002, Pages 159-171

  Tarantilis, C D ^a   Kiranoudis, C T ^a  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

Job shop scheduling; Metaheuristics; Threshold accepting

Indexed keywords

ALGORITHMS; BENCHMARKING; COMPUTATIONAL COMPLEXITY; DECISION SUPPORT SYSTEMS; HEURISTIC METHODS; PROBLEM SOLVING; SCHEDULING;

JOB SHOP SCHEDULING;

INDUSTRIAL MANAGEMENT;

EID: 0037150268     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(01)00231-6     Document Type: Article

References (25)

1. Optimization and approximation in deterministic sequencing and scheduling: A survey
2. The complexity of flow shop and job shop scheduling
3. An algorithm for solving the job-shop problem
4. Sequencing by enumerative method
5. Job shop scheduling by local search INFORMS
6. Job shop scheduling by simulated annealing
7. Applying tabu-search to the job shop scheduling problem
8. A fast taboo search algorithm for the job shop problem
9. A tabu search method guided by shifting bottleneck for the job shop scheduling problem
10. Threshold accepting. A general purpose optimization algorithm appearing superior to simulated annealing
11. Probabilistic learning combinations of local job shop scheduling rules
12. The shifting bottleneck procedure for job shop scheduling
13. A tabu search method guided by shifting bottleneck for the job shop scheduling problem
14. Critical block simulated annealing for job shop scheduling
15. Scheduling and tabu search
16. Simulated annealing approach for minimizing the makespan of the general job shop
17. Modeling and optimization for design under production planning criteria in multiproduct dehydration plants
18. Production planning for multiproduct dehydration plants
19. Design and production planning of multi-product dehydration plants
20. Design and operation of convective industrial dryers