Semi-online scheduling with decreasing job sizes
From MaRDI portal
Publication:5929138
DOI10.1016/S0167-6377(00)00053-5zbMath1024.90044OpenAlexW2060023372WikidataQ126789375 ScholiaQ126789375MaRDI QIDQ5929138
Jiří Sgall, Gerhard J. Woeginger, Steve Seiden
Publication date: 2001
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(00)00053-5
Related Items (43)
A survey on makespan minimization in semi-online environments ⋮ Optimal preemptive semi-online scheduling on two uniform processors ⋮ SEMI-ONLINE MACHINE COVERING ⋮ Linear time algorithms for parallel machine scheduling ⋮ Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines ⋮ Semi-online machine covering on two uniform machines with known total size ⋮ Online and semi-online scheduling of two machines under a grade of service provision ⋮ 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 ⋮ Preemptive online scheduling with rejection of unit jobs on two uniformly related machines ⋮ Parallel solutions for preemptive makespan scheduling on two identical machines ⋮ Parallel solutions for ordinal scheduling with a small number of machines ⋮ Online scheduling of unit jobs on three machines with rejection: a tight result ⋮ The online knapsack problem: advice and randomization ⋮ Optimal on-line algorithms to minimize makespan on two machines with resource augmentation ⋮ Semi-online scheduling with machine cost. ⋮ Online scheduling with reassignment ⋮ ONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINES ⋮ Online over time scheduling on parallel-batch machines: a survey ⋮ Semi-online scheduling with ``end of sequence information ⋮ Online bin stretching with bunch techniques ⋮ Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information ⋮ List scheduling for jobs with arbitrary release times and similar lengths ⋮ Algorithms better than LPT for semi-online scheduling with decreasing processing times ⋮ Best semi-online algorithms for unbounded parallel batch scheduling ⋮ Semi-online preemptive scheduling: one algorithm for all variants ⋮ Semi-online scheduling with known partial information about job sizes on two identical machines ⋮ Randomized priority algorithms ⋮ Optimal semi-online preemptive algorithms for machine covering on two uniform machines ⋮ Online scheduling with a buffer on related machines ⋮ Semi-on-line scheduling with ordinal data on two uniform machines ⋮ Several semi-online scheduling problems on two identical machines with combined information ⋮ Semi-online scheduling with combined information on two identical machines in parallel ⋮ Online Order Scheduling Problem with the Same Order Size on Two Identical Machines ⋮ Semi-online machine covering for two uniform machines ⋮ A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model ⋮ Semi-online scheduling jobs with tightly-grouped processing times on three identical machines ⋮ Preemptive machine covering on parallel machines ⋮ Optimal preemptive semi-online scheduling to minimize makespan on two related machines ⋮ Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times ⋮ Semi-on-line problems on two identical machines with combined partial information
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A lower bound for randomized on-line multiprocessor scheduling
- New algorithms for an ancient scheduling problem.
- Semi on-line algorithms for the partition problem
- Randomized competitive algorithms for the list update problem
- A better lower bound for on-line scheduling
- A lower bound for randomized on-line scheduling algorithms
- Online randomized multiprocessor scheduling
- New lower and upper bounds for on-line scheduling
- An optimal algorithm for preemptive on-line scheduling
- Ordinal algorithms for parallel machine scheduling
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- A Better Algorithm for an Ancient Scheduling Problem
- Randomized algorithms for that ancient scheduling problem
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
This page was built for publication: Semi-online scheduling with decreasing job sizes
