Author:
Ech-Charrat Mounir,El Amrani Mofdi,Ezziyyani Mostafa
Publisher
Springer Nature Switzerland
Reference37 articles.
1. Lim, A.: The berth planning problem. Oper. Res. Lett. 22(2–3), 105–110 (1998). https://doi.org/10.1016/S0167-6377(98)00010-8
2. Pinedo, M.: Scheduling – Theory Algorithms and Systems, 2nd edn. PrenticeHall, Englewood Cliffs, NJ (2002)
3. Hansen, P., Oguz, C.: A note on formulations of static and dynamic berth allocation problems. Les Cahiers du GERAD ISSN 711, 2440 (2003)
4. Imai, A., Sun, X., Nishimura, E., Papadimitriou, S.: Berth allocation in a container port: using a continuous location space approach. Transp. Res. Part B Methodological 39(3), 199–221 (2005). https://doi.org/10.1016/j.trb.2004.04.004
5. Park, Y.-M., Kim, K.H.: A scheduling method for berth and quay cranes. In: Günther, H.-O., Kim, K.H. (eds.) Container Terminals and Automated Transport Systems, pp. 159–181. Springer, Heidelberg (2005). https://doi.org/10.1007/3-540-26686-0_7