Pages that link to "Item:Q1977643"
From MaRDI portal
The following pages link to A comment on scheduling on uniform machines under chain-type precedence constraints (Q1977643):
Displaying 18 items.
- Parallel machine covering with limited number of preemptions (Q462268) (← links)
- Scheduling of uniform parallel machines with s-precedence constraints (Q646123) (← links)
- Parametric analysis of the quality of single preemption schedules on three uniform parallel machines (Q829195) (← links)
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
- Optimal and online preemptive scheduling on uniformly related machines (Q1041344) (← links)
- A new approximation algorithm for UET-scheduling with chain-type precedence constraints. (Q1406686) (← links)
- The benefit of preemption for single machine scheduling so as to minimize total weighted completion time (Q1709959) (← links)
- Scheduling identical jobs with chain precedence constraints on two uniform machines (Q1974574) (← links)
- Algorithms with limited number of preemptions for scheduling on parallel machines (Q2015808) (← links)
- Preemptive and non-preemptive scheduling on two unrelated parallel machines (Q2093189) (← links)
- Schedules with a single preemption on uniform parallel machines (Q2414478) (← links)
- The benefit of preemption with respect to the \(\ell_p\) norm (Q2417189) (← links)
- Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines (Q2957687) (← links)
- (Q3402864) (← links)
- APPROXIMATION SCHEMES FOR SCHEDULING JOBS WITH CHAIN PRECEDENCE CONSTRAINTS (Q5187850) (← links)
- Randomized on-line scheduling on two uniform machines (Q5937432) (← links)
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios (Q5949924) (← links)
- (Q6068238) (← links)
