رشته مهندسی صنایع – پی اچ دی یار

Solving the single crane scheduling problem at rail transshipment yards

admin — Tue, 18 Sep 2018 08:37:49 +0000

حل مسئله برنامه ریزی تک جرثقیل در جاده های حمل و نقل ریلی

We consider crane scheduling at rail transshipment yards, in which gantry cranes move containers between trains, trucks and a storage area. The single-crane scheduling problem arises at crane transshipment terminals and as a subproblem of the multiple-crane scheduling problem. We consider a makespan objective function, which is equivalent to minimizing the train dwell time in the yard, and introduce time windows for container moves, for example, as a customer service promise. Our proposed decomposition algorithm with integrated dynamic branch-and-cut or dynamic programming solves practically relevant instances within short time limits.

نویسندگان: Xiyu Li, Alena Otto, Erwin Pesch

ژورنال: Discrete Applied Mathematics

سال انتشار: 2018

دانلود مقاله:

https://www.phdyar.ir/wp-content/uploads/2018/09/Solving-the-single-crane-scheduling-problem-at-rail-transshipment-yards.pdf

Parallel tabu search for the cyclic jobshop scheduling problem

admin — Tue, 04 Sep 2018 07:05:35 +0000

برنامه ریزی چرخه موازی با استفاده از الگوریتم تابو سرچ

چکیده:

In this paper, we consider a cyclic jobshop problem, consisting of production of a certain set of elements at fixed intervals. Optimization of the process is reduced to a minimization of a cycle time, i.e. the time, after which the next batch of the same elements may be produced. We introduce a new parallel method for the cost function calculation. The parallelization is not trivial and cannot be done automatically by the existing compilers due to the recurrent character of formulas. Since the problem is strongly NP-hard, a heuristic algorithm was designed to solve it. Computational experiments were done in a multiprocessor environment, namely – in Intel Xeon Phi.

نویسندگان: Wojciech Bożejkoa, Andrzej Gnatowskia, Jarosław Pemperaa, Mieczysław Wodeckib

ژورنال: Computers & Industrial Engineering

سال انتشار: 2017

دانلود مقاله:

https://www.phdyar.ir/wp-content/uploads/2018/09/4.pdf

minimizing total tardiness in a two-machine flowshop scheduling problem with availability constraint on the first machine

admin — Tue, 04 Sep 2018 06:51:45 +0000

به حداقل رساندن خستگی کامل در یک مشکل زمانبندی جریان دو ماشین با محدودیت دسترسی در اولین ماشین

چکیده:

This paper deals with a two-machine flowshop problem in which the machine at the first stage requires preventive maintenance activities that have to be started within a given cumulative working time limit after the previous maintenance. That is, a maintenance activity can be started at any time unless the cumulative working time after the end of the previous maintenance exceeds the given limit. For the problem with the objective of minimizing total tardiness, we develop dominance properties and lower bounds for this scheduling problem as well as a heuristic algorithm, and suggest a branch and bound algorithm in which these properties, lower bounds, and heuristic algorithm are used. Computational experiments are performed to evaluate the algorithm and the results are reported.

نویسندگان: Ju-Yong Leea, Yeong-Dae Kimb

ژورنال: Computers & Industrial Engineering

سال انتشار: 2017

دانلود مقاله:

https://www.phdyar.ir/wp-content/uploads/2018/09/Minimizing_total_tardiness_in_a.pdf