On-line scheduling on parallel machines to minimize the makespan

DOI10.1007/S11424-015-3252-8MaRDI QIDQ328085zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

lower boundon-line algorithmscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

Cites work

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

Cited in

(23)

• On-line scheduling of parallel machines to minimize total completion times
• Scheduling on identical machines: How good is LPT in an on-line setting?
• The optimal on-line parallel machine scheduling
• Heuristics for online scheduling on identical parallel machines with two GoS levels
• A modified LPT algorithm for the two uniform parallel machine makespan minimization problem
• Randomized on-line scheduling similar jobs to minimize makespan on two identical processors
• Online scheduling on two parallel identical machines under a grade of service provision
• A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan
• scientific article; zbMATH DE number 5670142 (Why is no real title available?)
• scientific article; zbMATH DE number 1375193 (Why is no real title available?)
• Online LPT algorithms for parallel machines scheduling with a single server
• scientific article; zbMATH DE number 1475019 (Why is no real title available?)
• Online optimization of busy time on parallel machines
• Online scheduling on parallel machines: a survey
• On-line parallel machine scheduling with special jobs to minimize the makespan
• Approximation and Online Algorithms
• Fifty years of research in scheduling -- theory and applications
• Resource allocation to minimize the makespan with multi-resource operations
• Online makespan minimization: beat LPT by dynamic locking
• A new algorithm for online uniform-machine scheduling to minimize the makespan
• Online scheduling of parallel jobs on two machines is 2-competitive
• Optimal on-line algorithms to minimize makespan on two machines with resource augmentation
• On-line scheduling of parallel jobs on two machines

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)