Approximation algorithms for scheduling single batch machine with incompatible deteriorating jobs.
Bayi ChengHaimei YuanMi ZhouTan QiPublished in: RAIRO Oper. Res. (2023)
Keyphrases
- approximation algorithms
- deteriorating jobs
- batch processing
- np hard
- precedence constraints
- scheduling problem
- special case
- vertex cover
- single machine
- strongly np hard
- wafer fabrication
- maximum lateness
- flowshop
- worst case
- approximation ratio
- sequence dependent setup times
- setup times
- parallel machines
- release times
- scheduling algorithm
- single machine scheduling problem
- scheduling jobs
- combinatorial auctions
- constant factor
- identical parallel machines
- primal dual
- weighted sum
- metaheuristic