Semi on-line algorithms for the partition problem
From MaRDI portal
Publication:1267197
DOI10.1016/S0167-6377(98)00005-4zbMath0908.90165WikidataQ126789373 ScholiaQ126789373MaRDI QIDQ1267197
Zsolt Tuza, Hans Kellerer, Vladimir Kotov, Maria Grazia Speranza
Publication date: 3 December 1998
Published in: Operations Research Letters (Search for Journal in Brave)
90B35: Deterministic scheduling theory in operations research
Related Items
Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines, Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs, SEMI-ONLINE MACHINE COVERING, Semi-online scheduling with decreasing job sizes, Semi-on-line scheduling problems for maximizing the minimum machine completion time, Semi-on-line scheduling with ordinal data on two uniform machines, On-line bin-stretching, Semi-online scheduling for jobs with release times, Semi-online scheduling with two GoS levels and unit processing time, Improved semi-online makespan scheduling with a reordering buffer, Semi-online scheduling problems on a small number of machines, Optimal semi-online algorithm for scheduling with rejection on two uniform machines, Semi-online scheduling revisited, Online scheduling with rejection and reordering: exact algorithms for unit size jobs, 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, Online bin stretching with bunch techniques, A better semi-online algorithm for \(\mathrm Q3/s_{1} = s_{2}\leq s_{3}/C_{\mathrm{min}}\) with the known largest size, Online algorithms with advice: the tape model, Semi-online preemptive scheduling: one algorithm for all variants, 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 rearrangement on two related machines, Optimal algorithms for online scheduling with bounded rearrangement at the end, Online scheduling with a buffer on related machines, Several semi-online scheduling problems on two identical machines with combined information, Optimal preemptive semi-online scheduling on two uniform processors, Semi on-line scheduling on three processors with known sum of the tasks, Linear time algorithms for parallel machine scheduling, 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 problems on two identical machines with inexact partial information, An efficient algorithm for semi-online multiprocessor scheduling with given total processing time, Online scheduling with reassignment, List scheduling for jobs with arbitrary release times and similar lengths, Machine covering with combined partial information, Two semi-online scheduling problems on two uniform machines, Extension of algorithm list scheduling for a semi-online scheduling problem, Online scheduling on two uniform machines to minimize the makespan, Semi-online scheduling with machine cost., Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times, Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data, Preemptive online algorithms for scheduling with machine cost, Semi-on-line problems on two identical machines with combined partial information, \(\kappa\)-partitioning problems for maximizing the minimum load, A note on on-line scheduling with partial information, Online makespan minimization with parallel schedules, The online knapsack problem: advice and randomization, Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates, Semi-online scheduling with ``end of sequence information, Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information, Semi-online scheduling on two uniform processors, Randomized on-line scheduling similar jobs to minimize makespan on two identical processors, Preemptive semi-online algorithms for parallel machine scheduling with known total size, Semi-online scheduling jobs with tightly-grouped processing times on three identical machines, Dividing a Territory Among Several Vehicles, ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER, ONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINES, OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES, Better Algorithms for Online Bin Stretching
Cites Work
- New algorithms for an ancient scheduling problem.
- A better lower bound for on-line scheduling
- A look-ahead heuristic for scheduling jobs with release dates on a single machine
- 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
- On-line scheduling of parallel jobs
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
