Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
From MaRDI portal
Publication:835582
DOI10.1007/S10951-007-0050-8zbMATH Open1168.90483OpenAlexW1972282966MaRDI QIDQ835582FDOQ835582
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
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
- Title not available (Why is that?)
- Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
- Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
- Open Shop Scheduling to Minimize Finish Time
- Scheduling multiprocessor tasks -- An overview
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- An introduction to timetabling
- Complexity of some special types of timetabling problems
- Title not available (Why is that?)
- Complexity of Scheduling Parallel Task Systems
- Complexity of scheduling multiprocessor tasks with prespecified processors allocations
- Scheduling multiprocessor tasks on three dedicated processors
- Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
- A generalized class-teacher model for some timetabling problems
- Shop scheduling problems with multiprocessor tasks on dedicated processors
- Preemptive scheduling with dedicated processors: applications of fractional graph coloring
Cited In (11)
- A projective algorithm for preemptive open shop scheduling with two multiprocessor groups
- A preemptive open shop scheduling problem with one resource
- Large-scale medical examination scheduling technology based on intelligent optimization
- A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop
- Restrictions and preassignments in preemptive open shop scheduling
- Flexible open shop scheduling problem to minimize makespan
- On the geometry, preemptions and complexity of multiprocessor and shop scheduling
- Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
- On a conjecture for the university timetabling problem
- Preemptive scheduling with dedicated processors: applications of fractional graph coloring
- Scheduling with centralized and decentralized batching policies in concurrent open shops
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)
