Minimizing total weighted tardiness and overtime costs for single machine preemptive scheduling.
Fernando JaramilloMurat ErkocPublished in: Comput. Ind. Eng. (2017)
Keyphrases
- total weighted tardiness
- single machine
- tardiness cost
- scheduling problem
- completion times
- processing times
- sequence dependent setup times
- maximum lateness
- total tardiness
- total cost
- single machine scheduling problem
- release dates
- scheduling jobs
- parallel machines
- production scheduling
- release times
- learning effect
- job shop scheduling problem
- setup times
- number of late jobs
- expected cost
- dynamic programming
- np hard
- job shop scheduling
- lagrangian relaxation
- flowshop
- variable neighborhood search
- job shop
- resource consumption
- tabu search