scientific article; zbMATH DE number 894721

zbMATH Open0848.90071MaRDI QIDQ4882996FDOQ4882996

Thomas Tautenhahn

Publication date: 24 October 1996

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

zbMATH Keywords

unit processing timespolynomial algorithmstotal completion timeopen shop problems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (5)

• Minimizing the total completion time in a unit-time open shop with release times
• Scheduling Unit-Time Open Shops with Deadlines
• Nonpreemptive open shop with restricted processing times
• Open shop problems with unit time operations
• Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times

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 Q4882996)