A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs.
T. C. Edwin ChengC. T. NgJinjiang YuanPublished in: J. Sched. (2003)
Keyphrases
- single machine
- number of tardy jobs
- scheduling problem
- processing times
- minimize total
- completion times
- flowshop
- maximum lateness
- release dates
- total weighted tardiness
- earliness tardiness
- job processing times
- single machine scheduling problem
- total tardiness
- sequence dependent setup times
- scheduling jobs
- release times
- setup times
- weighted number of tardy jobs
- weighted tardiness
- precedence constraints
- high multiplicity
- makespan minimization
- production scheduling
- number of late jobs
- tardiness cost
- job shop scheduling problem
- minimizing makespan
- worst case
- np hard
- competitive ratio
- parallel machines
- tabu search
- computational complexity
- shortest processing time
- identical parallel machines
- strongly np hard
- job shop
- evolutionary algorithm