Minimizing Mean Flow Time With Release Time and Deadline Constraints
From MaRDI portal
Publication:4033756
DOI10.1006/jagm.1993.1003zbMath0770.90034MaRDI QIDQ4033756
Jian-Zhong Du, Joseph Y.-T. Leung
Publication date: 16 May 1993
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1993.1003
90B35: Deterministic scheduling theory in operations research
Related Items
Mathematical programming formulations for machine scheduling: A survey, Minimizing total completion time for preemptive scheduling with release dates and deadline constraints, Minimizing mean flow time with release time constraint, Match-up scheduling under a machine breakdown, Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion, Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines, A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints