Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage.
Sergiu CarpovJacques CarlierDritan NaceRenaud SirdeyPublished in: Comput. Oper. Res. (2012)
Keyphrases
- precedence constraints
- parallel machines
- scheduling problem
- precedence relations
- sequence dependent setup times
- maximum lateness
- vertex cover
- release dates
- single machine scheduling problem
- unrelated parallel machines
- setup times
- total tardiness
- makespan minimization
- scheduling jobs
- parallel processors
- single server
- lot sizing
- branch and bound algorithm
- shared memory
- partially ordered
- partial order
- single machine
- ant colony optimization
- parallel computing
- identical machines
- np complete
- computational complexity
- computer systems