Pages that link to "Item:Q1944164"
From MaRDI portal
The following pages link to Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time (Q1944164):
Displaying 16 items.
- Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
- On-line scheduling to minimize Max flow time: an optimal preemptive algorithm (Q813965) (← links)
- Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine (Q829170) (← links)
- Online scheduling on unbounded parallel-batch machines to minimize the makespan (Q990962) (← links)
- Online scheduling on bounded batch machines to minimize the maximum weighted completion time (Q1656199) (← links)
- The medical laboratory scheduling for weighted flow-time (Q1740398) (← links)
- Online algorithms to schedule a proportionate flexible flow shop of batching machines (Q2093188) (← links)
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan (Q2314063) (← links)
- Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems (Q2319627) (← links)
- Online unbounded batch scheduling on parallel machines with delivery times (Q2354308) (← links)
- Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan (Q2445903) (← links)
- A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES (Q2931730) (← links)
- Online Scheduling of Bounded Length Jobs to Maximize Throughput (Q3558919) (← links)
- Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines (Q5009625) (← links)
- Fundamentals of Computation Theory (Q5900785) (← links)
- Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions (Q6112735) (← links)
