Randomized on-line scheduling similar jobs to minimize makespan on two identical processors

DOI10.1007/s10255-005-0255-6zbMath1161.90392OpenAlexW2170568519MaRDI QIDQ2508042

Dong-lei Du

Publication date: 9 October 2006

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-005-0255-6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Cites Work

• New algorithms for an ancient scheduling problem.
• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• A lower bound for randomized on-line scheduling algorithms
• An optimal algorithm for preemptive on-line scheduling
• Ordinal algorithms for parallel machine scheduling
• Scheduling with Deadlines and Loss Functions
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: Randomized on-line scheduling similar jobs to minimize makespan on two identical processors