Permutation Schedules for Flow Shops with Precedence Constraints.
Kevin EwachaIvan RivalGeorge SteinerPublished in: Oper. Res. (1990)
Keyphrases
- precedence constraints
- scheduling problem
- single machine
- precedence relations
- setup times
- release dates
- single machine scheduling problem
- parallel machines
- np hard
- sequence dependent setup times
- maximum lateness
- flowshop
- vertex cover
- tabu search
- series parallel
- processing times
- parallel processors
- partially ordered sets
- branch and bound algorithm
- unit length
- approximation algorithms
- partial order
- total tardiness
- simulated annealing
- dynamic programming
- special case
- evolutionary algorithm
- neural network