Minimizing mean flow time with release time constraint

DOI10.1016/0304-3975(90)90100-VMaRDI QIDQ914352zbMATH OpenFDO

Authors Joseph Y.-T. Leung, Gilbert H. Young, Jian-Zhong Du

Publication date 1990

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(90)90100-V

zbMATH Keywords

independent taks on m\(\geq 1\) identical processorsNP-hardpreemptive scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Minimizing Mean Flow Time With Release Time and Deadline Constraints
• Minimizing average completion time in the presence of release dates
• The complexity of mean flow time scheduling problems with release times
• Minimizing mean flow time with parallel processors and resource constraints
• scientific article; zbMATH DE number 89399

Cites work

• scientific article; zbMATH DE number 3873052 (Why is no real title available?)
• scientific article; zbMATH DE number 3757695 (Why is no real title available?)
• scientific article; zbMATH DE number 3633982 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Minimizing Mean Flow Time With Release Time and Deadline Constraints
• Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time

Cited in

(27)

• Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines
• Minimizing mean flow time with parallel processors and resource constraints
• Minimizing average completion time in the presence of release dates
• Maximizing job benefits on-line
• Is a unit-job shop not easier than identical parallel machines?
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
• Minimizing flow time on a constant number of machines with preemption
• Parameterized complexity of machine scheduling: 15 open problems
• Preemptive scheduling on identical parallel machines subject to deadlines.
• A class of on-line scheduling algorithms to minimize total completion time
• Scheduling chain-structured tasks to minimize makespan and mean flow time
• Scheduling multiprocessor tasks for mean flow time criterion
• Ideal schedules in parallel machine settings
• Split scheduling with uniform setup times
• New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria
• A note on \({\mathbb {NP}}\)-hardness of preemptive mean flow-time scheduling for parallel machines
• Approximating total flow time on parallel machines
• Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time
• Minimizing mean flow time for UET tasks
• Minimizing Schedule Length Subject to Minimum Flow Time
• scientific article; zbMATH DE number 89399 (Why is no real title available?)
• Minimizing Mean Flow Time With Release Time and Deadline Constraints
• Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems
• Two-Agent Scheduling with Resource Augmentation on Multiple Machines
• Minimizing total flow time and total completion time with immediate dispatching
• The complexity of mean flow time scheduling problems with release times
• Minimizing total completion time for preemptive scheduling with release dates and deadline constraints

This page was built for publication: Minimizing mean flow time with release time constraint

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