Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times.
Luis MunozJesus René VillalobosJohn W. FowlerPublished in: Comput. Oper. Res. (2022)
Keyphrases
- sequence dependent setup times
- parallel machines
- scheduling problem
- single machine
- flowshop
- total weighted tardiness
- setup times
- total tardiness
- single machine scheduling problem
- earliness tardiness
- precedence constraints
- release dates
- maximum lateness
- completion times
- makespan minimization
- unrelated parallel machines
- resource allocation
- tabu search
- np hard
- resource consumption
- single server
- job shop
- parallel machine scheduling problem
- list scheduling
- strongly np hard
- parallel computing
- shared memory
- job shop scheduling problem