Nonpreemptive open shop with restricted processing times

DOI10.1007/BF01415583MaRDI QIDQ4296296zbMATH OpenOpenAlexFDO

Authors Ondřej Čepek, Milan Vlach, Dominique De Werra

Publication date 1 March 1995

Published in ZOR Zeitschrift fü Operations Research Methods and Models of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01415583

zbMATH Keywords

makespanpolynomially solvable casenonpreemptive \(m\)-machine open shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Open shop scheduling with delays
• Scheduling preemptive open shops to minimize total tardiness
• Restrictions and preassignments in preemptive open shop scheduling
• Scheduling ordered open shops
• Open shop scheduling with machine dependent processing times
• scientific article; zbMATH DE number 894721
• Open shop scheduling with some additional constraints
• Scheduling Unit-Time Open Shops with Deadlines
• Dense open-shop schedules with release times
• scientific article; zbMATH DE number 808800

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
• An Algorithm for the Open-Shop Problem
• Open Shop Scheduling to Minimize Finish Time
• Preemptive Scheduling, Linear Programming and Network Flows

Cited in

(2)

• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Four decades of research on the open-shop scheduling problem to minimize the makespan

This page was built for publication: Nonpreemptive open shop with restricted processing times

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