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

DOI10.2478/FCDS-2014-0002MaRDI QIDQ902745zbMATH OpenOpenAlexFDO

Authors Cheng He, Hao Lin, Yanpei Liu, Junmei Dou

Publication date 4 January 2016

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

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

zbMATH Keywords

release datetotal completion timepreemptive schedulingdeadline

Mathematics Subject Classification ID

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

Recommendations

• A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
• Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines
• Minimizing Mean Flow Time With Release Time and Deadline Constraints
• scientific article; zbMATH DE number 3883931
• Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness

Cites work

• scientific article; zbMATH DE number 1634827 (Why is no real title available?)
• scientific article; zbMATH DE number 3691044 (Why is no real title available?)
• Mathematical programming formulations for machine scheduling: A survey
• Minimizing Mean Flow Time With Release Time and Deadline Constraints
• Minimizing mean flow time with release time constraint
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Preemptive scheduling with two minimax criteria
• Some simple scheduling algorithms

Cited in

(13)

• Scheduling to minimize release-time resource consumption and tardiness penalties
• The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays
• Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines
• An exact approach to early/tardy scheduling with release dates
• Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion
• Approximate Deadline-Scheduling with Precedence Constraints
• Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
• A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
• Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness
• Preemptive scheduling with deadlines on a single machine
• Preemptive scheduling with availability constraints to minimize total weighted completion times
• Minimizing Mean Flow Time With Release Time and Deadline Constraints
• Minimizing total completion time subject to job release dates and preemption penalties

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

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