Routing open shop and flow shop scheduling problems.
Wei YuZhaohui LiuLeiyang WangTijun FanPublished in: Eur. J. Oper. Res. (2011)
Keyphrases
- open shop
- flowshop
- scheduling problem
- job shop
- processing times
- single machine
- setup times
- parallel machines
- np hard
- tabu search
- sequence dependent setup times
- maximum lateness
- job shop scheduling
- unrelated parallel machines
- routing problem
- completion times
- special case
- routing algorithm
- neural network
- routing protocol
- precedence constraints
- job shop scheduling problem
- shortest path
- genetic algorithm