The following pages link to On-line bin-stretching (Q5958712):
Displaying 38 items.
- Semi-online scheduling problems on a small number of machines (Q398877) (← links)
- Semi-online scheduling revisited (Q442235) (← links)
- Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling (Q491212) (← links)
- Online bin stretching with bunch techniques (Q497684) (← links)
- Semi-on-line multiprocessor scheduling with given total processing time (Q557814) (← links)
- Optimal semi-online preemptive algorithms for machine covering on two uniform machines (Q557905) (← links)
- Online scheduling with a buffer on related machines (Q711400) (← links)
- Several semi-online scheduling problems on two identical machines with combined information (Q714838) (← links)
- Scheduling with testing on multiple identical parallel machines (Q832831) (← links)
- Semi-online machine covering on two uniform machines with known total size (Q858190) (← links)
- Optimal semi-online algorithms for machine covering (Q870840) (← links)
- Semi-online scheduling problems on two identical machines with inexact partial information (Q884466) (← links)
- An efficient algorithm for semi-online multiprocessor scheduling with given total processing time (Q906558) (← links)
- Online scheduling with reassignment (Q935241) (← links)
- List scheduling for jobs with arbitrary release times and similar lengths (Q954249) (← links)
- Machine covering with combined partial information (Q972842) (← links)
- Two semi-online scheduling problems on two uniform machines (Q1006050) (← links)
- Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times (Q1609082) (← links)
- Online-bounded analysis (Q1617274) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- Tight upper bounds for semi-online scheduling on two uniform machines with known optimum (Q1642847) (← links)
- A two-phase algorithm for bin stretching with stretching factor 1.5 (Q1680492) (← links)
- Online bin stretching with three bins (Q1702659) (← links)
- An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time (Q2043022) (← links)
- Discovering and certifying lower bounds for the online bin stretching problem (Q2089680) (← links)
- Tight lower bounds for semi-online scheduling on two uniform machines with known optimum (Q2323435) (← links)
- Online makespan minimization with parallel schedules (Q2362356) (← links)
- Improved lower bounds for the online bin stretching problem (Q2399609) (← links)
- An efficient algorithm for bin stretching (Q2450663) (← links)
- Semi-online scheduling with ``end of sequence'' information (Q2460107) (← links)
- Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information (Q2464037) (← links)
- Semi-online scheduling jobs with tightly-grouped processing times on three identical machines (Q2565855) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- ONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINES (Q2998841) (← links)
- Online Order Scheduling Problem with the Same Order Size on Two Identical Machines (Q4978463) (← links)
- Online Bounded Analysis (Q5740182) (← links)
- Bin stretching with migration on two hierarchical machines (Q6093406) (← links)
- Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)
