Two semi-online scheduling problems on two uniform machines
From MaRDI portal
(Redirected from Publication:1006050)
Recommendations
- Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
- Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling
- Semi-online scheduling with known maximum job size on two uniform machines
- Semi-online scheduling on two uniform processors
- Semi-online scheduling on two uniform machines with the known largest size
Cites work
- A linear compound algorithm for uniform machine scheduling
- Bin stretching revisited
- scientific article; zbMATH DE number 1559404 (Why is no real title available?)
- On-line bin-stretching
- Semi on-line algorithms for the partition problem
- Semi-on-line multiprocessor scheduling with given total processing time
- Semi-on-line problems on two identical machines with combined partial information
- The on-line multiprocessor scheduling problem with known sum of the tasks
Cited in
(30)- A survey on makespan minimization in semi-online environments
- Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
- Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
- Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
- Semi-online scheduling on two uniform processors
- Semi-online scheduling: a survey
- scientific article; zbMATH DE number 1696639 (Why is no real title available?)
- On-line and semi-online scheduling for flow shop problems on two machines
- Semi-online scheduling with bounded job sizes on two uniform machines
- Geometric representation for semi on-line scheduling on uniform processors
- Algorithms for semi-on-line scheduling problems on two uniform machines with set-up time
- Semi-online scheduling problems on two uniform machines under a grade of service provision
- scientific article; zbMATH DE number 1305421 (Why is no real title available?)
- Semi-online scheduling on two uniform machines with the known largest size
- Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling
- Online bin stretching with bunch techniques
- Semi on-line scheduing problem with the largest processing time of jobs on two uniform machines known
- Randomized on-line scheduling on two uniform machines
- Semi-on-line scheduling with ordinal data on two uniform machines
- Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time
- Dynamic scheduling of patients in emergency departments
- Semi-online scheduling with known maximum job size on two uniform machines
- Semi-online scheduling on two uniform parallel machines with initial lookahead
- Online budget allocation maximization problem on two uniform machines with a common due date
- Fifty years of research in scheduling -- theory and applications
- An optimal semi-online algorithm for 2-machine scheduling with an availability constraint
- Online scheduling on two uniform machines subject to eligibility constraints
- Semi-online machine covering on two uniform machines with known total size
- Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines
- Online and semi-online scheduling of two machines under a grade of service provision
This page was built for publication: Two semi-online scheduling problems on two uniform machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1006050)
