Publisher of Iranian Journals and Conference Proceedings

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

An effective new heuristic algorithm for solving permutation flow shop scheduling problem

فصلنامه معادلات در ترکیبات، دوره: 11، شماره: 1
Year: 1401
COI: JR_COMB-11-1_002
Language: EnglishView: 50
This Paper With 13 Page And PDF Format Ready To Download

Buy and Download

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


Shahriar Farahmand rad - Department of Mathematics, Payame Noor University of ABCD, P.O.Box ۱۹۳۹۵-۳۶۹۷, Tehran, Iran


The deterministic permutation flow shop scheduling problem with makespan criterion is not solvable in polynomial time‎. ‎Therefore‎, ‎researchers have thought about heuristic algorithms‎. ‎There are many heuristic algorithms for solving it that is a very important combinatorial optimization problem‎. ‎In this paper‎, ‎a new algorithm is proposed for solving the mentioned problem‎. ‎The presented algorithm chooses the weighted path that starts from the up-left corner and reaches the down-right in the matrix of jobs processing times and calculates the biggest sum of the times in the footprints of this path‎. ‎The row with the biggest sum permutes among all the rows of the matrix for locating the minimum of makespan‎. ‎This method was run on Taillard’s standard benchmark and the solutions were compared with the optimum or the best ones as well as ۱۴ famous heuristics‎. ‎The validity and effectiveness of the algorithm are shown with tables and statistical evaluation‎.


Paper COI Code

This Paper COI Code is JR_COMB-11-1_002. 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:
Farahmand rad, Shahriar,1401,An effective new heuristic algorithm for solving permutation flow shop scheduling problem,

Research Info Management

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

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


The specifications of the publisher center of this Paper are as follows:
Type of center: پیام نور
Paper count: 61,431
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.

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.