Minimizing total completion time for preemptive scheduling with release dates and deadline constraints

DOI10.2478/FCDS-2014-0002zbMath1328.90050OpenAlexW2029855301MaRDI QIDQ902745

Yanpei Liu, Junmei Dou, Cheng He, Hao Lin

Publication date: 4 January 2016

Published in: Foundations of Computing and Decision Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/fcds-2014-0002

zbMATH Keywords

preemptive schedulingtotal completion timerelease datedeadline

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines

Cites Work

• Unnamed Item
• Unnamed Item
• Mathematical programming formulations for machine scheduling: A survey
• Minimizing mean flow time with release time constraint
• Preemptive scheduling with two minimax criteria
• Minimizing Mean Flow Time With Release Time and Deadline Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Some simple scheduling algorithms

This page was built for publication: Minimizing total completion time for preemptive scheduling with release dates and deadline constraints