On-line scheduling on parallel machines to minimize the makespan

DOI10.1007/S11424-015-3252-8zbMATH Open1351.90098OpenAlexW768960016MaRDI QIDQ328085FDOQ328085

Authors: Song-Song Li, Yuzhong Zhang 

Publication date: 20 October 2016

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-015-3252-8

Recommendations

• Scheduling on identical machines: How good is LPT in an on-line setting?
• Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
• On-line scheduling of parallel jobs on two machines
• Online scheduling of parallel jobs on two machines is 2-competitive
• A best possible on-line algorithm for scheduling on uniform parallel-batch machines

zbMATH Keywords

lower boundschedulingon-line algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Scheduling Parallel Machines On-Line
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Scheduling on identical machines: How good is LPT in an on-line setting?
• On-line scheduling for jobs with arbitrary release times
• Randomized on-line scheduling on two uniform machines
• An optimal online algorithm for scheduling two machines with release times

Cited In (15)

• Heuristics for online scheduling on identical parallel machines with two GoS levels
• Title not available (Why is that?)
• Online scheduling on two parallel identical machines under a grade of service provision
• Online optimization of busy time on parallel machines
• Randomized on-line scheduling similar jobs to minimize makespan on two identical processors
• Online scheduling of parallel jobs on two machines is 2-competitive
• A modified LPT algorithm for the two uniform parallel machine makespan minimization problem
• A new algorithm for online uniform-machine scheduling to minimize the makespan
• On-line scheduling of parallel machines to minimize total completion times
• Optimal on-line algorithms to minimize makespan on two machines with resource augmentation
• On-line scheduling of parallel jobs on two machines
• The optimal on-line parallel machine scheduling
• Approximation and Online Algorithms
• On-line parallel machine scheduling with special jobs to minimize the makespan
• Title not available (Why is that?)

This page was built for publication: On-line scheduling on parallel machines to minimize the makespan

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