Using short-term memory to minimize the weighted number of late jobs on a single machine

TitreUsing short-term memory to minimize the weighted number of late jobs on a single machine
Type de publicationArticle
Année de publication2003
Langueeng
Titre de la revueEuropean Journal of Operational Research
Volume148
Pagination591 - 603
Auteur(s)Péridy, L., Pinson E. et Rivreau D.
ISSN0377-2217
Mots-clésTime-indexed formulation
Résumé

In this paper, we investigate the problem of minimizing the weighted number of late jobs on a single-machine with release dates. We show that a short-term scheduling memory approach can be used to strengthen a time-indexed Lagrangean relaxation of the problem. A branch-and-bound algorithm using this lower bound is presented and computational experiments on problems with up to 100 jobs are reported.

URLhttp://www.sciencedirect.com/science/article/pii/S0377221702004381
DOI10.1016/S0377-2217(02)00438-1