Preemptive scheduling of two uniform parallel machines to minimize total tardiness

DOI10.1016/j.ejor.2011.11.023zbMath1244.90098OpenAlexW2037425809MaRDI QIDQ439607

Irina 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

schedulingpolynomial algorithmuniform machinestotal tardiness

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Erratum to: ``Minimizing total tardiness on parallel machines with preemptions
• Optimal preemptive scheduling on uniform machines with discounted flowtime objectives
• Preemptive scheduling on uniform parallel machines with controllable job processing times
• Preemptive scheduling on uniform machines to minimize mean flow time
• Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines
• 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
• 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
• Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
• Preemptive Scheduling with Release Times, Deadlines, and Due Times
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Preemptive scheduling of two uniform parallel machines to minimize total tardiness