참고문헌
- I. Adler, A. J., Hoffman, R. Shamir, "Monge and feasibility sequences in general flow problems," Discrete Applied Mathematics, Vol.44(1993), pp.21-38 https://doi.org/10.1016/0166-218X(93)90220-I
- M., Bazaraa and J. Jarvis, Linear Programming and Network, John Wiley and Sons, (1992), pp.574-585
- T., Cezik and O. Gunluk, "Reformulating linear programs with transportation constraints- With applications to workforce scheduling," Naval Research Logistics, Vol.51, No.2 (2003), pp.275-296 https://doi.org/10.1002/nav.10115
- C.F., Daganzo, "The crane scheduling problem," Transportation Research B, Vol.23 (1989), pp.159-175 https://doi.org/10.1016/0191-2615(89)90001-5
- K.H. Kim, J.S., Kang, and K.R. Ryu, "A beam search algorithm for the load sequencing of outbound containers in port container terminals," OR spectrum:Quantitative Approaches in Management, Vol.26, No.1(2004), pp.93-116 https://doi.org/10.1007/s00291-003-0148-0
- K.H., Kim and K.Y. Kim, "An optimal routing algorithm for a transfer crane in port container terminals," Transportation Science, Vol.33, No.1(1999), pp.17-33 https://doi.org/10.1287/trsc.33.1.17
- K.Y., Kim and K.H. Kim, "Heuristic algorithms for routing yard-side equipment for minimizing loading times in container terminals," Naval research logistics, Vol.50 No.5(2003), pp.498-514 https://doi.org/10.1002/nav.10076
- W.C., Ng and K.L. Mak, "Yard crane scheduling in port container terminals," Applied Mathematical Modelling, Vol.29 (2005), pp.263-276 https://doi.org/10.1016/j.apm.2004.09.009
- R.I., Peterkofsky and C.F. Daganzo, "A branch and bound solution method for the crane scheduling problem," Transportation Research B, Vol.24(1990), pp.159-172 https://doi.org/10.1016/0191-2615(90)90014-P
- http://groups.yahoo.com/group/lp_solve/