Minimization of mean flow time for some discrete-continuous scheduling problems

zbMATH Open0885.90056MaRDI QIDQ1368686FDOQ1368686

Authors: Joanna Józefowska, Jan Węglarz 

Publication date: 29 September 1997

Published in: Bulletin of the Polish Academy of Sciences. Technical Sciences (Search for Journal in Brave)

Recommendations

• Discrete-continuous scheduling problems -- mean completion time results
• On a methodology for discrete-continuous scheduling
• Resource level minimization in the discrete-continuous scheduling
• Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
• A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan

zbMATH Keywords

parallel machinesmean flow timecontinuously divisible, renewable resourcesindependent, nonpreemptable jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (6)

• Stability of a schedule minimizing mean flow time
• Minimizing Mean Completion Time for Special Flowshop Problems
• Scheduling chains to minimize mean flow time
• Resource level minimization in the discrete-continuous scheduling
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
• Minimizing total flow time and total completion time with immediate dispatching

This page was built for publication: Minimization of mean flow time for some discrete-continuous scheduling problems

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