Shop scheduling problems under precedence constraints.
Vitaly A. StrusevichPublished in: Ann. Oper. Res. (1997)
Keyphrases
- precedence constraints
- scheduling problem
- single machine
- precedence relations
- setup times
- sequence dependent setup times
- maximum lateness
- np hard
- parallel machines
- vertex cover
- parallel processors
- tabu search
- single machine scheduling problem
- processing times
- flowshop
- release dates
- series parallel
- unit length
- branch and bound algorithm
- job shop scheduling problem
- approximation algorithms
- partial order
- total tardiness
- makespan minimization
- partially ordered sets
- job shop
- multi dimensional
- special case
- evolutionary algorithm