A strongly polynomial algorithm to solve combinatorial linear programs
Operations Research
Scheduling Multiprocessor Tasks to Minimize Schedule Length
IEEE Transactions on Computers
Complexity of scheduling parallel task systems
SIAM Journal on Discrete Mathematics
Scheduling multiprocessor tasks on three dedicated processors
Information Processing Letters
Complexity of scheduling multiprocessor tasks with prespecified processor allocations
Discrete Applied Mathematics
Scheduling computer and manufacturing processes
Scheduling computer and manufacturing processes
Open Shop Scheduling to Minimize Finish Time
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Graphs and Hypergraphs
A projective algorithm for preemptive open shop scheduling with two multiprocessor groups
Operations Research Letters
Hi-index | 0.00 |
This paper addresses a multiprocessor generalization of the preemptive open-shop scheduling problem. The set of processors is partitioned into two groups and the operations of the jobs may require either single processors in either group or simultaneously all processors from the same group. We consider two variants depending on whether preemptions are allowed at any fractional time points or only at integer time points. We reduce the former problem to solving a linear program in strongly polynomial time, while a restricted version of the second problem is solved by rounding techniques. Applications to course scheduling and hypergraph edge coloring are also discussed.