Title : ( Transshipment scheduling at a single station with release date and inventory constraints )
Authors: masoumeh ghorbanzadeh , Mohammad Ranjbar , Negin Jamili ,
Full TextAbstract
We study a loading and unloading scheduling problem in a single station transshipment terminal, in which inventory and release date constraints are subjected and the objective is to minimize the makespan. We propose an integer linear programming model; as well as a heuristic algorithm and two exact solution approaches: a dynamic programming algorithm and a brand-and-bound algorithm. Finally, performances of the developed algorithms are compared and analyzed using randomly generated test instances. Regarding the computational results, it is revealed that the simple developed heuristic algorithm is very fast and efficient. Also, the branch-and-bound algorithm outperforms the dynamic programming algorithm.
Keywords
, Transshipment scheduling, branch-and-bound algorithm, dynamic programming
@article{paperid:1075657,
author = {Ghorbanzadeh, Masoumeh and Ranjbar, Mohammad and Jamili, Negin},
title = {Transshipment scheduling at a single station with release date and inventory constraints},
journal = {Journal of Industrial and Production Engineering},
year = {2019},
volume = {36},
number = {5},
month = {July},
issn = {2168-1015},
pages = {301--312},
numpages = {11},
keywords = {Transshipment scheduling; branch-and-bound algorithm; dynamic programming},
}
%0 Journal Article
%T Transshipment scheduling at a single station with release date and inventory constraints
%A Ghorbanzadeh, Masoumeh
%A Ranjbar, Mohammad
%A Jamili, Negin
%J Journal of Industrial and Production Engineering
%@ 2168-1015
%D 2019
