scientific article

zbMATH Open0558.90045MaRDI QIDQ3347609

Jozef Grabowski, Czesław Smutnicki

Publication date: 1984

Title of this publication is not available (Why is that?)

zbMATH Keywords

sequencinglower boundsminimax objective functionflow-shop problembounding strategy

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Recommendations

• Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited 👍 👎
• Lower bounds for minimizing total completion time in a two-machine flow shop 👍 👎
• Minimizing functions of infeasibilities in a two-machine flow shop 👍 👎
• On the complexity and approximability of budget-constrained minimum cost flows 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3347609)