Publisher of Iranian Journals and Conference Proceedings

Please waite ..
Publisher of Iranian Journals and Conference Proceedings
Login |Register |Help |عضویت کتابخانه ها

a heuristic approach to solve hybrid flow shop scheduling Problem with Unrelated Parallel Machines

Year: 1396
COI: JR_IJIEPR-28-1_006
Language: EnglishView: 256
This Paper With 14 Page And PDF Format Ready To Download

Buy and Download

با استفاده از پرداخت اینترنتی بسیار سریع و ساده می توانید اصل این Paper را که دارای 14 صفحه است به صورت فایل PDF در اختیار داشته باشید.
آدرس ایمیل خود را در کادر زیر وارد نمایید:


ebrahim asadi gangraj - Babol Noshirvani University of Technology


In hybrid flow-shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs is processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to tackle the moderate- to large-scale problems. This article presents a new bottleneck-based heuristic to solve the problem. To improve the performance of the heuristic method, a local search approach is embedded in the structure of the heuristic method. To evaluate the performance of the proposed heuristic method, a new lower bound is developed based on Kurz and Askin [1] lower bound. For evaluation purposes, two series of test problems, small- and large-sized problems, are generated under different production scenarios. The empirical results show that the average differences between lower bound and optimal solution as well as lower bound and heuristic method are equal to 2.56% and 5.23%, respectively. For more investigation, the proposed heuristic method is compared with other well-known heuristics in the literature. The results verify the efficiency of the proposed heuristic method in terms of the number of best solutions


Paper COI Code

This Paper COI Code is JR_IJIEPR-28-1_006. Also You can use the following address to link to this article. This link is permanent and is used as an article registration confirmation in the Civilica reference:

How to Cite to This Paper:

If you want to refer to this Paper in your research work, you can simply use the following phrase in the resources section:
asadi gangraj, ebrahim,1396,a heuristic approach to solve hybrid flow shop scheduling Problem with Unrelated Parallel Machines,

Research Info Management

Certificate | Report | من نویسنده این مقاله هستم

اطلاعات استنادی این Paper را به نرم افزارهای مدیریت اطلاعات علمی و استنادی ارسال نمایید و در تحقیقات خود از آن استفاده نمایید.


The specifications of the publisher center of this Paper are as follows:
Type of center: دانشگاه دولتی
Paper count: 6,370
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.

New Papers

New Researchs

Share this page

More information about COI

COI stands for "CIVILICA Object Identifier". COI is the unique code assigned to articles of Iranian conferences and journals when indexing on the CIVILICA citation database.

The COI is the national code of documents indexed in CIVILICA and is a unique and permanent code. it can always be cited and tracked and assumed as registration confirmation ID.