Skip to Main content Skip to Navigation
Conference papers

Total weighted completion scheduling problem with availability constraints

Abstract : In this paper we consider the single machine scheduling problem with availability constraints in order to minimize the total weighted completion times of jobs. To solve this problem, we propose three heuristics. A computational experiments and analysis are given afterwards to test the efficiency of the proposed heuristics.
Document type :
Conference papers
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02521911
Contributor : Daniel Gavrysiak <>
Submitted on : Friday, March 27, 2020 - 4:45:47 PM
Last modification on : Saturday, March 28, 2020 - 1:57:41 AM

Identifiers

Collections

Citation

Cherif Sadfi, Imed Kacem, Wei Liu. Total weighted completion scheduling problem with availability constraints. Industrial Engineering (CIE39), Jul 2009, Troyes, France. pp.134-137, ⟨10.1109/ICCIE.2009.5223971⟩. ⟨hal-02521911⟩

Share

Metrics

Record views

228