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

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

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

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

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

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

Behzad Ezzati

Nour Branch , Islamic Azad University,

Mostafa Maleki

Department of Industrial Engineering, of Kurdistan, Pasdaran Boulevard, Sanandaj

Bahram Ghorbani

Department of Mechanical Engineering, Nour Branch , Islamic Azad University

Mahmoud Shahrokhi

Certificate
I'm the author of the paper

این Paper در بخشهای موضوعی زیر دسته بندی شده است:

هوش مصنوعی > الگوریتم ژنتیک

Export:

Link to this Paper:

https://civilica.com/doc/187655

Document National Code:

ICNMO01_061

Index date: 9 March 2013

How to cite:

If you want to refer to this Paper in your research work, you can simply use the following phrase in the references section:

Ezzati, Behzad and Maleki, Mostafa and Ghorbani, Bahram and Shahrokhi, Mahmoud,1391,Pareto Optimal - Front Method to Bi-Objective Local Search Genetic Algorithm for Uniform Parallel Machines Scheduling with Sequence -Dependent Setup Time,International Conference on Nonlinear Modeling and Optimization,Amol,https://civilica.com/doc/187655

در داخل متن نیز هر جا که به عبارت و یا دستاوردی از این Paper اشاره شود پس از ذکر مطلب، در داخل پارانتز، مشخصات زیر نوشته می شود.
برای بار اول: (1391, Ezzati, Behzad؛ Mostafa Maleki and Bahram Ghorbani and Mahmoud Shahrokhi)
برای بار دوم به بعد: (1391, Ezzati؛ Maleki and Ghorbani and Shahrokhi)
برای آشنایی کامل با نحوه مرجع نویسی لطفا بخش راهنمای سیویلیکا (مرجع دهی) را ملاحظه نمایید.

Scientometrics

The specifications of the publisher center of this Paper are as follows:

Ranking of Islamic Azad University of Nour

Type of center: دانشگاه آزاد

Paper count: 2,982

In the scientometrics section of CIVILICA, you can see the scientific ranking of the Iranian academic and research centers based on the statistics of indexed articles.