A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
From MaRDI portal
Publication:290202
DOI10.1016/S0020-0190(97)00006-9zbMath1336.90042OpenAlexW1973636105MaRDI QIDQ290202
Publication date: 1 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00006-9
Related Items
A survey on makespan minimization in semi-online environments, A note on on-line scheduling with partial information, SEMI-ONLINE MACHINE COVERING, ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER, Semi-online scheduling: a survey, Semi-online scheduling with two GoS levels and unit processing time, Improved semi-online makespan scheduling with a reordering buffer, Online scheduling with rearrangement on two related machines, Unnamed Item, Online scheduling with one rearrangement at the end: revisited, Optimal algorithms for online scheduling with bounded rearrangement at the end, Online scheduling with reassignment, Online scheduling with rejection and reordering: exact algorithms for unit size jobs, Semi-online scheduling with ``end of sequence information, Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1, Semi-on-line scheduling problems for maximizing the minimum machine completion time, Online scheduling with a buffer on related machines, Several semi-online scheduling problems on two identical machines with combined information, Heuristic scheduling of parallel machines with sequence-dependent set-up times, A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model, Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
Cites Work
