A composite heuristic for the single machine early/tardy job scheduling problem.
Maria Teresa AlmeidaMário CentenoPublished in: Comput. Oper. Res. (1998)
Keyphrases
- single machine
- scheduling problem
- scheduling jobs
- maximum lateness
- maximum tardiness
- processing times
- flowshop
- release times
- rolling horizon
- single machine scheduling problem
- release dates
- tabu search
- total weighted tardiness
- shortest processing time
- dominance rules
- earliness tardiness
- minimizing makespan
- weighted number of tardy jobs
- sequence dependent setup times
- total tardiness
- identical parallel machines
- asymptotic optimality
- weighted tardiness
- completion times
- deteriorating jobs
- minimize total
- strongly np hard
- high multiplicity
- job shop scheduling problem
- job shop
- production scheduling
- np hard
- identical machines
- learning effect
- number of late jobs
- precedence constraints
- dynamic programming
- setup times
- variable neighborhood search
- competitive ratio
- dispatching rule
- parallel machines
- job processing times
- makespan minimization
- integer programming
- objective function