Fast parallel heuristics for the job shop scheduling problem

Computers and Operations Research

Volumn 29, Issue 2, 2001, Pages 151-169

  Steinhofel K ^a   Albrecht, A ^b   Wong, C K ^b  

^a FRAUNHOFER FIRST   (Germany)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Benchmark problems; Combinatorial optimization; Job shop scheduling; Parallel algorithms; Simulated annealing

Indexed keywords

BENCHMARKING; GRAPH THEORY; HARDWARE; HEURISTIC METHODS; MARKOV PROCESSES; OPTIMIZATION; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; PROGRAM PROCESSORS; SCHEDULING; SIMULATED ANNEALING;

LONGEST PATHS;

OPERATIONS RESEARCH;

MANUFACTURING; PRODUCTION SYSTEM;

EID: 0036027953     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(00)00063-0     Document Type: Article

References (30)

1. Complexity results for multiprocessor scheduling under resource constraints
2. NP-complete scheduling problems
3. Short shop schedules
4. On unapproximable versions of NP-complete problems
5. A parallel matching algorithm for convex bibartite graphs and applications to scheduling
6. The two processor scheduling is in random NC
7. The two processor scheduling is in NC
8. A parallel algorithm for the two processor constrained scheduling
9. An NC algorithm for finding the minimum weighted completion time schedule on series parallel graphs
10. Sequential and parallel local search algorithms for job shop scheduling
11. Parallel branch-and-bound methods for the job-shop scheduling problem
12. Parallel taboo search techniques for the job-shop scheduling problem
13. On various cooling schedules for simulated annealing applied to the job shop problem
14. Two simulated annealing-based heuristics for the job shop scheduling problem
15. Job shop scheduling by simulated annealing
16. Cooling schedules for optimal annealing
17. Rough large deviation estimates for simulated annealing: Applications to exponential schedules
18. On parallel heuristics for the job shop scheduling problem
19. Optimization by simulated annealing
20. On the parallel complexity of discrete relaxation in constraint satisfaction networks
21. Fast parallel constraint satisfaction
22. Parallel computation and conflicts in memory access
23. A genetic algorithm applicable to large-scale job shop problems
24. New search spaces for sequencing problems with application to job shop scheduling