Total Weighted Completion Scheduling Problem With Availability Constraints

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.