Title :
Total weighted completion scheduling problem with availability constraints
Author :
Sadfi, Cherif ; Kacem, Imed ; Wei Liu
Author_Institution :
LOSI Lab., Univ. of Technol. of Troyes, Troyes, France
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.
Keywords :
single machine scheduling; availability constraints; computational analysis; computational experiments; single machine scheduling problem; total weighted completion scheduling problem; Availability; Dynamic programming; Heuristic algorithms; Laboratories; Optimal scheduling; Parallel machines; Performance analysis; Processor scheduling; Single machine scheduling; Testing; availability constraints; heuristics; single machine; total weighted completion time;
Conference_Titel :
Computers & Industrial Engineering, 2009. CIE 2009. International Conference on
Conference_Location :
Troyes
Print_ISBN :
978-1-4244-4135-8
Electronic_ISBN :
978-1-4244-4136-5
DOI :
10.1109/ICCIE.2009.5223971
