General parametric scheme for the online uniform machine scheduling problem with two different speeds

DOI10.1016/J.IPL.2018.01.009MaRDI QIDQ1707972zbMATH OpenOpenAlexFDO

Authors V. M. Kotov, Aliaksandr Nekrashevich, Alain Quilliot, Alexandre Dolgui

Publication date 4 April 2018

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2018.01.009

zbMATH Keywords

online algorithmsapproximation algorithmsscheduling

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Recommendations

• A parametric scheme for online uniform-machine scheduling to minimize the makespan
• A new algorithm for online uniform-machine scheduling to minimize the makespan
• An On-Line Algorithm for Some Uniform Processor Scheduling
• Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time
• Preemptive on-line scheduling for two uniform processors

Cites work

• A new algorithm for online uniform-machine scheduling to minimize the makespan
• A parametric scheme for online uniform-machine scheduling to minimize the makespan
• An On-Line Algorithm for Some Uniform Processor Scheduling
• An efficient algorithm for bin stretching
• An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
• Bounds for List Schedules on Uniform Processors
• Bounds on Multiprocessing Timing Anomalies
• Online scheduling on two uniform machines subject to eligibility constraints
• Online scheduling on two uniform machines to minimize the makespan
• Online scheduling with one rearrangement at the end: revisited
• Online scheduling with rearrangement on two related machines
• Online scheduling with reassignment on two uniform machines
• Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines
• Preemptive on-line scheduling for two uniform processors
• Semi-online scheduling on two uniform processors

Cited in

(4)

• A parametric scheme for online uniform-machine scheduling to minimize the makespan
• A survey on makespan minimization in semi-online environments
• Semi-online scheduling on two uniform parallel machines with initial lookahead
• Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines

This page was built for publication: General parametric scheme for the online uniform machine scheduling problem with two different speeds

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