Pareto Optimal - Front Method to Bi-Objective Local Search Genetic Algorithm for Uniform Parallel Machines Scheduling with Sequence -Dependent Setup Time

In this paper, the uniform parallel machine scheduling problem with sequence dependent setup time is considered. We assume that there are a set of n unrelated jobs should be assigned to m parallel machines with different speed and processing sequence must be determined for the jobsassigned to each machines. The objective is to minimizing the maximum completion time or makespan and maximum lateness ( ) simultaneously. A new mixed integer linerprogramming (MILP) model is presented for problem. A bi-objective genetic algorithm is also proposed to obtain schedule with high quality for large sized problem. A comprehensive computational and statically result is provided to evaluate the performance of proposed methods

کلیدواژه ها:

Scheduling ، Parallel machines ، Genetic algorithm ، makespan ، maximumlateness ، Pareto set