Improved heuristics for the early/tardy scheduling problem with no idle time.
Jorge M. S. ValenteRui A. F. S. AlvesPublished in: Comput. Oper. Res. (2005)
Keyphrases
- scheduling problem
- single machine
- greedy heuristics
- list scheduling
- flowshop
- np hard
- tabu search
- processing times
- setup times
- total tardiness
- permutation flowshop
- precedence constraints
- earliness tardiness
- parallel machines
- sequence dependent setup times
- maximum lateness
- release dates
- real time
- single machine scheduling problem
- production scheduling
- completion times
- job shop scheduling problem
- search methods
- minimizing makespan
- heuristic search
- special case
- learning algorithm