Skip to Main content Skip to Navigation
Conference papers

Lower bounds for total weighted completion scheduling problem with availability constraints

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

https://hal-utt.archives-ouvertes.fr/hal-02496074
Contributor : Daniel Gavrysiak Connect in order to contact the contributor
Submitted on : Monday, March 2, 2020 - 4:58:28 PM
Last modification on : Friday, August 27, 2021 - 3:14:07 PM

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

53