HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Solution Algorithms for Minimizing the Total Tardiness with Budgeted Processing Time Uncertainty

Abstract : We investigate algorithms that solve exactly the robust single machine scheduling problem that minimizes the total tardiness. We model the processing times as uncertain and let them take any value in a budgeted uncertainty set. Therefore , the objective seeks to minimize the worst-case tardiness over all possible values. We compare, through computational experiments, two types of solution algorithms. The first combines classical MILP formulations with row-and-column generation algorithms. The second generalizes the classical branch-and-bound algorithms to the robust context, extending state-of-the-art concepts used for the deterministic version of the problem. By generalizing the classical branch-and-bound algorithm we are able to assemble and discuss good algorithmic decisions steps that once put together make our robust branch-and-bound case attractive. For example, we extend and adapt dominance rules to our uncertain problem, making them an important component of our robust algorithms. We assess our algorithms on instances inspired by the scientific literature and identify under what conditions an algorithm has better performance than others. We introduce a new classifying parameter to group our instances, also extending existing methods for the deterministic problem case.
Document type :
Journal articles
Complete list of metadata

Cited literature [38 references]  Display  Hide  Download

Contributor : Michaël Poss Connect in order to contact the contributor
Submitted on : Friday, February 14, 2020 - 9:04:22 AM
Last modification on : Wednesday, November 3, 2021 - 6:11:19 AM


Files produced by the author(s)



Marco Silva, Michael Poss, Nelson Maculan. Solution Algorithms for Minimizing the Total Tardiness with Budgeted Processing Time Uncertainty. European Journal of Operational Research, Elsevier, 2020, 283 (1), pp.70-82. ⟨10.1016/j.ejor.2019.10.037⟩. ⟨hal-02478655⟩



Record views


Files downloads