Minimizing total flow time and total completion time with immediate dispatching
From MaRDI portal
(Redirected from Publication:878441)
Recommendations
- Minimizing the maximum flow time in batch scheduling
- Minimizing Average Flow-Time
- Minimizing Schedule Length Subject to Minimum Flow Time
- Minimizing Mean Flow Time With Release Time and Deadline Constraints
- Minimizing total tardiness in no-wait flowshops
- Minimizing mean flow time with release time constraint
- Minimization of mean flow time for some discrete-continuous scheduling problems
- Scheduling chains to minimize mean flow time
- Minimizing total weighted completion time in a proportionate flow shop
- Minimizing weighted flow time
Cited in
(15)- Resource augmentation for weighted flow-time explained by dual fitting
- Approximating total flow time on parallel machines
- An improved greedy algorithm for stochastic online scheduling on unrelated machines
- Non-clairvoyantly scheduling to minimize convex functions
- Greed works -- online algorithms for unrelated machine stochastic scheduling
- Minimizing Average Flow-Time
- Sleep management on multiple machines for energy and flow time
- Improved results for scheduling batched parallel jobs by using a generalized analysis framework
- Minimizing the flow time without migration
- Online makespan minimization: the power of restart
- New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling
- Improved multi-processor scheduling for flow time and energy
- Rejecting jobs to minimize load and maximum flow-time
- Minimizing the Flow Time Without Migration
- SRPT applied to bandwidth-sharing networks
This page was built for publication: Minimizing total flow time and total completion time with immediate dispatching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878441)
