Lower Bounds for the Job-shop Scheduling Problem on Multi-purpose Machines.
Bernd JurischPublished in: Discret. Appl. Math. (1995)
Keyphrases
- job shop scheduling problem
- lower bound
- job shop scheduling
- critical path
- tabu search
- scheduling problem
- benchmark problems
- upper bound
- genetic algorithm
- production scheduling
- simulated annealing
- memetic algorithm
- graph model
- total weighted tardiness
- flowshop
- benchmark instances
- objective function
- branch and bound algorithm
- combinatorial optimization
- combinatorial optimization problems
- tabu search algorithm
- branch and bound
- parallel machines
- worst case
- lower and upper bounds
- max sat
- np hard
- optimal solution
- genetic programming
- evolutionary algorithm