Semi-online algorithms for parallel machine scheduling problems
From MaRDI portal
Publication:1885287
DOI10.1007/S00607-003-0034-2zbMath1057.90012OpenAlexW2081075075MaRDI QIDQ1885287
Publication date: 28 October 2004
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-003-0034-2
Related Items (18)
A survey on makespan minimization in semi-online environments ⋮ Optimal semi-online algorithms for machine covering ⋮ Semi-online scheduling for jobs with release times ⋮ Semi-online scheduling: a survey ⋮ Semi-online scheduling problems on two identical machines with inexact partial information ⋮ Bin stretching with migration on two hierarchical machines ⋮ Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines ⋮ Online scheduling with rejection and reordering: exact algorithms for unit size jobs ⋮ Semi-online scheduling with ``end of sequence information ⋮ Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling ⋮ List scheduling for jobs with arbitrary release times and similar lengths ⋮ Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines ⋮ Semi-online scheduling on two uniform processors ⋮ Machine covering with combined partial information ⋮ Preemptive online algorithms for scheduling with machine cost ⋮ Several semi-online scheduling problems on two identical machines with combined information ⋮ Extension of algorithm list scheduling for a semi-online scheduling problem ⋮ A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model
This page was built for publication: Semi-online algorithms for parallel machine scheduling problems
