Bin stretching revisited
From MaRDI portal
Publication:1403343
DOI10.1007/S00236-002-0102-7zbMath1034.68039OpenAlexW2022260726MaRDI QIDQ1403343
Publication date: 1 September 2003
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-002-0102-7
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Operations research and management science (90Bxx)
Related Items (31)
A survey on makespan minimization in semi-online environments ⋮ Tight upper bounds for semi-online scheduling on two uniform machines with known optimum ⋮ Semi-online machine covering on two uniform machines with known total size ⋮ Semi-online scheduling with bounded job sizes on two uniform machines ⋮ Optimal semi-online algorithms for machine covering ⋮ Semi-online scheduling: a survey ⋮ Semi-online scheduling problems on two identical machines with inexact partial information ⋮ Semi-online scheduling problems on two uniform machines under a grade of service provision ⋮ Bin stretching with migration on two hierarchical machines ⋮ Parallel solutions for preemptive makespan scheduling on two identical machines ⋮ Semi-online scheduling revisited ⋮ An efficient algorithm for bin stretching ⋮ Semi-online scheduling with ``end of sequence information ⋮ Semi-online scheduling on two uniform machines with the known largest size ⋮ Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling ⋮ Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information ⋮ Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data ⋮ Semi-online scheduling with known partial information about job sizes on two identical machines ⋮ Semi-on-line multiprocessor scheduling with given total processing time ⋮ Optimal semi-online preemptive algorithms for machine covering on two uniform machines ⋮ Online scheduling with a buffer on related machines ⋮ Preemptive online algorithms for scheduling with machine cost ⋮ Several semi-online scheduling problems on two identical machines with combined information ⋮ Semi-online scheduling with combined information on two identical machines in parallel ⋮ Two semi-online scheduling problems on two uniform machines ⋮ An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time ⋮ Online Order Scheduling Problem with the Same Order Size on Two Identical Machines ⋮ Tight lower bounds for semi-online scheduling on two uniform machines with known optimum ⋮ Optimal and online preemptive scheduling on uniformly related machines ⋮ Semi-online scheduling jobs with tightly-grouped processing times on three identical machines ⋮ Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
This page was built for publication: Bin stretching revisited
