Valid constraints for time-indexed formulations of job scheduling problems with distinct time windows and sequence-dependent setup times.
Bruno Ferreira RosaMarcone Jamilson Freitas SouzaSérgio Ricardo de SouzaZacharie AlèsPhilippe Yves Paul MichelonPublished in: INOC (2019)
Keyphrases
- sequence dependent setup times
- scheduling problem
- flowshop
- single machine scheduling problem
- precedence constraints
- maximum lateness
- single machine
- release dates
- processing times
- parallel machine scheduling problem
- setup times
- total weighted tardiness
- parallel machines
- tardiness penalties
- total tardiness
- job shop
- special case
- branch and bound algorithm
- np hard
- global constraints
- tabu search
- lot sizing
- job shop scheduling problem
- constraint satisfaction
- job shop scheduling
- tardiness cost
- valid inequalities
- resource consumption
- mixed integer
- production scheduling
- strongly np hard
- linear programming
- evolutionary algorithm