On the solution region for certain scheduling problems with preemption

DOI10.1023/A:1018999711765MaRDI QIDQ1273129zbMATH OpenFDO

Authors Heidemarie Bräsel, N. V. Shakhlevich

Publication date 6 December 1998

Published in Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

polynomial algorithmparallel machineopen shop schedulingpreemptionsscheduling poltype

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

Recommendations

• On the complexity of preemptive open-shop scheduling problems
• On the open-shop problem with preemption and minimizing the average completion time
• Structural properties of optimal schedules with preemption
• Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
• Open shop scheduling with some additional constraints

Cited in

(5)

• On the open-shop problem with preemption and minimizing the average completion time
• On preemptive scheduling: A general setting for the two-phase method
• Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Normal-form preemption sequences for an open problem in scheduling theory

This page was built for publication: On the solution region for certain scheduling problems with preemption

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