Minimizing total flow time and total completion time with immediate dispatching
From MaRDI portal
Publication:878441
DOI10.1007/S00453-006-0193-6zbMATH Open1111.68013OpenAlexW2088810648MaRDI QIDQ878441FDOQ878441
Authors: Nir Avrahami, Yossi Azar 
Publication date: 26 April 2007
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-006-0193-6
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
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Nonnumerical algorithms (68W05)
Cited In (15)
- Minimizing Average Flow-Time
- Minimizing the Flow Time Without Migration
- Approximating total flow time on parallel machines
- SRPT applied to bandwidth-sharing networks
- Resource augmentation for weighted flow-time explained by dual fitting
- Greed works -- online algorithms for unrelated machine stochastic scheduling
- Minimizing the flow time without migration
- Non-clairvoyantly scheduling to minimize convex functions
- Online makespan minimization: the power of restart
- Improved multi-processor scheduling for flow time and energy
- New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling
- An improved greedy algorithm for stochastic online scheduling on unrelated machines
- Rejecting jobs to minimize load and maximum 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
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)
