Case study on statistically estimating minimum makespan for flow line scheduling problems.
Amy D. WilsonRussell E. KingJames R. WilsonPublished in: Eur. J. Oper. Res. (2004)
Keyphrases
- scheduling problem
- case study
- flowshop
- processing times
- single machine
- precedence constraints
- unit length
- permutation flowshop
- np hard
- minimizing makespan
- unrelated parallel machines
- job shop
- setup times
- job shop scheduling
- tabu search
- parallel machines
- real world
- release dates
- strongly np hard
- software development
- line segments
- minimum cost
- lower bound
- list scheduling
- deteriorating jobs
- greedy heuristics
- parallel machine scheduling problem
- maximum lateness
- bicriteria
- optimal solution
- line drawings