A decomposition-heuristic-rule-enabled decision-making system for dynamic quay crane allocation and scheduling
by Yanwei Zhang, Ning Zhao, Laide Shi
International Journal of Computer Applications in Technology (IJCAT), Vol. 32, No. 4, 2008

Abstract: The Quay Crane Scheduling Problem (QCSP) plays an important role in the container terminal operation. In order to develop an effective QCSP model, in this study, the QCSP is decomposed into two sub-problems, i.e., the QC-allocation and QC-scheduling levels. By defining precedence constraints and heuristic rules, dynamic decisions were then made between ships and within a ship. An example of a specific container terminal was applied to validate the dynamic QC allocation and scheduling strategy. It was also revealed from the experimental results that the strategy possessed such properties as automated scheming, low memory occupation and user-friendly interfacing, viz., the operation efficiency, stability and practicality outperformed the existing mode. Therefore, this approach has been proven effective and pragmatic in automated operation and decision-making.

Online publication date: Fri, 21-Nov-2008

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 Computer Applications in Technology (IJCAT):
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