A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays.
Petra SchuurmanPublished in: Oper. Res. Lett. (1998)
Keyphrases
- scheduling problem
- precedence constraints
- single machine
- minimize total
- precedence relations
- release dates
- parallel machines
- np hard
- sequence dependent setup times
- setup times
- single machine scheduling problem
- branch and bound algorithm
- maximum lateness
- processing times
- minimizing makespan
- real time
- flowshop
- partial order
- tabu search
- total tardiness
- databases
- partially ordered
- permutation flowshop
- information retrieval
- machine learning
- real world
- earliness tardiness
- round trip