Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem.
C. T. NgT. C. Edwin ChengJinjiang YuanPublished in: Inf. Process. Lett. (2002)
Keyphrases
- single machine
- scheduling problem
- np hardness
- np hard
- release times
- processing times
- job processing times
- completion times
- earliness tardiness
- release dates
- total tardiness
- total weighted tardiness
- flowshop
- minimize total
- maximum lateness
- number of late jobs
- scheduling jobs
- weighted tardiness
- setup times
- sequence dependent setup times
- weighted number of tardy jobs
- single machine scheduling problem
- approximation algorithms
- parallel machines
- precedence constraints
- lower bound
- identical parallel machines
- high multiplicity
- minimizing makespan
- special case
- tabu search
- production scheduling
- branch and bound algorithm
- linear programming
- optimal solution
- identical machines
- competitive ratio
- integer programming
- makespan minimization
- worst case
- strongly np hard
- deteriorating jobs
- job shop
- linear program
- dominance rules
- vehicle routing problem
- computational complexity