Lower bounds for total weighted completion scheduling problem with availability constraints - Université de technologie de Troyes Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Lower bounds for total weighted completion scheduling problem with availability constraints

Résumé

In this paper we consider the single machine total weighted completion scheduling problem with availability constraints. The machine is subject to many periods of maintenances. To solve this problem, we propose some lower bounds. A computational experiments and analysis are given afterwards to test the efficiency of the proposed lower bounds.
Fichier non déposé

Dates et versions

hal-02496074 , version 1 (02-03-2020)

Identifiants

Citer

Cherif Sadfi, Imed Kacem, Wei Liu. Lower bounds for total weighted completion scheduling problem with availability constraints. Industrial Engineering (CIE39), Jul 2009, Troyes, France. pp.159-163, ⟨10.1109/ICCIE.2009.5223882⟩. ⟨hal-02496074⟩
20 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More