Login / Signup

Some results of the worst-case analysis for flow shop scheduling.

Czeslaw Smutnicki
Published in: Eur. J. Oper. Res. (1998)
Keyphrases
  • worst case analysis
  • average case
  • worst case
  • scheduling problem
  • greedy heuristic
  • np hardness
  • flowshop
  • lower bound
  • np hard
  • greedy algorithm
  • linear programming relaxation
  • cost function
  • uniform distribution