Preemptive scheduling of two uniform parallel machines to minimize total tardiness

DOI10.1016/J.EJOR.2011.11.023MaRDI QIDQ439607zbMATHOpenAlexFDO

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

zbMATH Keywords

schedulingtotal tardinesspolynomial algorithmuniform machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

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

Cites work

• scientific article; zbMATH DE number 3873052 (Why is no real title available?)
• scientific article; zbMATH DE number 724323 (Why is no real title available?)
• scientific article; zbMATH DE number 2114378 (Why is no real title available?)
• Complexity results for single-machine problems with positive finish-start time-lags
• Erratum to: ``Minimizing total tardiness on parallel machines with preemptions
• Minimizing total completion time on uniform machines with deadline constraints
• Optimal preemptive scheduling for general target functions
• Optimal preemptive scheduling on uniform machines with discounted flowtime objectives
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
• Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
• Preemptive Scheduling with Release Times, Deadlines, and Due Times
• Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines
• Preemptive scheduling on uniform machines to minimize mean flow time
• Preemptive scheduling on uniform parallel machines with controllable job processing times
• Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time

Cited in

(10)

• Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
• A backward approach in list scheduling algorithms for multi-machine tardiness problems
• Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints
• Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines
• An efficient algorithm for finding ideal schedules
• Minimizing total tardiness on parallel machines with preemptions
• On the two-phase method for preemptive scheduling
• An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness
• On preemptive scheduling: A general setting for the two-phase method
• On preemption redundancy in scheduling unit processing time jobs on two parallel machines

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)