Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications

DOI10.1007/S10951-007-0050-8MaRDI QIDQ835582zbMATH OpenOpenAlexFDO

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

Publication date 28 August 2009

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL http://infoscience.epfl.ch/record/89539

zbMATH Keywords

polynomial time algorithmsmultiprocessor operationspreemptive open shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 1500536
• On the complexity of preemptive openshop scheduling problems
• On the complexity of preemptive open-shop scheduling problems
• Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times
• Approximation algorithms for the multiprocessor open shop scheduling problem
• Partially concurrent open shop scheduling with integral preemptions
• Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
• scientific article; zbMATH DE number 1092175
• Polynomial time approximation algorithms for proportionate open-shop scheduling
• Multiprocessor scheduling under precedence constraints: polyhedral results

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• A generalized class-teacher model for some timetabling problems
• Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
• An introduction to timetabling
• Complexity of Scheduling Parallel Task Systems
• Complexity of scheduling multiprocessor tasks with prespecified processors allocations
• Complexity of some special types of timetabling problems
• Open Shop Scheduling to Minimize Finish Time
• Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
• Preemptive scheduling with dedicated processors: applications of fractional graph coloring
• Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Scheduling multiprocessor tasks -- An overview
• Scheduling multiprocessor tasks on three dedicated processors
• Shop scheduling problems with multiprocessor tasks on dedicated processors

Cited in

(14)

• On a conjecture for the university timetabling problem
• A preemptive open shop scheduling problem with one resource
• Flexible open shop scheduling problem to minimize makespan
• Restrictions and preassignments in preemptive open shop scheduling
• A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop
• On the complexity of constructing multiprocessor little-preemptive schedules
• Multiprofessor scheduling
• Partially concurrent open shop scheduling with integral preemptions
• Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
• On the geometry, preemptions and complexity of multiprocessor and shop scheduling
• Preemptive scheduling with dedicated processors: applications of fractional graph coloring
• A projective algorithm for preemptive open shop scheduling with two multiprocessor groups
• Scheduling with centralized and decentralized batching policies in concurrent open shops
• Large-scale medical examination scheduling technology based on intelligent optimization

This page was built for publication: Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications

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