A projective algorithm for preemptive open shop scheduling with two multiprocessor groups

DOI10.1016/J.ORL.2009.10.007zbMATH Open1185.90081OpenAlexW2057623859MaRDI QIDQ969520FDOQ969520

Authors: Tamás Kis, Dominique De Werra, Wieslaw Kubiak 

Publication date: 7 May 2010

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2009.10.007

Recommendations

• Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
• Polynomial time approximation schemes for general multiprocessor job shop scheduling
• A polynomial algorithm for some preemptive multiprocessor task scheduling problems
• scientific article; zbMATH DE number 1670878
• On the complexity of preemptive open-shop scheduling problems

zbMATH Keywords

linear programmingmultiprocessor operationspreemptive open shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Open Shop Scheduling to Minimize Finish Time
• Scheduling multiprocessor tasks -- An overview
• Complexity of some special types of timetabling problems
• Scheduling open shops with parallel machines
• Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
• A generalized class-teacher model for some timetabling problems

Cited In (3)

• A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop
• Multi-objective open shop scheduling by considering human error and preventive maintenance
• On a conjecture for the university timetabling problem

This page was built for publication: A projective algorithm for preemptive open shop scheduling with two multiprocessor groups

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