Solution of the single machine total tardiness problem
From MaRDI portal
Publication:1592283
DOI<55::AID-JOS14>3.0.CO;2-5 10.1002/(SICI)1099-1425(199903/04)2:2<55::AID-JOS14>3.0.CO;2-5zbMath0963.90029OpenAlexW2017470706MaRDI QIDQ1592283
Frederico Della Croce, Andrea Grosso, Wlodzimierz Szwarc
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<55::aid-jos14>3.0.co;2-5
Related Items
A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem ⋮ Erratum—One Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons ⋮ Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications ⋮ Some remarks on the decomposition properties of the single machine total tardiness problem ⋮ A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems ⋮ An investigation on a two-agent single-machine scheduling problem with unequal release dates ⋮ A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates ⋮ An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness ⋮ A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times ⋮ Algorithms for some maximization scheduling problems on a single machine ⋮ Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness ⋮ A special case of the single-machine total tardiness problem is NP-hard ⋮ A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects ⋮ A hybrid algorithm for the single-machine total tardiness problem ⋮ Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one ⋮ Algorithmic paradoxes of the single-machine total tardiness problem ⋮ Single machine scheduling problems with financial resource constraints: some complexity results and properties ⋮ On the single machine total tardiness problem ⋮ On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation ⋮ Scheduling a single machine to minimize a regular objective function under setup constraints ⋮ \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees ⋮ Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty ⋮ Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem ⋮ The single-machine total tardiness scheduling problem: review and extensions ⋮ Finding the Pareto-optima for the total and maximum tardiness single machine problem ⋮ One-Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons
Cites Work
- Decomposition in single-machine scheduling
- Decomposition of the single machine total tardiness problem
- A decomposition algorithm for the single machine total tardiness problem
- On decomposition of the total tardiness problem
- Minimizing Total Tardiness on One Machine is NP-Hard
- Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
- The Total Tardiness Problem: Review and Extensions
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
This page was built for publication: Solution of the single machine total tardiness problem
