An NP-hard open shop scheduling problem with polynomial average time complexity

  • Authors:

  • Lu Lu;Marc E. Posner

  • Affiliations:

  • -;-

  • Venue:
  • Mathematics of Operations Research
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract