Heuristic Control of a Constraint-Based Algorithm for the Preemptive Job-Shop Scheduling Problem.
Claude Le PapePhilippe BaptistePublished in: J. Heuristics (1999)
Keyphrases
- job shop scheduling problem
- benchmark instances
- benchmark problems
- simulated annealing
- critical path
- optimal solution
- tabu search algorithm
- dynamic programming
- threshold accepting
- tabu search
- scheduling problem
- memetic algorithm
- job shop scheduling
- cost function
- optimization algorithm
- combinatorial optimization
- single machine
- graph model
- k means
- computational complexity
- total weighted tardiness
- evolutionary algorithm
- production scheduling
- search space
- objective function
- probabilistic model
- worst case