Semi-online algorithms for parallel machine scheduling problems
From MaRDI portal
Publication:1885287
DOI10.1007/s00607-003-0034-2zbMath1057.90012MaRDI 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
Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines, Semi-online scheduling for jobs with release times, Online scheduling with rejection and reordering: exact algorithms for unit size jobs, Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling, Several semi-online scheduling problems on two identical machines with combined information, Optimal semi-online algorithms for machine covering, Semi-online scheduling problems on two identical machines with inexact partial information, List scheduling for jobs with arbitrary release times and similar lengths, Machine covering with combined partial information, Extension of algorithm list scheduling for a semi-online scheduling problem, Preemptive online algorithms for scheduling with machine cost, Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines, Semi-online scheduling with ``end of sequence information, Semi-online scheduling on two uniform processors
