Pareto Optimal - Front Method to Bi-Objective Local Search Genetic Algorithm for Uniform Parallel Machines Scheduling with Sequence -Dependent Setup Time
Publish Year: 1391
نوع سند: مقاله کنفرانسی
زبان: English
View: 1,147
This Paper With 9 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
این Paper در بخشهای موضوعی زیر دسته بندی شده است:
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ICNMO01_061
تاریخ نمایه سازی: 19 اسفند 1391
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
Keywords:
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