Skip to Main content Skip to Navigation
Journal articles

Precedence theorems and dynamic programming for the single-machine weighted tardiness problem

Abstract : We tackle precedence-constrained sequencing on a single machine in order to minimize total weighted tardiness. Classic dynamic programming (DP) methods for this problem are limited in performance due to excessive memory requirements, particularly when the precedence network is not sufficiently dense. Over the last decades, a number of precedence theorems have been proposed, which distinguish dominant precedence constraints for a job pool that is initially without precedence relation. In this paper, we connect and extend the findings of the foregoing two strands of literature. We develop a framework for applying the precedence theorems to the precedence-constrained problem to tighten the search space, and we propose an exact DP algorithm that utilizes a new efficient memory management technique. Our procedure outperforms the state-of-the-art algorithm for instances with medium to high network density. We also empirically verify the computational gain of using different sets of precedence theorems.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01914859
Contributor : Isabelle Celet <>
Submitted on : Wednesday, November 7, 2018 - 11:05:01 AM
Last modification on : Tuesday, May 12, 2020 - 3:32:28 PM

Identifiers

Collections

Citation

Salim Rostami, Stefan Creemers, Roel Leus. Precedence theorems and dynamic programming for the single-machine weighted tardiness problem. European Journal of Operational Research, Elsevier, 2019, 272 (1), pp.43 - 49. ⟨10.1016/j.ejor.2018.06.004⟩. ⟨hal-01914859⟩

Share

Metrics

Record views

99