Minimizing mean flow time with release time constraint
From MaRDI portal
Publication:914352
DOI10.1016/0304-3975(90)90100-VzbMath0701.68008MaRDI QIDQ914352
Joseph Y.-T. Leung, Gilbert H. Young, Jian-Zhong Du
Publication date: 1990
Published in: Theoretical Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Maximizing job benefits on-line ⋮ Approximating total flow time on parallel machines ⋮ Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time ⋮ The complexity of mean flow time scheduling problems with release times ⋮ 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 total completion time for preemptive scheduling with release dates and deadline constraints ⋮ Minimizing flow time on a constant number of machines with preemption ⋮ Parameterized complexity of machine scheduling: 15 open problems ⋮ Ideal schedules in parallel machine settings ⋮ Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems ⋮ Preemptive scheduling on identical parallel machines subject to deadlines. ⋮ A class of on-line scheduling algorithms to minimize total completion time ⋮ Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines ⋮ Minimizing average completion time in the presence of release dates ⋮ 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
Cites Work
