Please use this identifier to cite or link to this item:
|Title:||An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem|
|Keywords:||(S) Scheduling Port container terminal|
Unidirectional quay crane scheduling problem
|Source:||Chen, J.H., Lee, D.-H., Goh, M. (2014-01-01). An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem. European Journal of Operational Research 232 (1) : 198-208. ScholarBank@NUS Repository. https://doi.org/10.1016/j.ejor.2013.06.051|
|Abstract:||The quay crane scheduling problem plays an important role in the paradigm of port container terminal management, due to the fact that it closely relates to vessel berthing time. In this paper, we focus on the study of a special strategy for the cluster-based quay crane scheduling problem that forces quay cranes to move unidirectionally during the scheduling. The scheduling problem arising when this strategy is applied is called the unidirectional quay crane scheduling problem in the literature. Different from other researches attempting to construct more sophisticated searching algorithms, in this paper, we seek for a more compact mathematical formulation of the unidirectional cluster-based quay crane scheduling problem that can be easily solved by a standard optimization solver. To assess the performance of the proposed model, commonly accepted benchmark suites are used and the results indicate that the proposed model outperforms the state-of-the-art algorithms designed for the unidirectional cluster-based quay crane scheduling problem. © 2013 Elsevier B.V. All rights reserved.|
|Source Title:||European Journal of Operational Research|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 13, 2017
WEB OF SCIENCETM
checked on Nov 14, 2017
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.