The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost.
Dvir ShabtayPublished in: Eur. J. Oper. Res. (2014)
Keyphrases
- single machine
- minimize total
- scheduling problem
- job processing times
- release dates
- weighted tardiness
- maximum lateness
- processing times
- total weighted tardiness
- earliness tardiness
- total tardiness
- completion times
- flowshop
- sequence dependent setup times
- setup times
- tabu search
- np hard
- precedence constraints
- total cost
- dynamic programming
- production scheduling
- single machine scheduling problem
- special case
- parallel machines
- upper bound