Table of Contents Author Guidelines Submit a Manuscript
Discrete Dynamics in Nature and Society
Volume 2017, Article ID 4730253, 13 pages
https://doi.org/10.1155/2017/4730253
Research Article

Mathematical Model and Algorithm for the Reefer Mechanic Scheduling Problem at Seaports

School of Economics & Management, Tongji University, Shanghai 200092, China

Correspondence should be addressed to Yujian Song; moc.361@tcivnoos

Received 11 October 2016; Accepted 14 February 2017; Published 6 March 2017

Academic Editor: J. R. Torregrosa

Copyright © 2017 Jiantong Zhang and Yujian Song. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D.-H. Lee, H. Q. Wang, and L. Miao, “Quay crane scheduling with non-interference constraints in port container terminals,” Transportation Research Part E: Logistics and Transportation Review, vol. 44, no. 1, pp. 124–135, 2008. View at Publisher · View at Google Scholar · View at Scopus
  2. M. Liu, F. Chu, Z. Zhang, and C. B. Chu, “A polynomial-time heuristic for the quay crane double-cycling problem with internal-reshuffling operations,” Transportation Research Part E: Logistics and Transportation Review, vol. 81, pp. 52–74, 2015. View at Publisher · View at Google Scholar · View at Scopus
  3. C.-Y. Lee, M. Liu, and C. Chu, “Optimal algorithm for the general Quay crane double-cycling problem,” Transportation Science, vol. 49, no. 4, pp. 957–967, 2015. View at Publisher · View at Google Scholar · View at Scopus
  4. K. H. Kim, “An optimal routing algorithm for a transfer crane in port container terminals,” Transportation Science, vol. 33, no. 1, pp. 17–33, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  5. I. Vacca, M. Salani, and M. Bierlaire, “An exact algorithm for the integrated planning of berth allocation and quay crane assignment,” Transportation Science, vol. 47, no. 2, pp. 148–161, 2013. View at Publisher · View at Google Scholar · View at Scopus
  6. A. Imai, K. Sasaki, E. Nishimura, and S. Papadimitriou, “Multi-objective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks,” European Journal of Operational Research, vol. 171, no. 2, pp. 373–389, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  7. I. F. A. Vis and H. J. Carlo, “Sequencing two cooperating automated stacking cranes in a container terminal,” Transportation Science, vol. 44, no. 2, pp. 169–182, 2010. View at Publisher · View at Google Scholar · View at Scopus
  8. A. Lim and Z. Xu, “A critical-shaking neighborhood search for the yard allocation problem,” European Journal of Operational Research, vol. 174, no. 2, pp. 1247–1259, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  9. R. Stahlbock and S. Voß, “Operations research at container terminals: a literature update,” OR Spectrum, vol. 30, no. 1, pp. 1–52, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. C. Bierwirth and F. Meisel, “A survey of berth allocation and quay crane scheduling problems in container terminals,” European Journal of Operational Research, vol. 202, no. 3, pp. 615–627, 2010. View at Google Scholar
  11. H. J. Carlo, I. F. A. Vis, and K. J. Roodbergen, “Seaside operations in container terminals: literature overview, trends, and research directions,” Flexible Services and Manufacturing Journal, vol. 27, no. 2-3, pp. 224–262, 2015. View at Publisher · View at Google Scholar · View at Scopus
  12. M. Liu, Y. Xu, C. Chu, and F. Zheng, “Online scheduling to minimize modified total tardiness with an availability constraint,” Theoretical Computer Science, vol. 410, no. 47-49, pp. 5039–5046, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  13. C. Chu, “A branch-and-bound algorithm to minimize total tardiness with different release dates,” Naval Research Logistics (NRL), vol. 39, no. 2, pp. 265–283, 1992. View at Publisher · View at Google Scholar · View at Scopus
  14. F. Yalaoui and C. Chu, “Parallel machine scheduling to minimize total tardiness,” International Journal of Production Economics, vol. 76, no. 3, pp. 265–279, 2002. View at Publisher · View at Google Scholar · View at Scopus
  15. I. Kacem, N. Souayah, and M. Haouari, “Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions,” RAIRO Operations Research, vol. 46, no. 2, pp. 125–147, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. J. M. J. Schutten and R. A. M. Leussink, “Parallel machine scheduling with release dates, due dates and family setup times,” International Journal of Production Economics, vol. 46-47, pp. 119–125, 1996. View at Publisher · View at Google Scholar · View at Scopus
  17. Z.-L. Chen and C.-Y. Lee, “Parallel machine scheduling with a common due window,” European Journal of Operational Research, vol. 136, no. 3, pp. 512–527, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  18. T.-C. Chiang, H.-C. Cheng, and L.-C. Fu, “A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival,” Computers and Operations Research, vol. 37, no. 12, pp. 2257–2269, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  19. S. A. Torabi, N. Sahebjamnia, S. A. Mansouri, and M. A. Bajestani, “A particle swarm optimization for a fuzzy multi-objective unrelated parallel machines scheduling problem,” Applied Soft Computing Journal, vol. 13, no. 12, pp. 4750–4762, 2013. View at Publisher · View at Google Scholar · View at Scopus
  20. J. Lamothe, F. Marmier, M. Dupuy, P. Gaborit, and L. Dupont, “Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints,” Computers & Operations Research, vol. 39, no. 6, pp. 1236–1244, 2012. View at Publisher · View at Google Scholar · View at Scopus
  21. S. Hartmann, “A general framework for scheduling equipment and manpower at container terminals,” in Container Terminals and Automated Transport Systems, pp. 207–230, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar
  22. S. Hartmann, “Scheduling reefer mechanics at container terminals,” Transportation Research Part E: Logistics and Transportation Review, vol. 51, no. 1, pp. 17–27, 2013. View at Publisher · View at Google Scholar · View at Scopus
  23. R. Storn and K. Price, “Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces,” Journal of Global Optimization, vol. 11, no. 4, pp. 341–359, 1997. View at Publisher · View at Google Scholar · View at Scopus
  24. A. Ponsich and C. A. C. Coello, “A hybrid differential evolution—Tabu Search algorithm for the solution of job-shop scheduling problems,” Applied Soft Computing Journal, vol. 13, no. 1, pp. 462–474, 2013. View at Publisher · View at Google Scholar · View at Scopus
  25. D. Chen, E. Cao, and W. Lai, “A differential evolution algorithm for pickups and deliveries problem with fuzzy time windows,” Journal of Intelligent & Fuzzy Systems, vol. 30, no. 1, pp. 267–277, 2016. View at Publisher · View at Google Scholar · View at Scopus
  26. L. Wang, Y. Zeng, and T. Chen, “Back propagation neural network with adaptive differential evolution algorithm for time series forecasting,” Expert Systems with Applications, vol. 42, no. 2, pp. 855–863, 2015. View at Publisher · View at Google Scholar · View at Scopus
  27. P. Yan, G. Wang, A. Che, and Y. Li, “Hybrid discrete differential evolution algorithm for biobjective cyclic hoist scheduling with reentrance,” Computers and Operations Research, vol. 76, pp. 155–166, 2016. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  28. W. S. Sakr, R. A. EL-Sehiemy, and A. M. Azmy, “Adaptive differential evolution algorithm for efficient reactive power management,” Applied Soft Computing, vol. 53, pp. 336–351, 2017. View at Publisher · View at Google Scholar
  29. S. Zhou, M. Liu, H. Chen, and X. Li, “An effective discrete differential evolution algorithm for scheduling uniform parallel batch processing machines with non-identical capacities and arbitrary job sizes,” International Journal of Production Economics, vol. 179, pp. 1–11, 2016. View at Publisher · View at Google Scholar · View at Scopus
  30. E. Koyuncu and R. Erol, “PSO based approach for scheduling NPD projects including overlapping process,” Computers and Industrial Engineering, vol. 85, pp. 316–327, 2015. View at Publisher · View at Google Scholar · View at Scopus
  31. J. Adams, E. Balas, and D. Zawack, “The shifting bottleneck procedure for job shop scheduling,” Management Science, vol. 34, no. 3, pp. 391–401, 1988. View at Publisher · View at Google Scholar · View at MathSciNet
  32. L. J. Wilkerson and J. D. Irwin, “An improved method for scheduling independent tasks,” A I I E Transactions, vol. 3, no. 3, pp. 239–245, 1971. View at Publisher · View at Google Scholar · View at Scopus
  33. C. Koulamas, “Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem,” Naval Research Logistics, vol. 44, no. 1, pp. 109–125, 1997. View at Publisher · View at Google Scholar · View at Scopus
  34. B. Liu, L. Wang, and Y.-H. Jin, “An effective PSO-based memetic algorithm for flow shop scheduling,” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 37, no. 1, pp. 18–27, 2007. View at Publisher · View at Google Scholar · View at Scopus
  35. M. Nawaz, E. E. Enscore Jr., and I. Ham, “A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem,” Omega, vol. 11, no. 1, pp. 91–95, 1983. View at Publisher · View at Google Scholar · View at Scopus