The following pages link to On-line bin-stretching (Q5958712):
Displayed 17 items.
- Semi-online scheduling revisited (Q442235) (← 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)
- 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)
- 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)
- 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)
- ONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINES (Q2998841) (← links)