List scheduling for jobs with arbitrary release times and similar lengths
From MaRDI portal
(Redirected from Publication:954249)
Recommendations
- On-line scheduling for jobs with arbitrary release times
- List scheduling for jobs with arbitrary release times and unit-processing time
- A Note on Online Scheduling for Jobs with Arbitrary Release Times
- Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines
- On an on-line scheduling problem for parallel jobs
Cites work
- Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-algorithm
- Bounds on Multiprocessing Timing Anomalies
- On-line bin-stretching
- On-line scheduling for jobs with arbitrary release times
- Ordinal algorithms for parallel machine scheduling
- Semi on-line algorithms for the partition problem
- Semi on-line scheduling on two identical machines
- Semi-on-line problems on two identical machines with combined partial information
- Semi-online algorithms for parallel machine scheduling problems
- Semi-online scheduling with decreasing job sizes
Cited in
(6)- A Note on Online Scheduling for Jobs with Arbitrary Release Times
- List scheduling for jobs with arbitrary release times and unit-processing time
- Using a vision cognitive algorithm to schedule virtual machines
- Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines
- On-line scheduling for jobs with arbitrary release times
- Semi-online scheduling for jobs with release times
This page was built for publication: List scheduling for jobs with arbitrary release times and similar lengths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954249)
