General parametric scheme for the online uniform machine scheduling problem with two different speeds
DOI10.1016/J.IPL.2018.01.009zbMATH Open1476.90115OpenAlexW2787036914MaRDI QIDQ1707972FDOQ1707972
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
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
Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)
Cites Work
- Bounds on Multiprocessing Timing Anomalies
- Bounds for List Schedules on Uniform Processors
- Semi-online scheduling on two uniform processors
- Online scheduling on two uniform machines to minimize the makespan
- Preemptive on-line scheduling for two uniform processors
- An On-Line Algorithm for Some Uniform Processor Scheduling
- Online scheduling with one rearrangement at the end: revisited
- Online scheduling with rearrangement on two related machines
- An efficient algorithm for bin stretching
- Online scheduling with reassignment on two uniform machines
- A new algorithm for online uniform-machine scheduling to minimize the makespan
- Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines
- Online scheduling on two uniform machines subject to eligibility constraints
- An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
- A parametric scheme for online uniform-machine scheduling to minimize the makespan
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)
