Nonpreemptive flowshop scheduling with machine dominance.
Ondrej CepekMasanori OkadaMilan VlachPublished in: Eur. J. Oper. Res. (2002)
Keyphrases
- flowshop scheduling
- flowshop
- scheduling problem
- unrelated parallel machines
- flowshop scheduling problems
- single machine
- precedence constraints
- parallel machines
- completion times
- sequence dependent setup times
- special case
- setup times
- processing times
- real time
- genetic algorithm
- artificial intelligence
- tabu search
- branch and bound algorithm
- strongly np hard
- knowledge base
- information retrieval
- np hard