Optimal flow-shop scheduling with earliness and tardiness penalties

zbMath0475.90043MaRDI QIDQ1159565

Jan Grabowski, N. R. Achuthan, Jeffrey B. Sidney

Publication date: 1981

Published in: Opsearch (Search for Journal in Brave)

zbMATH Keywords

branch-and-bound algorithmNP-completenesssufficient optimality conditionsmaximum tardiness problemearliness penaltymaximum penalty problemoptimal flow-shop schedulingtardiness penalties

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items

A decision support system for the resource constrained project scheduling problem