A simple semi on-line algorithm for P2//C_ with a buffer
From MaRDI portal
Publication:290202
Recommendations
- Semi-online algorithms for parallel machine scheduling problems
- Online scheduling with a buffer on related machines
- Several semi-online scheduling problems on two identical machines with combined information
- Semi-online hierarchical scheduling problems with buffer or rearrangements
- Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1
Cites work
Cited in
(25)- Semi on-line algorithms for the partition problem
- A survey on makespan minimization in semi-online environments
- Semi-online algorithms for parallel machine scheduling problems
- A note on on-line scheduling with partial information
- Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1
- A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model
- Semi-online scheduling with ``end of sequence information
- Semi-online scheduling: a survey
- Online minimum makespan scheduling with a buffer
- Semi-online scheduling with two GoS levels and unit processing time
- Improved semi-online makespan scheduling with a reordering buffer
- Heuristic scheduling of parallel machines with sequence-dependent set-up times
- Online scheduling with one rearrangement at the end: revisited
- Online scheduling with rejection and reordering: exact algorithms for unit size jobs
- Online makespan minimization: the power of restart
- Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
- SEMI-ONLINE MACHINE COVERING
- Semi-on-line scheduling problems for maximizing the minimum machine completion time
- Online scheduling with rearrangement on two related machines
- Optimal algorithms for online scheduling with bounded rearrangement at the end
- Semi-online scheduling with non-increasing job sizes and a buffer
- Online scheduling with a buffer on related machines
- Several semi-online scheduling problems on two identical machines with combined information
- Semi-online scheduling with look-ahead
- Online scheduling with reassignment
This page was built for publication: A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290202)