Semi-online scheduling jobs with tightly-grouped processing times on three identical machines

DOI10.1016/j.dam.2004.12.005zbMath1114.90035OpenAlexW2051819308MaRDI QIDQ2565855

Yong He, György Dósa

Publication date: 28 September 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2004.12.005

zbMATH Keywords

SchedulingCompetitive ratioAnalysis of algorithmSemi-online

Mathematics Subject Classification ID

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

Related Items (9)

A survey on makespan minimization in semi-online environments ⋮ Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes ⋮ Semi-online scheduling with bounded job sizes on two uniform machines ⋮ A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection ⋮ Semi-online scheduling: a survey ⋮ An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times ⋮ An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time ⋮ Extension of algorithm list scheduling for a semi-online scheduling problem ⋮ A Semi-Online Algorithm for Single Machine Scheduling with Rejection

Cites Work

• Unnamed Item
• Unnamed Item
• New algorithms for an ancient scheduling problem.
• Online algorithms. The state of the art
• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• Bin stretching revisited
• The optimal on-line parallel machine scheduling
• On-line scheduling revisited
• Ordinal on-line scheduling for maximizing the minimum machine completion time
• Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times
• Semi-on-line problems on two identical machines with combined partial information
• Ordinal algorithms for parallel machine scheduling
• On randomized online scheduling
• Better Bounds for Online Scheduling
• A Better Algorithm for an Ancient Scheduling Problem
• Bounds for Certain Multiprocessing Anomalies
• On-line machine covering
• Semi-online scheduling with decreasing job sizes
• Semi-on-line scheduling with ordinal data on two uniform machines
• On-line bin-stretching

This page was built for publication: Semi-online scheduling jobs with tightly-grouped processing times on three identical machines