by Hasani, K.; Kravchenko, S.; Werner, F..
Series: 2013-12, Preprints
In this paper, we consider the problem of scheduling a set of jobs on two parallel machines to minimize the sum of completion times. Each job requires a setup which must be done by a single server. It is known that this problem is strongly NP-hard. We proposed two mixed integer linear programming models and a simulated annealing algorithm. The performance of these algorithms is evaluated for instances with up to 250 jobs.
Scheduling, Parallel machines, Single Server, Mixed integer linear programming