An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness
type: Item
instance of: scholarly article
title: An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness
zbMATH Open document ID: 1154.90495
author: N. E. Zubov
published in: Journal of Scheduling
publication date: 2007-05-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5153369
zbMATH Keywords: Single machine
zbMATH Keywords: Preemptive scheduling
zbMATH Keywords: Release date
zbMATH Keywords: Equal-length jobs
zbMATH Keywords: Total tardiness
MaRDI profile type: Publication
full work available at URL: s10951-006-7039-6
OpenAlex ID: W2061109544
cites work: Q3885495
cites work: Scheduling equal-length jobs on identical parallel machines
cites work: Complexity results for single-machine problems with positive finish-start time-lags
cites work: Q4247460
cites work: Optimal assignment of due-dates for preemptive single-machine scheduling
cites work: Q3993992
cites work: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q3217922
cites work: Q3525910
cites work: Solution of the single machine total tardiness problem
DOI: 10.1007/S10951-006-7039-6
Recommended article: An exact algorithm for the preemptive single machine scheduling of equal-length jobs
Recommended article: Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
Recommended article: An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
Recommended article: Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine
Recommended article: Preemptive scheduling of equal-length jobs in polynomial time
Recommended article: Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness
Recommended article: Preemptive scheduling of two uniform parallel machines to minimize total tardiness
Recommended article: Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
Recommended article: Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
Recommended article: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
description: scientific article; zbMATH DE number 5153369