Semi-online scheduling for jobs with release times
From MaRDI portal
(Redirected from Publication:385494)
Recommendations
- Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines
- A Note on Online Scheduling for Jobs with Arbitrary Release Times
- On-line scheduling for jobs with arbitrary release times
- scientific article; zbMATH DE number 1932350
- List scheduling for jobs with arbitrary release times and unit-processing time
Cites work
- Bounds on Multiprocessing Timing Anomalies
- List scheduling for jobs with arbitrary release times and similar lengths
- 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
(7)- Prompt mechanism for online auctions with multi-unit demands
- Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines
- On-line scheduling for jobs with arbitrary release times
- A Note on Online Scheduling for Jobs with Arbitrary Release Times
- List scheduling for jobs with arbitrary release times and unit-processing time
- Extension of algorithm list scheduling for a semi-online scheduling problem
- Semi-online scheduling: a survey
This page was built for publication: Semi-online scheduling for jobs with release times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385494)
