Fast parallel heuristics for the job shop scheduling problem
From MaRDI portal
Publication:5955476
DOI10.1016/S0305-0548(00)00063-0zbMath1021.90026MaRDI QIDQ5955476
C. K. Wong, Andreas A. Albrecht, K. Steinhöfel
Publication date: 18 March 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing ⋮ On single-walk parallelization of the job shop problem solving algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Parallel computation and conflicts in memory access
- Rough large deviation estimates for simulated annealing: Application to exponential schedules
- NP-complete scheduling problems
- Parallel branch-and-bound methods for the job-shop scheduling problem
- Two simulated annealing-based heuristics for the job shop scheduling problem
- An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs
- On the parallel complexity of discrete relaxation in constraint satisfaction networks
- The Two-Processor Scheduling Problem is in Random NC
- Two Processor Scheduling is in $\mathcal{NC}$
- Cooling Schedules for Optimal Annealing
- Job Shop Scheduling by Simulated Annealing
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- Short Shop Schedules
- Fast parallel constraint satisfaction
- On Unapproximable Versions of $NP$-Complete Problems
This page was built for publication: Fast parallel heuristics for the job shop scheduling problem
