Minimizing makespan in a two-stage system with flowshop and open shop.
Ling-Huey SuFuh-Der ChouWei-Ching TingPublished in: Comput. Ind. Eng. (2005)
Keyphrases
- minimizing makespan
- open shop
- flowshop
- scheduling problem
- job shop
- total flowtime
- special case
- processing times
- bicriteria
- flowshop scheduling
- setup times
- maximum tardiness
- parallel machines
- single machine
- completion times
- tabu search
- sequence dependent setup times
- job shop scheduling
- np hard
- strongly np hard
- neural network