A Linear Time Approximation Scheme for the Job Shop Scheduling Problem.
Klaus JansenRoberto Solis-ObaMaxim SviridenkoPublished in: RANDOM-APPROX (1999)
Keyphrases
- job shop scheduling problem
- job shop scheduling
- critical path
- scheduling problem
- polynomial time approximation
- tabu search
- benchmark problems
- memetic algorithm
- production scheduling
- genetic algorithm
- graph model
- combinatorial optimization problems
- simulated annealing
- job shop
- benchmark instances
- approximation algorithms
- single machine
- worst case
- search algorithm
- neural network