Total weighted completion scheduling problem with availability constraints - Archive ouverte HAL Access content directly
Conference Papers Year :

Total weighted completion scheduling problem with availability constraints

(1) , (2) ,
1
2
Wei Liu

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.
Not file

Dates and versions

hal-02521911 , version 1 (27-03-2020)

Identifiers

Cite

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⟩
7 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More