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

DOI10.1016/J.IPL.2011.10.013MaRDI QIDQ763495zbMATH OpenOpenAlexWikidataFDO

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

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 machinetotal tardinesspseudo-polynomial algorithmgraphical algorithmnumber of tardy jobstotal late work

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• The single-machine total tardiness scheduling problem: review and extensions
• A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
• A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness
• On the Single-machine Scheduling Problem with Tardiness Penalties
• A new decomposition approach for the single machine total tardiness scheduling problem
• A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine
• Single machine scheduling with total tardiness criterion and convex controllable processing times
• Single-machine scheduling problems with the general sum-of-processing-time and position-dependent effect function
• A survey of algorithms for the single machine total weighted tardiness scheduling problem

Cites work

• scientific article; zbMATH DE number 3902030 (Why is no real title available?)
• scientific article; zbMATH DE number 3471786 (Why is no real title available?)
• scientific article; zbMATH DE number 3550186 (Why is no real title available?)
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• A decomposition algorithm for the single machine total tardiness problem
• A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems
• A special case of the single-machine total tardiness problem is NP-hard
• Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Minimizing Total Tardiness on One Machine is NP-Hard
• Single Machine Scheduling to Minimize Total Late Work

Cited in

(2)

• Graphical method to solve combinatorial optimization problems
• A note on generalizing the maximum lateness criterion for scheduling

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

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