Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness.
Bruno de Athayde PrataVictor Fernandez-ViagasJose M. FramiñanCarlos Diego RodriguesPublished in: Comput. Oper. Res. (2022)
Keyphrases
- single machine
- minimize total
- scheduling problem
- processing times
- resource consumption
- flowshop
- release dates
- number of tardy jobs
- single machine scheduling problem
- sequence dependent setup times
- setup times
- minimizing makespan
- np hard
- precedence constraints
- tabu search
- parallel machines
- permutation flowshop
- job shop scheduling problem
- completion times
- identical parallel machines
- data transfer
- lower bound