Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine

DOI10.1134/S0005117920050069MaRDI QIDQ827995zbMATH OpenOpenAlexFDO

Authors Evgeny R. Gafarov, Alexander A. Lazarev, Frank Werner

Publication date 14 January 2021

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0005117920050069

zbMATH Keywords

maximization problemsnumber of tardy jobsschedulingsingle machine problemstotal weighted tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
• Properties of optimal schedules for the minimization total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine
• An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness
• Minimizing total tardiness on a single machine with unequal release dates
• Single machine scheduling to minimize total weighted tardiness

Cites work

• A Dynamic Programming Approach to Sequencing Problems
• Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity
• scientific article; zbMATH DE number 2109192 (Why is no real title available?)
• Minimizing Total Tardiness on One Machine is NP-Hard
• Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel machine problems with equal processing times: a survey
• Scheduling equal-length jobs on identical parallel machines
• Single machine total tardiness maximization problems: complexity and algorithms
• Single-machine scheduling of unit-time jobs with earliness and tardiness penalties
• Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one

Cited in

(7)

• Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
• Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
• Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost
• Properties of optimal schedules for the minimization total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine
• Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
• Scheduling a single machine with multiple due dates per job
• An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness

This page was built for publication: Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q827995)