Minimizing maximum completion time in a proportionate flow shop with one machine of different speed.
Byung-Cheon ChoiSuk-Hun YoonSung-Jin ChungPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- flowshop
- scheduling problem
- open shop
- completion times
- special case
- processing times
- setup times
- bicriteria
- flowshop scheduling
- maximum lateness
- sequence dependent setup times
- asymptotic optimality
- tabu search
- single machine
- flowshop scheduling problems
- parallel machines
- job shop
- minimizing makespan
- unrelated parallel machines
- precedence constraints
- lot streaming
- robotic cell
- np hard
- neural network
- job shop scheduling
- strongly np hard
- buffer allocation
- total weighted tardiness
- manufacturing cell