최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기Industrial engineering & management systems : an international journal, v.11 no.1, 2012년, pp.103 - 113
Jeong, Yeon-Ho (Department of Logistics Information Technology, Pusan National University) , Kim, Kap-Hwan (Department of Industrial Engineering, Pusan National University) , Woo, Youn-Ju (Department of Industrial Engineering, Pusan National University) , Seo, Bo-Hyeon (Department of Industrial Engineering, Pusan National University)
A yard in a container terminal is a temporary storage space before containers are loaded onto the target vessel or delivered to consignees. For improving the utilization of the space in the yard and the efficiency of loading and discharging operations, it is important that operation plans must be ca...
* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.
Bazzazi, M., Safaei, N., and Javadian, N. (2009), A genetic algorithm to solve the storage space allocation problem in a container terminal, Computers and Industrial Engineering, 56, 44-52.
Bierwirth, C. and Meisel, F. (2009), A fast heuristic for quay crane scheduling with interference constraints, Journal of Scheduling, 12, 345-360.
Daganzo, C. F. (1989), The crane scheduling problem, Transportation Research Part B: Methodological, 23, 159-175.
Jung, D. H., Park, Y. M., Lee, B. K, Kim, K. H., and Ryu, K. R. (2006), A quay crane scheduling method considering interference of yard cranes in container terminals, Advances in Artificial Intelligence, LNAI, 4293, 461-471.
Kim, K. H. and Kim, H. B. (1999), Segregating space allocation models for container inventories in port container terminals, International Journal of Production Economics, 59, 415-423.
Kim, K. H. and Park, K. T. (2003), A note on a dynamic space allocation method for outbound containers, European Journal of Operational Research, 148, 92-101.
Kim, K. H. and Park, Y. M. (2004), A crane scheduling method for port container terminals, European Journal of Operational Research, 156, 752-768.
Kim, K. H., Park, Y. M., and Ryu, K. R. (2000), Deriving decision rules to locate export containers in storage yards, European Journal of Operational Research, 124, 89-101.
Lee, L. H., Chew, E. P., Tan, K. C., and Han, Y. (2006), An optimization model for storage yard management in transshipment hubs, OR Spectrum, 28, 539-561.
Meisel, F. and Wichmann, M. (2010), Container sequencing for quay cranes with internal reshuffles, OR Spectrum, 32, 569-591.
Nishimura, E., Imai, A., Janssens, G. K., and Papadimitriou, S. (2009), Container storage and transshipment marine terminals, Transportation Research, 45E, 771-786.
Peterkofsky, R. I. and Daganzo, C. F. (1990), A branch and bound solution method for the crane scheduling problem, Transportation Research Part B: Methodological, 24, 159-172.
Taleb-Ibrahimi, M., de Castilho, B., and Daganzo, C. F. (1993), Storage space vs handling work in con-tainer terminals, Transportation Research, 27B, 13-32.
Wang, Y. (2008), A Quay Crane Scheduling Method Considering Congestion in the Yard of Container Terminal, Master's thesis, Pusan National University.
Wang, Y. and Kim, K. H. (2011), A quay crane scheduling algorithm considering the workload, Journal of intelligent manufacturing, 22, 459-470.
Won, S. H. (2009), Operational Planning in Container Terminals under Resource Restrictions, Ph. D. thesis, Pusan National University.
Won, S. H. and Kim, K. H. (2009), Integrated framework for various operation plans in container terminals, Polish Maritime Research, 36, 51-61.
Won, S. H. and Kim, K. H. (2009), Yard planning considering the load profile of resources in container terminals, Journal of the Korean Institute of Industrial Engineers, 35, 58-72.
Zhang, C., Liu, J., Wan, Y., Murty, K. G., and Linn, R. J. (2003), Storage space allocation in container terminals, Transportation Research, 37B, 883-903.
Zhang, X. (2011), Space Planning Method Considering Workloads in Container Terminals, Master's thesis, Pusan National University.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
출판사/학술단체 등이 한시적으로 특별한 프로모션 또는 일정기간 경과 후 접근을 허용하여, 출판사/학술단체 등의 사이트에서 이용 가능한 논문
※ AI-Helper는 부적절한 답변을 할 수 있습니다.