Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: the bottleneck lower bound.
Woonghee Tim HuhGanesh JanakiramanPeter L. JacksonNidhi SawhneyPublished in: Oper. Res. Lett. (2003)
Keyphrases
- lower bound
- np hard
- scheduling problem
- precedence constraints
- branch and bound algorithm
- single machine
- weighted number of tardy jobs
- precedence relations
- processing times
- completion times
- flowshop
- upper bound
- parallel machines
- setup times
- release dates
- single machine scheduling problem
- approximation algorithms
- np complete
- competitive ratio
- optimal solution
- branch and bound
- strongly np hard
- worst case
- maximum lateness
- lower bounding
- sequence dependent setup times
- lower and upper bounds
- objective function
- identical machines
- linear programming
- minimum cost
- integer programming
- parallel processors
- tabu search
- lagrangian relaxation
- sufficiently accurate
- scheduling decisions
- flow field
- image sequences
- flow patterns
- knapsack problem
- linear programming relaxation
- partial order
- dynamic programming
- production scheduling
- special case
- polynomial approximation
- resource constraints