Online scheduling of two uniform machines to minimize total completion times

DOI10.3934/JIMO.2009.5.95MaRDI QIDQ1013450zbMATH OpenOpenAlexFDO

Authors Peihai Liu, Xiwen Lu

Publication date 20 April 2009

Published in Journal of Industrial and Management Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3934/jimo.2009.5.95

zbMATH Keywords

competitive ratioonline algorithmschedulinguniform machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time
• On-line preemptive scheduling on uniform machines
• Preemptive on-line scheduling for two uniform processors
• An Optimal On-Line Algorithm for Preemptive Scheduling on Two Uniform Machines in the ℓ p Norm
• On-line scheduling of parallel machines to minimize total completion times

Cited in

(19)

• Online scheduling to minimize modified total tardiness with an availability constraint
• Total completion time minimization scheduling on two hierarchical uniform machines
• An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
• Randomized selection algorithm for online stochastic unrelated machines scheduling
• Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
• On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines
• Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times
• Online Scheduling on Two Uniform Machines to Minimize the Makespan with a Periodic Availability Constraint
• scientific article; zbMATH DE number 1305421 (Why is no real title available?)
• Online Order Scheduling Problem with the Same Order Size on Two Identical Machines
• Randomized mechanism design for decentralized network scheduling
• Randomized on-line scheduling on two uniform machines
• An optimal online algorithm for scheduling two machines with release times
• A competitive online algorithm for minimizing total weighted completion time on uniform machines
• Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time
• Online scheduling on two uniform machines subject to eligibility constraints
• Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines
• Online algorithms for scheduling with machine activation cost on two uniform machines
• Preemptive stochastic online scheduling on two uniform machines

This page was built for publication: Online scheduling of two uniform machines to minimize total completion times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1013450)