Abstract

This paper presents scheduling models for dispatching vehicles to accomplish a sequence of container jobs at the container terminal, in which the starting times as well as the order of vehicles for carrying out these jobs need to be determined. To deal with this scheduling problem, three mixed 0-1 integer programming models, Model 1, Model 2 and Model 3 are provided. We present interesting techniques to reformulate the two mixed integer programming models, Model 1 and Model 2, as pure 0-1 integer programming problems with simple constraint sets and present a lower bound for the optimal value of Model 1. Model 3 is a complicated mixed integer programming model because it involves a set of non-smooth constraints, but it can be proved that its solutions may be obtained by the so-called greedy algorithm. We present numerical results showing that Model 3 is the best among these three models and the greedy algorithm is capable of solving large scale problems.

주제어

#Scheduling   #mixed integer programming   #dynamic programming method   #greedy algorithm  

참고문헌 (0)

1. 이 논문의 참고문헌 없음

이 논문을 인용한 문헌 (0)

1. 이 논문을 인용한 문헌 없음