Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times.
Ali AllahverdiHarun AydilekPublished in: Comput. Math. Appl. (2010)
Keyphrases
- flowshop
- maximum lateness
- processing times
- scheduling problem
- completion times
- job processing times
- single machine
- sequence dependent setup times
- release dates
- setup times
- makespan minimization
- bicriteria
- minimizing makespan
- parallel machines
- total weighted tardiness
- np hard
- polynomially solvable
- special case
- precedence constraints
- permutation flowshop
- tabu search
- strongly np hard
- single machine scheduling problem
- search algorithm
- job shop scheduling problem
- competitive ratio
- resource consumption