Pages that link to "Item:Q2314063"
From MaRDI portal
The following pages link to Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan (Q2314063):
Displaying 10 items.
- On-line scheduling on parallel machines to minimize the makespan (Q328085) (← links)
- A new algorithm for online uniform-machine scheduling to minimize the makespan (Q845691) (← links)
- Online scheduling on unbounded parallel-batch machines to minimize the makespan (Q990962) (← links)
- A best possible on-line algorithm for scheduling on uniform parallel-batch machines (Q1637343) (← links)
- Online makespan scheduling with job migration on uniform machines (Q2067667) (← links)
- Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan (Q2445903) (← links)
- Online scheduling on two parallel identical machines under a grade of service provision (Q2683376) (← links)
- A parametric scheme for online uniform-machine scheduling to minimize the makespan (Q2833437) (← links)
- Online Scheduling on Two Uniform Machines to Minimize the Makespan with a Periodic Availability Constraint (Q3578374) (← links)
- Online Makespan Scheduling with Job Migration on Uniform Machines (Q5009583) (← links)