Worst-case analysis for flow shop scheduling problems with an exponential learning effect.
J.-B. WangM.-Z. WangPublished in: J. Oper. Res. Soc. (2012)
Keyphrases
- learning effect
- scheduling problem
- worst case analysis
- single machine
- flowshop
- np hard
- np hardness
- average case
- worst case
- processing times
- maximum lateness
- sequence dependent setup times
- setup times
- greedy heuristic
- learning curve
- tabu search
- release dates
- job shop scheduling problem
- job shop scheduling
- precedence constraints
- job shop
- parallel machines
- special case
- linear programming relaxation
- production scheduling
- lower bound
- uniform distribution
- linear program
- np complete
- completion times
- integer programming
- branch and bound algorithm
- upper bound
- strongly np hard
- genetic algorithm
- unrelated parallel machines
- lot streaming