scientific article; zbMATH DE number 894721

MaRDI QIDQ4882996zbMATH OpenFDO

Authors Thomas Tautenhahn

Publication date 24 October 1996

zbMATH Keywords

open shop problemspolynomial algorithmstotal completion timeunit processing times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling Unit-Time Open Shops with Deadlines
• Minimizing the total completion time in a unit-time open shop with release times
• scientific article; zbMATH DE number 2109433

Cited in

(8)

• The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan
• Minimizing the total completion time in a unit-time open shop with release times
• A polynomial algorithm for an open shop problem with unit processing times and tree constraints
• Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
• Open shop problems with unit time operations
• Scheduling Unit-Time Open Shops with Deadlines
• Nonpreemptive open shop with restricted processing times
• 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)