Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection.
Matan AtsmonyGur MosheiovPublished in: Optim. Lett. (2024)
Keyphrases
- tardiness cost
- single machine scheduling
- single machine scheduling problem
- total weighted tardiness
- sequence dependent setup times
- single machine
- scheduling problem
- processing times
- release dates
- branch and bound algorithm
- precedence constraints
- setup times
- lead time
- combinatorial optimization
- flowshop
- lagrangian relaxation
- hybrid algorithm
- holding cost
- branch and bound
- wafer fabrication
- optimal solution