A note on a single machine scheduling problem with generalized total tardiness objective function

DOI10.1016/j.ipl.2011.10.013zbMath1233.90155OpenAlexW2093603486WikidataQ57633831 ScholiaQ57633831MaRDI QIDQ763495

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

Publication date: 9 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.10.013

zbMATH Keywords

schedulingsingle machinegraphical algorithmtotal tardinessnumber of tardy jobspseudo-polynomial algorithmtotal late work

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Graphical method to solve combinatorial optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem
• A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems
• A decomposition algorithm for the single machine total tardiness problem
• A special case of the single-machine total tardiness problem is NP-hard
• Minimizing Total Tardiness on One Machine is NP-Hard
• Single Machine Scheduling to Minimize Total Late Work
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems

This page was built for publication: A note on a single machine scheduling problem with generalized total tardiness objective function