Total weighted completion scheduling problem with availability constraints

Cherif Sadfi (1) , Imed Kacem (2) , Wei Liu

1 LOSI - Laboratoire d'Optimisation des Systèmes Industriels
2 LITA - Laboratoire d'Informatique Théorique et Appliquée

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: Optimal scheduling; Single machine scheduling; Dynamic programming; Laboratories; Heuristic algorithms; Availability; Parallel machines; Testing; Processor scheduling; Performance analysis

Domains: Operations Research [cs.RO]

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⟩