Two-Machine No-Wait Flow Shop Scheduling Problem with Precedence Constraints.
Saied SamieBehrooz KarimiPublished in: OR (2006)
Keyphrases
- precedence constraints
- scheduling problem
- flowshop
- flowshop scheduling
- branch and bound algorithm
- parallel machines
- precedence relations
- setup times
- approximation algorithms
- maximum lateness
- release dates
- single machine scheduling problem
- parallel processors
- unit length
- np hard
- single machine
- vertex cover
- sequence dependent setup times
- partial order
- processing times
- partially ordered
- series parallel
- global constraints
- tabu search
- total tardiness
- special case
- ant colony optimization
- np complete
- linear programming
- supply chain
- data structure
- partially ordered sets