ORCID Profile
0000-0003-0492-7797
Current Organisation
International University of Japan
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Publisher: Elsevier BV
Date: 04-2010
Publisher: Springer Science and Business Media LLC
Date: 08-2017
Publisher: Springer Science and Business Media LLC
Date: 30-07-2009
Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
Date: 11-2015
Abstract: Container terminals require robust scheduling algorithms for yard cranes to optimally determine the sequence of storage and retrieval operations in yard blocks for higher container terminal performance. This paper investigates the multiple yard crane scheduling problem within a generic yard block and considers the operational restrictions such as the crane noncrossing constraint and models the crane travel time realistically. Further, the fact that any two adjacent cranes must keep an operational safety distance is also taken into consideration. These physical constraints limit the mobility of yard cranes and greatly render the scheduling difficulty for such pieces of equipment. This paper proposes a clustering-reassigning approach, which fully considers all of the operational constraints in practice. The complexity of the approach is o(n 3 ), where n is the number of container moves to be scheduled, making it suitable for real-time scheduling. Numerical experiments and benchmark with a continuous time-based mixed-integer linear programming model indicate that the clustering-reassigning approach can provide satisfactory near optimal solutions for different sets of test cases in a real-time scheduling context.
Publisher: Elsevier BV
Date: 10-2009
Publisher: Springer International Publishing
Date: 2015
Location: No location found
No related grants have been discovered for Wenkai Li.