Optimal Preemptive Scheduling of Two Unrelated Processors

DOI10.1287/IJOC.2.3.219MaRDI QIDQ4025916zbMATH OpenOpenAlexFDO

Authors Teofilo F. Gonzalez, Eugene L. Lawler, Sartaj Sahni

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

zbMATH Keywords

independent jobslinear time algorithmmakespan-optimal preemptive schedulesunrelated parallel processors

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Little-preemptive scheduling on unrelated processors
• Preemptive and non-preemptive scheduling on two unrelated parallel machines
• Preemptive Scheduling of Uniform Processor Systems
• Preemptive on-line scheduling for two uniform processors
• Ideal preemptive schedules on two processors

Cited in

(18)

• Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
• On the two-phase method for preemptive scheduling
• Scheduling unit-time jobs on processors with different capabilities
• Preemptive on-line scheduling for two uniform processors
• Ideal preemptive schedules on two processors
• Little-preemptive scheduling on unrelated processors
• On preemptive scheduling: A general setting for the two-phase method
• Preemptive and non-preemptive scheduling on two unrelated parallel machines
• AN IMPROVED APPROXIMATION ALGORITHM FOR THE TWO-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH AN INTERSTAGE TRANSPORTER
• Two processor scheduling with limited preemption
• Preemptive Scheduling of Uniform Processor Systems
• A two-stage hardware scheduler combining greedy and optimal scheduling
• scientific article; zbMATH DE number 894722 (Why is no real title available?)
• Tighter bounds on preemptive job shop scheduling with two machines
• On the complexity of scheduling unrelated parallel machines with limited preemptions
• Unrelated parallel machine scheduling with random rework and limited preemption
• Scheduling electric vehicle regular charging tasks: a review of deterministic models
• Extra processors versus future information in optimal deadline scheduling

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)