Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem.
Jorge M. S. ValenteJeffrey E. SchallerPublished in: Comput. Oper. Res. (2012)
Keyphrases
- scheduling problem
- single machine
- shortest processing time
- dominance rules
- completion times
- processing times
- maximum lateness
- earliness tardiness
- scheduling jobs
- flowshop
- total weighted tardiness
- minimize total
- total tardiness
- release dates
- np hard
- sequence dependent setup times
- setup times
- release times
- production scheduling
- single machine scheduling problem
- weighted tardiness
- number of late jobs
- job shop
- tabu search
- weighted number of tardy jobs
- job shop scheduling problem
- competitive ratio
- parallel machines
- precedence constraints
- search algorithm
- number of tardy jobs
- computational complexity
- objective function
- weighted sum
- minimizing makespan
- dispatching rule