Parallel solutions for ordinal scheduling with a small number of machines
From MaRDI portal
Publication:6176402
DOI10.1007/s10878-023-01069-8arXiv2210.07639OpenAlexW4385220234MaRDI QIDQ6176402
Publication date: 22 August 2023
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.07639
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Cites Work
- Online bin packing with advice
- Online algorithms with advice for bin packing and scheduling problems
- Online algorithms with advice: the tape model
- Weighted online problems with advice
- Ordinal scheduling problem and its asymptotically optimal algorithms on parallel machine system
- Semi on-line algorithms for the partition problem
- Ordinal on-line scheduling for maximizing the minimum machine completion time
- Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times
- Algorithms better than LPT for semi-online scheduling with decreasing processing times
- Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
- Ordinal algorithms for packing with target center of gravity
- Ordinal algorithms for parallel machine scheduling
- Online bin packing with advice of small size
- Online makespan minimization with parallel schedules
- Bin packing using semi-ordinal data
- Parallel online algorithms for the bin packing problem
- On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can an Optimal Solution be Nonoptimal?
- Randomization Can Be as Helpful as a Glimpse of the Future in Online Computation
- Online Makespan Scheduling with Sublinear Advice
- Bounds on Multiprocessing Timing Anomalies
- 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
- Parallel solutions for preemptive makespan scheduling on two identical machines
This page was built for publication: Parallel solutions for ordinal scheduling with a small number of machines
