Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut.
Péter GyörgyiTamás KisPublished in: Comput. Ind. Eng. (2018)
Keyphrases
- single machine
- maximum lateness
- scheduling problem
- precedence constraints
- release dates
- sequence dependent setup times
- processing times
- flowshop
- dynamic programming
- single machine scheduling problem
- deteriorating jobs
- parallel machines
- setup times
- global constraints
- constraint programming
- linear programming
- objective function