Scheduling problems with rejection to minimize the k-th power of the makespan plus the total rejection cost.
Lingfa LuLiqi ZhangPublished in: J. Comb. Optim. (2023)
Keyphrases
- scheduling problem
- job processing times
- flowshop
- single machine
- processing times
- completion times
- release dates
- makespan minimization
- parallel machines
- total weighted tardiness
- setup times
- precedence constraints
- permutation flowshop
- np hard
- special case
- minimizing makespan
- tabu search
- sequence dependent setup times
- maximum lateness
- job shop
- unrelated parallel machines
- greedy heuristics
- open shop
- deteriorating jobs
- power consumption
- tardiness cost