In this paper, quay crane scheduling for multiple vessels with non-crossing constraints(QCSM) is studied, which is an extension of previous studies on quay crane scheduling in thefield of optimizing logistic operations at container terminals. QCSM is formulated as a mixedinteger programming (MIP) problem by considering the ready time for vessels, precedencerelationships between vessels (given by berth allocation problem), and non-crossingconstraints among the quay cranes. Due to the strong ΝΡ -hardness of the proposed problem,meta-heuristics such as simulated annealing (SA) and genetic algorithm (GA) are designed toobtain near-optimal solutions for QCSM. Both small scale and large scale numericalexperiments are conducted to evaluate the performance of the proposed meta-heuristics. Incontrast to traditional quay crane scheduling problem, QCSM can be viewed as an attempt ingetting more competitive scheduling plans to utilize the scarce resource of quay cranes incontainer terminals.
展开▼
