Solution of the single machine total tardiness problem

DOI10.1002/(SICI)1099-1425(199903/04)2:2%3C55::AID-JOS14%3E3.0.CO;2-5zbMATH Open0963.90029OpenAlexW2017470706MaRDI QIDQ1592283FDOQ1592283

Authors: Wlodzimierz Szwarc, F. Della Croce, Andrea Grosso 

Publication date: 8 July 2001

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/(sici)1099-1425(199903/04)2:2%3C55::aid-jos14%3E3.0.co;2-5

Recommendations

• Decomposition of the single machine total tardiness problem
• A new decomposition approach for the single machine total tardiness scheduling problem
• On the single machine total tardiness problem
• scientific article; zbMATH DE number 1076139
• Dynamic programming and decomposition approaches for the single machine total tardiness problem

zbMATH Keywords

decompositiondue dateslower boundsingle machine schedulingtardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Minimizing Total Tardiness on One Machine is NP-Hard
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• A decomposition algorithm for the single machine total tardiness problem
• On decomposition of the total tardiness problem
• The Total Tardiness Problem: Review and Extensions
• A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
• Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
• Decomposition of the single machine total tardiness problem
• Decomposition in single-machine scheduling

Cited In (33)

• Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
• Single machine scheduling problems with financial resource constraints: some complexity results and properties
• Finding the Pareto-optima for the total and maximum tardiness single machine problem
• A new decomposition approach for the single machine total tardiness scheduling problem
• Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem
• Some remarks on the decomposition properties of the single machine total tardiness problem
• New insights on the single machine total tardiness problem
• The Single Machine Early/Tardy Problem
• Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
• Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty
• \textit{Branch} \& \textit{memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees
• On the single machine total tardiness problem
• Insights into two solution procedures for the single machine tardiness problem
• A special case of the single-machine total tardiness problem is NP-hard
• Decomposition of the single machine total tardiness problem
• A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
• A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
• Algorithms for some maximization scheduling problems on a single machine
• A theoretical development for the total tardiness problem and its application in branch and bound algorithms
• An investigation on a two-agent single-machine scheduling problem with unequal release dates
• A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects
• On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
• A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
• Scheduling a single machine to minimize a regular objective function under setup constraints
• The single-machine total tardiness scheduling problem: review and extensions
• An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness
• Algorithmic paradoxes of the single-machine total tardiness problem
• A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems
• A hybrid algorithm for the single-machine total tardiness problem
• Erratum: One machine sequencing to minimize total tardiness: a fourth theorem for Emmons
• Dynamic programming and decomposition approaches for the single machine total tardiness problem
• Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness
• One-machine sequencing to minimize total tardiness: a fourth theorem for Emmons

This page was built for publication: Solution of the single machine total tardiness problem

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