Minimizing Schedule Length Subject to Minimum Flow Time

DOI10.1137/0218022MaRDI QIDQ3826351zbMATH OpenOpenAlexFDO

Authors Joseph Y.-T. Leung, Gilbert H. Young

Publication date 1989

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0218022

zbMATH Keywords

flow timeidentical processorsindependent tasksminimum flow timenonpreemptive schedulingNP-hardpreemptive schedulingschedule length

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
• Minimizing Mean Flow Time With Release Time and Deadline Constraints
• Minimizing mean flow time with release time constraint
• Minimizing Flow Time on Parallel Identical Processors with Variable Unit Processing Time
• Ideal preemptive schedules on two processors

Cited in

(20)

• Minimizing the number of machines for minimum length schedules
• Stability of a schedule minimizing mean flow time
• Minimizing the maximum flow time in batch scheduling
• Parallel machine makespan minimization subject to machine availability and total completion time constraints
• Multicriteria scheduling
• Multicriteria scheduling problems: a survey
• Scheduling chains to minimize mean flow time
• Fast approximation algorithms for bi-criteria scheduling with machine assignment costs
• Total completion time minimization on multiple machines subject to machine availability and makespan constraints
• Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
• Minimizing Average Flow-Time
• Minimizing Flow Time on Parallel Identical Processors with Variable Unit Processing Time
• Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines
• Minimizing Mean Flow Time With Release Time and Deadline Constraints
• scientific article; zbMATH DE number 2079378 (Why is no real title available?)
• Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis
• Minimizing makespan subject to minimum flowtime on two identical parallel machines
• Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints
• Scheduling to minimize the maximum total completion time per machine
• Minimizing total flow time and total completion time with immediate dispatching

This page was built for publication: Minimizing Schedule Length Subject to Minimum Flow Time

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