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

DOI10.1134/S0005117920050069zbMath1455.90065OpenAlexW3021012527MaRDI QIDQ827995

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

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

schedulingnumber of tardy jobstotal weighted tardinessmaximization problemssingle machine problems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Single machine total tardiness maximization problems: complexity and algorithms
• Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
• Scheduling equal-length jobs on identical parallel machines
• Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
• Parallel machine problems with equal processing times: a survey
• Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties
• Minimizing Total Tardiness on One Machine is NP-Hard
• A Dynamic Programming Approach to Sequencing Problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity

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