Minimizing makespan in an ordered flow shop with machine-dependent processing times.
Byung-Cheon ChoiJoseph Y.-T. LeungMichael L. PinedoPublished in: J. Comb. Optim. (2011)
Keyphrases
- flowshop
- minimizing makespan
- processing times
- scheduling problem
- setup times
- total flowtime
- special case
- single machine
- makespan minimization
- asymptotic optimality
- flowshop scheduling
- bicriteria
- sequence dependent setup times
- tabu search
- release dates
- scheduling jobs
- total weighted tardiness
- parallel machines
- identical machines
- np hard
- polynomially solvable
- single machine scheduling problem
- permutation flowshop
- job processing times
- strongly np hard
- resource consumption
- job shop
- evolutionary algorithm
- computational complexity