Variants and objectives for ordinal scheduling
From MaRDI portal
Cites work
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- Algorithms better than LPT for semi-online scheduling with decreasing processing times
- Analysis of Greedy Solutions for a Replacement Part Sequencing Problem
- Approximation schemes for the min-max starting time problem
- Better Bounds for Online Scheduling
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Cardinality constrained scheduling in online models
- Minimizing the maximum starting time on-line
- On-line scheduling revisited
- Online minimization of the maximum starting time: migration helps
- Online single machine scheduling to minimize the maximum starting time
- Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
- Ordinal algorithms for parallel machine scheduling
- Ordinal on-line scheduling for maximizing the minimum machine completion time
- Ordinal scheduling problem and its asymptotically optimal algorithms on parallel machine system
- Parallel solutions for ordinal scheduling with a small number of machines
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- Scheduling when you do not know the number of machines
- Scheduling with speed predictions
- Semi-on-line scheduling problems for maximizing the minimum machine completion time
- Semi-on-line scheduling with ordinal data on two uniform machines
- Semi-online scheduling with combined information on two identical machines in parallel
- Semi-online scheduling with decreasing job sizes
- Speed-robust scheduling: sand, bricks, and rocks
- Starting time minimization for the maximum job variant
- The exact LPT-bound for maximizing the minimum completion time
This page was built for publication: Variants and objectives for ordinal scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7325492)
