Precedence theorems and dynamic programming for the single-machine weighted tardiness problem |
| |
Authors: | Salim Rostami Stefan Creemers Roel Leus |
| |
Affiliation: | 1. Management Department, IÉSEG School of Management, (LEM-CNRS 9221), Lille, France;2. ORSTAT, KU Leuven, Belgium |
| |
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. |
| |
Keywords: | Scheduling Single machine Precedence constraints Weighted tardiness Dynamic programming |
本文献已被 ScienceDirect 等数据库收录! |
|