Minimizing total completion time for preemptive scheduling with release dates and deadline constraints
DOI10.2478/FCDS-2014-0002zbMATH Open1328.90050OpenAlexW2029855301MaRDI QIDQ902745FDOQ902745
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)
Full work available at URL: https://doi.org/10.2478/fcds-2014-0002
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
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Mathematical programming formulations for machine scheduling: A survey
- Title not available (Why is that?)
- Some simple scheduling algorithms
- Preemptive scheduling with two minimax criteria
- Title not available (Why is that?)
- Minimizing Mean Flow Time With Release Time and Deadline Constraints
- Minimizing mean flow time with release time constraint
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 with deadlines on a single machine
- Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness
- 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)
