List scheduling for jobs with arbitrary release times and similar lengths
From MaRDI portal
Publication:954249
DOI10.1007/s10951-007-0042-8zbMath1153.90428OpenAlexW2084347954MaRDI QIDQ954249
Publication date: 10 November 2008
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-007-0042-8
Related Items (3)
Semi-online scheduling for jobs with release times ⋮ Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines ⋮ Using a vision cognitive algorithm to schedule virtual machines
Cites Work
- Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-algorithm
- Semi on-line algorithms for the partition problem
- Semi on-line scheduling on two identical machines
- On-line scheduling for jobs with arbitrary release times
- Semi-on-line problems on two identical machines with combined partial information
- Semi-online algorithms for parallel machine scheduling problems
- Ordinal algorithms for parallel machine scheduling
- Bounds on Multiprocessing Timing Anomalies
- Semi-online scheduling with decreasing job sizes
- On-line bin-stretching
This page was built for publication: List scheduling for jobs with arbitrary release times and similar lengths