Optimal Preemptive Scheduling of Two Unrelated Processors
DOI10.1287/IJOC.2.3.219zbMATH Open0755.90042OpenAlexW2101252297MaRDI QIDQ4025916FDOQ4025916
Sartaj Sahni, Teofilo F. Gonzalez, Eugene L. Lawler
Publication date: 18 February 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2.3.219
Recommendations
linear time algorithmindependent jobsmakespan-optimal preemptive schedulesunrelated parallel processors
Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cited In (15)
- Preemptive Scheduling of Uniform Processor Systems
- Scheduling unit-time jobs on processors with different capabilities
- Extra processors versus future information in optimal deadline scheduling
- Preemptive on-line scheduling for two uniform processors
- Little-preemptive scheduling on unrelated processors
- A two-stage hardware scheduler combining greedy and optimal scheduling
- On preemptive scheduling: A general setting for the two-phase method
- Preemptive and non-preemptive scheduling on two unrelated parallel machines
- On the two-phase method for preemptive scheduling
- Ideal preemptive schedules on two processors
- Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
- On the complexity of scheduling unrelated parallel machines with limited preemptions
- AN IMPROVED APPROXIMATION ALGORITHM FOR THE TWO-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH AN INTERSTAGE TRANSPORTER
- Tighter bounds on preemptive job shop scheduling with two machines
- Two processor scheduling with limited preemption
This page was built for publication: Optimal Preemptive Scheduling of Two Unrelated Processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4025916)
