Title :

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

Author(s) :

Rostami, Salim [Auteur]
Lille économie management - UMR 9221 [LEM]
Creemers, Stefan [Auteur]
Lille économie management - UMR 9221 [LEM]
Leus, Roel [Auteur]
Operations Research and Business Statistics [ORSTAT]

Journal title :

European Journal of Operational Research

Pages :

43 - 49

Publisher :

Elsevier

Publication date :

2019-01-01

ISSN :

0377-2217

English keyword(s) :

Scheduling
Single machine
Precedence constraints
Weighted tardiness
Dynamic programming

HAL domain(s) :

Sciences de l'Homme et Société/Gestion et management

English abstract : [en]

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 ...
Show more >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.Show less >

Language :

Anglais

Popular science :

Non

Collections :

• Lille Économie Management (LEM) - UMR 9221

Source :

Harvested from HAL