Preemptive scheduling of two uniform parallel machines to minimize total tardiness
From MaRDI portal
Publication:439607
DOI10.1016/J.EJOR.2011.11.023zbMATH Open1244.90098OpenAlexW2037425809MaRDI QIDQ439607FDOQ439607
Authors: I. N. Lushchakova 
Publication date: 16 August 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.11.023
Recommendations
- Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines
- Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
- Minimizing total tardiness on parallel machines with preemptions
- scientific article; zbMATH DE number 3883931
- Preemptive scheduling on uniform machines to minimize mean flow time
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Title not available (Why is that?)
- Preemptive Scheduling with Release Times, Deadlines, and Due Times
- Preemptive scheduling on uniform parallel machines with controllable job processing times
- Title not available (Why is that?)
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
- Complexity results for single-machine problems with positive finish-start time-lags
- Erratum to: ``Minimizing total tardiness on parallel machines with preemptions
- Preemptive scheduling on uniform machines to minimize mean flow time
- Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines
- Optimal preemptive scheduling for general target functions
- Minimizing total completion time on uniform machines with deadline constraints
- Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
- Title not available (Why is that?)
- Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
- Optimal preemptive scheduling on uniform machines with discounted flowtime objectives
Cited In (10)
- Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints
- Minimizing total tardiness on parallel machines with preemptions
- Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
- On preemption redundancy in scheduling unit processing time jobs on two parallel machines
- On preemptive scheduling: A general setting for the two-phase method
- On the two-phase method for preemptive scheduling
- Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines
- An efficient algorithm for finding ideal schedules
- An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness
- A backward approach in list scheduling algorithms for multi-machine tardiness problems
This page was built for publication: Preemptive scheduling of two uniform parallel machines to minimize total tardiness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439607)
