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

DOI10.1016/J.DAM.2004.12.005MaRDI QIDQ2565855zbMATH OpenOpenAlexFDO

Authors 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

Analysis of algorithmCompetitive ratioSchedulingSemi-online

Mathematics Subject Classification ID

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

Recommendations

• SEMI-ON-LINE SCHEDULING PROBLEM FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME ON THREE SPECIAL UNIFORM MACHINES
• Semi on-line scheduling on two identical machines
• Optimal Semi-online Scheduling Algorithms on a Small Number of Machines
• Semi-online scheduling problems on a small number of machines
• OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES

Cites work

• A Better Algorithm for an Ancient Scheduling Problem
• Better Bounds for Online Scheduling
• Bin stretching revisited
• Bounds for Certain Multiprocessing Anomalies
• scientific article; zbMATH DE number 4130003 (Why is no real title available?)
• scientific article; zbMATH DE number 1929942 (Why is no real title available?)
• New algorithms for an ancient scheduling problem.
• On randomized online scheduling
• On-line bin-stretching
• On-line machine covering
• On-line scheduling revisited
• Online algorithms. The state of the art
• Ordinal algorithms for parallel machine scheduling
• Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times
• Ordinal on-line scheduling for maximizing the minimum machine completion time
• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• Semi-on-line problems on two identical machines with combined partial information
• Semi-on-line scheduling with ordinal data on two uniform machines
• Semi-online scheduling with decreasing job sizes
• The optimal on-line parallel machine scheduling

Cited in

(13)

• Extension of algorithm list scheduling for a semi-online scheduling problem
• A survey on makespan minimization in semi-online environments
• A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection
• Semi-online scheduling: a survey
• scientific article; zbMATH DE number 6671683 (Why is no real title available?)
• Semi-online scheduling with bounded job sizes on two uniform machines
• Online hierarchical scheduling on two uniform machines with bounded job sizes
• A semi-online algorithm for single machine scheduling with rejection
• SEMI-ON-LINE SCHEDULING PROBLEM FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME ON THREE SPECIAL UNIFORM MACHINES
• Tighter bounds on non-clairvoyant parallel machine scheduling with prediction to minimize makespan
• Online scheduling on three uniform machines
• 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

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

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