Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
From MaRDI portal
Publication:835582
DOI10.1007/s10951-007-0050-8zbMath1168.90483OpenAlexW1972282966MaRDI QIDQ835582
Dominique de Werra, Tamás Kis, Wiesław X. 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
Related Items
Flexible open shop scheduling problem to minimize makespan, Large-scale medical examination scheduling technology based on intelligent optimization, A projective algorithm for preemptive open shop scheduling with two multiprocessor groups, On a conjecture for the university timetabling problem, A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop
Cites Work
- Unnamed Item
- Unnamed Item
- An introduction to timetabling
- Scheduling multiprocessor tasks on three dedicated processors
- Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
- Scheduling multiprocessor tasks -- An overview
- Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
- Complexity of scheduling multiprocessor tasks with prespecified processors allocations
- Complexity of some special types of timetabling problems
- A generalized class-teacher model for some timetabling problems
- Shop scheduling problems with multiprocessor tasks on dedicated processors
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- Complexity of Scheduling Parallel Task Systems
- Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
- Open Shop Scheduling to Minimize Finish Time
- Preemptive scheduling with dedicated processors: applications of fractional graph coloring
