Pages that link to "Item:Q1870021"
From MaRDI portal
The following pages link to Semi-on-line problems on two identical machines with combined partial information (Q1870021):
Displayed 28 items.
- Semi-online scheduling for jobs with release times (Q385494) (← links)
- Semi-online scheduling problems on a small number of machines (Q398877) (← links)
- Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
- Best semi-online algorithms for unbounded parallel batch scheduling (Q534351) (← links)
- Semi-online preemptive scheduling: one algorithm for all variants (Q537921) (← links)
- Semi-online scheduling with known partial information about job sizes on two identical machines (Q551204) (← links)
- Optimal semi-online preemptive algorithms for machine covering on two uniform machines (Q557905) (← links)
- Several semi-online scheduling problems on two identical machines with combined information (Q714838) (← links)
- Linear time algorithms for parallel machine scheduling (Q856829) (← links)
- Semi-online machine covering on two uniform machines with known total size (Q858190) (← links)
- Online and semi-online scheduling of two machines under a grade of service provision (Q867934) (← links)
- Optimal semi-online algorithms for machine covering (Q870840) (← links)
- Semi-online scheduling problems on two identical machines with inexact partial information (Q884466) (← 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)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines (Q1944914) (← 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 scheduling for jobs with nondecreasing release times and similar lengths on parallel machines (Q5169463) (← links)
- Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs (Q5248073) (← links)
- Semi-online scheduling with combined information on two identical machines in parallel (Q5963644) (← links)
- Bin stretching with migration on two hierarchical machines (Q6093406) (← links)