Minimal Total Weighted Tardiness in Tight-Tardy Single Machine Preemptive Idling-Free Scheduling.
Vadim V. RomanukePublished in: Appl. Comput. Syst. (2019)
Keyphrases
- single machine
- total weighted tardiness
- scheduling problem
- sequence dependent setup times
- release dates
- maximum lateness
- processing times
- lower bound
- production scheduling
- makespan minimization
- flowshop
- np hard
- job shop
- parallel machines
- precedence constraints
- setup times
- job shop scheduling
- competitive ratio
- upper bound
- tabu search
- worst case
- completion times
- single machine scheduling problem
- special case
- job shop scheduling problem