Title :
Lower bounds for 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 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.
Keywords :
maintenance engineering; scheduling; availability constraints; lower bounds; maintenances; single machine; total weighted completion scheduling problem; Availability; Dynamic programming; Heuristic algorithms; Integer linear programming; Laboratories; Optimal scheduling; Parallel machines; Processor scheduling; Single machine scheduling; Testing; availability constraints; lower bound; 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.5223882
