Optimisation of yard crane scheduling considering velocity coefficient and preventive maintenance
by M.S. Fatemi Ghomi; H. Javanshir; S.S. Ganji; S.M.T. Fatemi Ghomi
International Journal of Shipping and Transport Logistics (IJSTL), Vol. 6, No. 1, 2014

Abstract: This paper develops a mixed integer programming model to formulate the multiple yard cranes scheduling problem (YCSP) in container terminals. The model performs a given set of jobs with different ready times in a yard zone, considering yard cranes interference. Both preventive maintenance and velocity coefficient for yard cranes are considered in this model, which makes it more realistic and applicable. The proposed model aims to minimise the mean completion time of total jobs and minimise the maximum completion time among the yard cranes. Due to NP-hardness of proposed problem, we use particle swarm optimisation (PSO) and simulated annealing (SA) methods to solve the model in order to evaluate accuracy and reliability of results. The numerical performance of each method is examined. It is indicated that the SA algorithm demonstrates a reasonable CPU time and acceptable accuracy of the results. Results show the ability of the model to optimise yard crane scheduling in container terminals considering preventive maintenance and the velocity coefficient of yard cranes.

Online publication date: Sat, 24-May-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Shipping and Transport Logistics (IJSTL):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com