Complete Characterization of Near-Optimal Sequences for the Two-Machine Flow Shop Scheduling Problem.
Jean-Charles BillautEmmanuel HebrardPierre LopezPublished in: CPAIOR (2012)
Keyphrases
- scheduling problem
- single machine
- processing times
- flowshop
- np hard
- setup times
- hidden markov models
- tabu search
- precedence constraints
- permutation flowshop
- earliness tardiness
- job shop scheduling problem
- total tardiness
- minimizing makespan
- sequence alignment
- sequence dependent setup times
- parallel machines
- biological sequences
- maximum lateness