Scheduling chains to minimize mean flow time

DOI10.1016/S0020-0190(97)00037-9MaRDI QIDQ290213zbMATH OpenFDO

Authors Moshe Dror, Paolo Dell'Olmo, Wieslaw Kubiak

Publication date 1 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

computational complexityanalysis of algorithmscombinatorial problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Scheduling chain-structured tasks to minimize makespan and mean flow time
• Minimizing Schedule Length Subject to Minimum Flow Time
• Preemptive scheduling to minimize mean weighted flow time
• Minimizing the maximum flow time in batch scheduling
• Minimization of mean flow time for some discrete-continuous scheduling problems
• Simultaneous Resource Scheduling to Minimize Weighted Flow Times
• Scheduling semi-malleable jobs to minimize mean flow time
• A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME
• SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS
• Scheduling in flowshops to minimize total tardiness of jobs

Cites work

• scientific article; zbMATH DE number 108110 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• New results on the completion time variance minimization
• Scheduling chain-structured tasks to minimize makespan and mean flow time
• Scheduling independent tasks to reduce mean finishing time

Cited in

(13)

• Minimizing total flow time and total completion time with immediate dispatching
• Scheduling semi-malleable jobs to minimize mean flow time
• Inequality-sum: a global constraint capturing the objective function
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems
• Minimizing the maximum flow time in batch scheduling
• Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints
• `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders
• Single-machine scheduling problems with precedence constraints and simple linear deterioration
• REAL-TIME DISPATCHING: SCHEDULING STABILITY AND PRECEDENCE
• Single-machine scheduling with precedence constraints and position-dependent processing times
• Linear and quadratic algorithms for scheduling chains and opposite chains
• Tree precedence in scheduling: The strong-weak distinction
• Minimizing Mean Flow Time With Release Time and Deadline Constraints

This page was built for publication: Scheduling chains to minimize mean flow time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290213)