Due date assignments and scheduling a single machine with a general earliness/tardiness cost function.
Dvir ShabtayPublished in: Comput. Oper. Res. (2008)
Keyphrases
- earliness tardiness
- single machine
- scheduling problem
- parallel machines
- release dates
- cost function
- minimize total
- maximum lateness
- scheduling jobs
- release times
- sequence dependent setup times
- processing times
- single machine scheduling problem
- total weighted tardiness
- production scheduling
- identical machines
- precedence constraints
- np hard
- deteriorating jobs
- special case
- tabu search
- job shop
- flowshop
- identical parallel machines
- computational complexity
- tardiness cost