Technical Note - A Scheduling Problem Involving Sequence Dependent Changeover Times.
A. G. LockettA. P. MuhlemannPublished in: Oper. Res. (1972)
Keyphrases
- scheduling problem
- single machine
- flowshop
- tabu search
- setup times
- processing times
- permutation flowshop
- precedence constraints
- np hard
- minimizing makespan
- parallel machines
- total tardiness
- strongly np hard
- earliness tardiness
- job shop scheduling problem
- statistically independent
- search algorithm
- unrelated parallel machines
- long sequences
- maximum lateness
- sequence dependent setup times
- neural network