Publisher of Iranian Journals and Conference Proceedings

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

Train Scheduling Problem with Consideration of Praying Constraint as anApplication of Job Shop Scheduling Problem

Year: 1393
COI: JR_IJE-27-7_010
Language: EnglishView: 482
This Paper With 8 Page And PDF Format Ready To Download

Buy and Download

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


a Jamili - Department of Industrial Engineering, Tehran University, Tehran-Iran
s.f GhannadPour - Department of Railway Engineering, Mapna Co., Tehran-Iran
m.r GhoreshiNejad - Department of Railway Engineering, Mapna Co., Tehran-Iran


The present paper extends the idea of job shop scheduling problem with resting constraints to the trainscheduling problem with the Muslim praying considerations. For this purpose, after proposing the newmathematical model, a heuristic algorithm based on the Electromagnetism-Like algorithm (EM) whichis well adjusted to scheduling problems is employed to solve the large-size practical cases. Theeffectiveness of the proposed algorithm is then validated by comparing with optimum solution usingsmall-size instances and simulated annealing algorithm, and Particle swarm Optimization (PSO) usingmedium and large-size instances. At the end, a practical case from Iranian railway network is studiedand the results are reported. The results indicate that in the case of considering the Muslim prayingconstraint, the ratios of total tardiness of trains, and the total praying times are 14.5%, and 3.5%,respectively, while in the case of relaxing this constraint; the first ratio reduces to 12.3%. This resultdemonstrates that the proposed algorithm is able to schedule the praying times so that in many casesthe trains with different directions meet each other during the praying time


Keywords:Job Shop SchedulingTrain SchedulingMuslim Praying ConstraintElectromagnetism-Like algorithm

Paper COI Code

This Paper COI Code is JR_IJE-27-7_010. 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:
Jamili, a and GhannadPour, s.f and GhoreshiNejad, m.r,1393,Train Scheduling Problem with Consideration of Praying Constraint as anApplication of Job 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: 79,534
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

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.