A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness.
Oliver HinderAndrew J. MasonPublished in: Eur. J. Oper. Res. (2017)
Keyphrases
- maximum lateness
- setup times
- total tardiness
- single machine
- scheduling problem
- precedence constraints
- sequence dependent setup times
- flowshop
- parallel machines
- release dates
- processing times
- special case
- single machine scheduling problem
- branch and bound algorithm
- multi item
- scheduling jobs
- lot sizing
- tabu search
- constraint programming
- release times
- mixed integer
- np hard
- evolutionary algorithm
- partial order
- completion times
- constraint satisfaction