AN EFFECTIVE GENETIC ALGORITHM FOR FLOW SHOP SCHEDULING PROBLEMS TO MINIMIZE MAKESPAN
نویسندگان
چکیده
منابع مشابه
A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem
This paper deals with the permutation flow shop scheduling problem. The objective is to minimize the maximum completion time, or makespan. To solve this problem which has been proved to be strongly NP-hard, a combination between an ant colony algorithm, a heuristic algorithm and a local search procedure is proposed and presented. The hybrid approach is to use artificial ants to construct soluti...
متن کاملA Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time
Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...
متن کاملA Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time
Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...
متن کاملA genetic algorithm for flow shop scheduling problems
We propose a Genetic Algorithm for scheduling multiprocessor tasks in multi-stage flow-shop environments. We present two special crossover operators that we developed for this particular problem, together with the implementation of mutation operators as well as a partial reshuffling procedure. We conclude with the results of our computational experiments. 1. Problem Definition We consider multi...
متن کاملScheduling of a hub reentrant job shop to minimize makespan
This paper focuses on a hub reentrant shop scheduling problem which is motivated by actual packing production line in the iron and steel industry. There are five operations for processing a job where three operations must be processed on a hub machine, and between any two consecutive operations on the hub machine, two operations must be processed on other two secondary machines, respectively. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mechanics
سال: 2017
ISSN: 2029-6983,1392-1207
DOI: 10.5755/j01.mech.23.4.15053