The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times.
Maria Elena BruniSara KhodaparastiErik DemeulemeesterPublished in: Comput. Oper. Res. (2020)
Keyphrases
- sequence dependent setup times
- flowshop
- scheduling problem
- minimizing total tardiness
- parallel machine scheduling problem
- single machine scheduling problem
- maximum lateness
- single machine
- total weighted tardiness
- processing times
- tardiness penalties
- setup times
- release dates
- parallel machines
- total tardiness
- minimizing makespan
- precedence constraints
- special case
- tabu search
- np hard
- strongly np hard
- job shop
- identical parallel machines
- lot sizing
- job shop scheduling problem
- completion times
- branch and bound algorithm