Starting time minimization for the maximum job variant
From MaRDI portal
Publication:2057591
DOI10.1016/j.dam.2021.10.013zbMath1479.90087OpenAlexW3208486131MaRDI QIDQ2057591
Publication date: 7 December 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.10.013
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Cites Work
- Unnamed Item
- Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
- Parameterized on-line open-end bin packing
- On-line scheduling revisited
- A survey on makespan minimization in semi-online environments
- Approximation schemes for the min-max starting time problem
- Minimizing the maximum starting time on-line
- Fully dynamic bin packing revisited
- A lower bound on deterministic online algorithms for scheduling on related machines without preemption
- Robust Approximation Schemes for Cube Packing
- Online Scheduling with Bounded Migration
- Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures
- Bounds for List Schedules on Uniform Processors
- An On-Line Algorithm for Some Uniform Processor Scheduling
- Online Single Machine Scheduling to Minimize the Maximum Starting Time
- On-Line Load Balancing for Related Machines
- Bounds for Certain Multiprocessing Anomalies
- Randomized on-line scheduling on two uniform machines
- A note on an open-end bin packing problem
This page was built for publication: Starting time minimization for the maximum job variant
