A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times.
Bo ChenPublished in: SIAM J. Comput. (1993)
Keyphrases
- setup times
- scheduling problem
- processing times
- unrelated parallel machines
- single machine
- strongly np hard
- tabu search
- lagrangian relaxation
- flowshop
- multi item
- scheduling algorithm
- np hard
- sequence dependent setup times
- dynamic programming
- lower bound
- precedence constraints
- feasible solution
- manufacturing cell
- single machine scheduling problem
- lot sizing
- parallel machines
- search algorithm
- optimal solution
- search procedure
- objective function
- linear programming
- lower and upper bounds
- message passing
- state space