Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect

In this study, single machine scheduling problem with unequal release dates and a learning effect is considered. The objective function of the problem is minimization of the total weighted completion time. A non-linear mathematical programming model is developed for the problem which belongs to NP-hard class. Also the model is tested on an example. Results of computational tests show that the proposed model is effective in solving problems with up to 30 jobs.