Pages that link to "Item:Q2445903"
From MaRDI portal
The following pages link to Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan (Q2445903):
Displaying 11 items.
- Online makespan minimization with budgeted uncertainty (Q832833) (← links)
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs (Q835640) (← links)
- Online scheduling on unbounded parallel-batch machines to minimize the makespan (Q990962) (← links)
- Online batch scheduling with kind release times and incompatible families to minimize makespan (Q1744626) (← links)
- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time (Q1944164) (← links)
- Online makespan scheduling with job migration on uniform machines (Q2067667) (← links)
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan (Q2314063) (← links)
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines (Q2434270) (← links)
- Online minimum makespan scheduling with a buffer (Q2929632) (← links)
- (Q3403188) (← links)
- Online Makespan Scheduling with Job Migration on Uniform Machines (Q5009583) (← links)