Complexity results for common due date scheduling problems with interval data and minmax regret criterion - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2019

Complexity results for common due date scheduling problems with interval data and minmax regret criterion

Résumé

We consider the problem of scheduling independent jobs with a common due date on a single machine with the objective of maximizing the number of early jobs. The processing times are uncertain and take any value from a certain job dependent interval. For measuring the quality of an algorithm for that problem with imprecise data we use the concept of minimizing the maximum regret. We present complexity results and some dominance properties.

Dates et versions

hal-03938888 , version 1 (14-01-2023)

Identifiants

Citer

Imed Kacem, Hans Kellerer. Complexity results for common due date scheduling problems with interval data and minmax regret criterion. Discrete Applied Mathematics, 2019, 264, pp.76-89. ⟨10.1016/j.dam.2018.09.026⟩. ⟨hal-03938888⟩
18 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More