Solving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs

Journal of Modern Processes in Manufacturing and Production

مقاله 1، دوره 3، شماره 2، مرداد 2014، صفحه 5-16   

نویسندگان

Mohammadreza Naghibi¹؛ Abolfazl Adressi^{* 2}

¹Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran

²Department of Industrial Engineering, K.N.Toosi University of Technology, Iran

چکیده

Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel machines scheduling, when machines have different technological levels and are not necessarily able to process each one of the existing jobs in the group of jobs and in many of the industrial environments, a sequence dependent setup time takes place during exchanging jobs on the machines. In this research, the unrelated parallel machines scheduling problem has been studied considering the limitations of sequence dependent setup time of processing of jobs and limited accessibility to machines and jobs with the purpose of minimizing the total weighting lateness and earliness times. An integer scheduling model is proposed for this problem. Also, a meta-heuristically combined method consisting of Genetic algorithm and Particle swarm optimization (PSO) algorithm for its solutions is proposed. The obtained results of the proposed algorithm show that the proposed algorithm is very efficient especially in problems with large dimensions.

کلیدواژه‌ها

Unrelated parallel machines scheduling؛ Sequence dependent setup time؛ Genetic algorithm؛ Particle Swarm Optimization Algorithm