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

DOI10.1016/j.orl.2009.10.007zbMath1185.90081OpenAlexW2057623859MaRDI QIDQ969520

Tamás Kis, Dominique de Werra, Wiesław X. 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

zbMATH Keywords

linear programmingmultiprocessor operationspreemptive open shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

On a conjecture for the university timetabling problem, 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

Cites Work

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