Table of Contents Author Guidelines Submit a Manuscript
Scientific Programming
Volume 2017, Article ID 7219656, 19 pages
https://doi.org/10.1155/2017/7219656
Review Article

A Survey of Recent Research on Optimization Models and Algorithms for Operations Management from the Process View

School of Management, Shanghai University, Shanghai, China

Correspondence should be addressed to Hongying Fei; nc.ude.uhs@yhief

Received 4 January 2017; Revised 27 February 2017; Accepted 20 April 2017; Published 11 July 2017

Academic Editor: Xinchang Wang

Copyright © 2017 Hongying Fei et al. 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. E. Gralla, J. Goentzel, and C. Fine, “Assessing trade-offs among multiple objectives for humanitarian aid delivery using expert preferences,” Production and Operations Management, vol. 23, no. 6, pp. 978–989, 2014. View at Publisher · View at Google Scholar · View at Scopus
  2. W. J. Gutjahr and P. C. Nolz, “Multicriteria optimization in humanitarian aid,” European Journal of Operational Research, vol. 252, no. 2, pp. 351–366, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. F. Jaehn, “Sustainable operations,” European Journal of Operational Research, vol. 253, no. 2, pp. 243–264, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. M. Boix, L. Montastruc, C. Azzaro-Pantel, and S. Domenech, “Optimization methods applied to the design of eco-industrial parks: A literature review,” Journal of Cleaner Production, vol. 87, no. 1, pp. 303–317, 2015. View at Publisher · View at Google Scholar · View at Scopus
  5. D. Davendra, I. Zelinka, M. Bialic-Davendra, R. Senkerik, and R. Jasek, “Discrete self-organising migrating algorithm for flow-shop scheduling with no-wait makespan,” Mathematical and Computer Modelling, vol. 57, no. 1-2, pp. 100–110, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. O. Engin and C. Günaydin, “An adaptive learning approach for no-wait flowshop scheduling problems to minimize makespan,” International Journal of Computational Intelligence Systems, vol. 4, no. 4, pp. 521–529, 2011. View at Publisher · View at Google Scholar · View at Scopus
  7. Q.-L. Zhang and Y.-S. Chen, “Hybrid PSO-NEH algorithm for solving no-wait flexible flow shop scheduling problem,” System Engineering Theory and Practice, vol. 34, no. 3, pp. 802–809, 2014. View at Google Scholar · View at Scopus
  8. J. M. Framinan, M. S. Nagano, and J. V. Moccellin, “An efficient heuristic for total flowtime minimisation in no-wait flowshops,” International Journal of Advanced Manufacturing Technology, vol. 46, no. 9–12, pp. 1049–1057, 2010. View at Publisher · View at Google Scholar · View at Scopus
  9. Y. Li, X. Li, and J. Gupta, “Solving the multi-objective flowline manufacturing cell scheduling problem by hybrid harmony search,” Expert Systems with Applications, vol. 42, no. 3, pp. 1409–1417, 2015. View at Publisher · View at Google Scholar · View at Scopus
  10. B. Nikjo and J. Rezaeian, “Meta heuristic for minimizing makespan in a flow-line manufacturing cell with sequence dependent family setup times,” Journal of Optimization in Industrial Engineering, vol. 7, no. 16, pp. 21–29, 2014. View at Google Scholar
  11. O. Shahvari, N. Salmasi, R. Logendran, and B. Abbasi, “An efficient tabu search algorithm for flexible flow shop sequence-dependent group scheduling problems,” International Journal of Production Research, vol. 50, no. 15, pp. 4237–4254, 2012. View at Publisher · View at Google Scholar · View at Scopus
  12. M. Sabouni and R. Logendran, “Carryover sequence-dependent group scheduling with the integration of internal and external setup times,” European Journal of Operational Research, vol. 224, no. 1, pp. 8–22, 2013. View at Publisher · View at Google Scholar · View at Scopus
  13. M. A. Bozorgirad and R. Logendran, “Bi-criteria group scheduling in hybrid flowshops,” International Journal of Production Economics, vol. 145, no. 2, pp. 599–612, 2013. View at Publisher · View at Google Scholar · View at Scopus
  14. J. Correa, V. Verdugo, and J. Verschae, “Splitting versus setup trade-offs for scheduling to minimize weighted completion time,” Operations Research Letters, vol. 44, no. 4, pp. 469–473, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. K.-C. Ying, J. N. D. Gupta, S.-W. Lin, and Z.-J. Lee, “Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups,” International Journal of Production Research, vol. 48, no. 8, pp. 2169–2184, 2010. View at Publisher · View at Google Scholar · View at Scopus
  16. D. Lu and R. Logendran, “Bi-criteria group scheduling with sequence-dependent setup time in a flow shop,” Journal of the Operational Research Society, vol. 64, no. 4, pp. 530–546, 2013. View at Publisher · View at Google Scholar · View at Scopus
  17. R. Tavakkoli-Moghaddam, N. Javadian, A. Khorrami, and Y. Gholipour-Kanani, “Design of a scatter search method for a novel multi-criteria group scheduling problem in a cellular manufacturing system,” Expert Systems with Applications, vol. 37, no. 3, pp. 2661–2669, 2010. View at Publisher · View at Google Scholar · View at Scopus
  18. C. V. Le and C. K. Pang, “Fast reactive scheduling to minimize tardiness penalty and energy cost under power consumption uncertainties,” Computers and Industrial Engineering, vol. 66, no. 2, pp. 406–417, 2013. View at Publisher · View at Google Scholar · View at Scopus
  19. S. Wang, M. Liu, F. Chu, and C. Chu, “Bi-objective optimization of a single machine batch scheduling problem with energy cost consideration,” Journal of Cleaner Production, vol. 137, pp. 1205–1215, 2016. View at Publisher · View at Google Scholar
  20. S. Arabameri and N. Salmasi, “Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem,” Computers and Industrial Engineering, vol. 64, no. 4, pp. 902–916, 2013. View at Publisher · View at Google Scholar · View at Scopus
  21. M. Jenabi, B. Naderi, and S. M. T. F. Ghomi, “A bi-objective case of no-wait flowshops,” in Proceedings of the IEEE 5th International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA '10), pp. 1048–1056, September 2010. View at Publisher · View at Google Scholar · View at Scopus
  22. T. Aldowaisan and A. Allahverdi, “Minimizing total tardiness in no-wait flow-shops,” Foundations of Computing and Decision Sciences, vol. 37, no. 3, pp. 149–162, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  23. T. A. Aldowaisan and A. Allahverdi, “No-wait flowshop scheduling problem to minimize the number of tardy jobs,” International Journal of Advanced Manufacturing Technology, vol. 61, no. 1–4, pp. 311–323, 2012. View at Publisher · View at Google Scholar · View at Scopus
  24. M. Liu, S. Wang, C. Chu, and F. Chu, “An improved exact algorithm for single-machine scheduling to minimise the number of tardy jobs with periodic maintenance,” International Journal of Production Research, vol. 54, no. 12, pp. 3591–3602, 2016. View at Publisher · View at Google Scholar · View at Scopus
  25. G. Sölveling, S. Solak, J.-P. B. Clarke, and E. L. Johnson, “Scheduling of runway operations for reduced environmental impact,” Transportation Research Part D: Transport and Environment, vol. 16, no. 2, pp. 110–120, 2011. View at Publisher · View at Google Scholar · View at Scopus
  26. J. Xiong, L.-N. Xing, and Y.-W. Chen, “Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns,” International Journal of Production Economics, vol. 141, no. 1, pp. 112–126, 2013. View at Publisher · View at Google Scholar · View at Scopus
  27. C. Wang, X. Li, and Q. Wang, “Tabu search for no-wait flowshop scheduling problem to minimize maximum lateness,” Journal of Southeast University, vol. 26, no. 1, pp. 26–30, 2010. View at Google Scholar · View at MathSciNet
  28. C. Wang, X. Li, and Q. Wang, “Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion,” European Journal of Operational Research, vol. 206, no. 1, pp. 64–72, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  29. Y.-X. Pan, Q.-K. Pan, and J.-Q. Li, “Shuffled frog-leaping algorithm for multi-objective no-wait flowshop scheduling,” Control Theory and Applications, vol. 28, no. 10, pp. 1363–1370, 2011. View at Google Scholar · View at Scopus
  30. G. Xie and J. Li, “Evolved discrete harmony search algorithm for multi-objective no-wait flow shop scheduling problem,” in Proceedings of the 2nd International Conference on Computer Application and System Modeling (ICCASM '12), pp. 0791–0794, July 2012.
  31. T. C. Kuo, “Waste electronics and electrical equipment disassembly and recycling using Petri net analysis: considering the economic value and environmental impacts,” Computers and Industrial Engineering, vol. 65, no. 1, pp. 54–64, 2013. View at Publisher · View at Google Scholar · View at Scopus
  32. N. G. Vaklieva-Bancheva and E. G. Kirilova, “Cleaner manufacture of multipurpose batch chemical and biochemical plants. scheduling and optimal choice of production recipes,” Journal of Cleaner Production, vol. 18, no. 13, pp. 1300–1310, 2010. View at Publisher · View at Google Scholar · View at Scopus
  33. C.-H. Liu, “Approximate trade-off between minimisation of total weighted tardiness and minimisation of carbon dioxide (CO2) emissions in bi-criteria batch scheduling problem,” International Journal of Computer Integrated Manufacturing, vol. 27, no. 8, pp. 759–771, 2014. View at Publisher · View at Google Scholar · View at Scopus
  34. C. Liu, J. Yang, J. Lian, W. Li, S. Evans, and Y. Yin, “Sustainable performance oriented operational decision-making of single machine systems with deterministic product arrival time,” Journal of Cleaner Production, vol. 85, pp. 318–330, 2014. View at Publisher · View at Google Scholar · View at Scopus
  35. H.-Y. Zheng and L. Wang, “Reduction of carbon emissions and project makespan by a pareto-based estimation of distribution algorithm,” International Journal of Production Economics, vol. 164, pp. 421–432, 2014. View at Publisher · View at Google Scholar · View at Scopus
  36. A. Giret, D. Trentesaux, and V. Prabhu, “Sustainability in manufacturing operations scheduling: a state of the art review,” Journal of Manufacturing Systems, vol. 37, pp. 126–140, 2015. View at Publisher · View at Google Scholar · View at Scopus
  37. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. Rinnooy Kan, “Optimization and approximation in deterministic sequencing and scheduling: a survey,” Annals of Discrete Mathematics, vol. 5, pp. 287–326, 1979. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  38. E. R. Gafarov, A. Dolgui, and F. Werner, “A new graphical approach for solving single-machine scheduling problems approximately,” International Journal of Production Research, pp. 1–16, 2014. View at Google Scholar
  39. D. Oron, D. Shabtay, and G. Steiner, “Single machine scheduling with two competing agents and equal job processing times,” European Journal of Operational Research, vol. 244, no. 1, pp. 86–99, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  40. M. Dong, “Parallel machine scheduling with limited controllable machine availability,” International Journal of Production Research, vol. 51, no. 8, pp. 2240–2252, 2013. View at Publisher · View at Google Scholar · View at Scopus
  41. E. Lalla-Ruiz and S. Voß, “Modeling the parallel machine scheduling problem with step deteriorating jobs,” European Journal of Operational Research, vol. 255, no. 1, pp. 21–33, 2016. View at Publisher · View at Google Scholar · View at MathSciNet
  42. D. Yilmaz Eroglu, H. C. Ozmutlu, and S. Ozmutlu, “Genetic algorithm with local search for the unrelated parallel machine scheduling problem with sequence-dependent set-up times,” International Journal of Production Research, pp. 1–16, 2014. View at Google Scholar
  43. A. Allahverdi, “A survey of scheduling problems with no-wait in process,” European Journal of Operational Research, vol. 255, no. 3, pp. 665–686, 2016. View at Publisher · View at Google Scholar · View at MathSciNet
  44. M. G. Filho, M. De Fátima Morais, T. J. P. Boiko, H. H. Miyata, and F. W. R. Varolo, “Scheduling in flow shop with sequence-dependent setup times: literature review and analysis,” International Journal of Business Innovation and Research, vol. 7, no. 4, pp. 466–486, 2013. View at Publisher · View at Google Scholar · View at Scopus
  45. J. Schaller, “Scheduling a permutation flow shop with family setups to minimise total tardiness,” International Journal of Production Research, vol. 50, no. 8, pp. 1–14, 2012. View at Google Scholar
  46. M. A. Abdeljaouad, Z. Bahroun, A. Omrane, and J. Fondrevelle, “Job-shop production scheduling with reverse flows,” European Journal of Operational Research, vol. 244, no. 1, pp. 117–128, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  47. C. Koulamas and S. S. Panwalkar, “The proportionate two-machine no-wait job shop scheduling problem,” European Journal of Operational Research, vol. 252, no. 1, pp. 131–135, 2016. View at Publisher · View at Google Scholar · View at MathSciNet
  48. B. Nikjo and Y. Zarook, “A non-permutation flow shop manufacturing cell scheduling problem with part's sequence dependent family setup times,” International Journal of Applied Metaheuristic Computing, vol. 5, no. 4, pp. 70–86, 2014. View at Publisher · View at Google Scholar
  49. M. T. Taghavifard, “Scheduling cellular manufacturing systems using ACO and GA,” International Journal of Applied Metaheuristic Computing, vol. 3, no. 1, pp. 48–64, 2012. View at Publisher · View at Google Scholar
  50. J. Tang, X. Wang, I. Kaku, and K.-L. Yung, “Optimization of parts scheduling in multiple cells considering intercell move using scatter search approach,” Journal of Intelligent Manufacturing, vol. 21, no. 4, pp. 525–537, 2010. View at Publisher · View at Google Scholar · View at Scopus
  51. M. Zandieh and N. Karimi, “An adaptive multi-population genetic algorithm to solve the multi-objective group scheduling problem in hybrid flexible flowshop with sequence-dependent setup times,” Journal of Intelligent Manufacturing, vol. 22, no. 6, pp. 979–989, 2011. View at Publisher · View at Google Scholar · View at Scopus
  52. F. Ahmadizar and M. H. Farahani, “A novel hybrid genetic algorithm for the open shop scheduling problem,” International Journal of Advanced Manufacturing Technology, vol. 62, no. 5–8, pp. 775–787, 2012. View at Publisher · View at Google Scholar · View at Scopus
  53. C. C. Guillermo, D. Frédéric, Y. Farouk, and K. Russell, “Open shop scheduling problem with a multi-skills resource constraint: a genetic algorithm and an ant colony optimisation approach,” International Journal of Production Research, pp. 1–28, 2015. View at Google Scholar
  54. B. Naderi and M. Zandieh, “Modeling and scheduling no-wait open shop problems,” International Journal of Production Economics, vol. 158, pp. 256–266, 2014. View at Publisher · View at Google Scholar · View at Scopus
  55. A. Che, H. Hu, M. Chabrol, and M. Gourgand, “A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell,” Computers & Operations Research, vol. 38, no. 9, pp. 1275–1285, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  56. H. Samarghandi, “A particle swarm optimisation for the no-wait flow shop problem with due date constraints,” International Journal of Production Research, pp. 1–18, 2015. View at Google Scholar
  57. Q.-Q. Sun and B. Dong, “No-wait flow shop scheduling based on discrete harmony search algorithm,” Applied Mechanics and Materials, vol. 513-517, pp. 1523–1526, 2014. View at Publisher · View at Google Scholar · View at Scopus
  58. K.-C. Ying, Z.-J. Lee, C.-C. Lu, and S.-W. Lin, “Metaheuristics for scheduling a no-wait flowshop manufacturing cell with sequence-dependent family setups,” International Journal of Advanced Manufacturing Technology, vol. 58, no. 5–8, pp. 671–682, 2012. View at Publisher · View at Google Scholar · View at Scopus
  59. H. Yuan, Y. Jing, J. Huang, and T. Ren, “Optimal research and numerical simulation for scheduling no-wait flow shop in steel production,” Journal of Applied Mathematics, vol. 2013, Article ID 498282, 5 pages, 2013. View at Publisher · View at Google Scholar · View at Scopus
  60. X. Qi, H. Wang, H. Zhu, J. Zhang, F. Chen, and J. Yang, “Fast local neighborhood search algorithm for the no-wait flow shop scheduling with total flow time minimization,” International Journal of Production Research, pp. 1–16, 2016. View at Publisher · View at Google Scholar · View at Scopus
  61. F. Jolai, M. Rabiee, and H. Asefi, “A novel hybrid meta-heuristic algorithm for a no-wait flexible flow shop scheduling problem with sequence dependent setup times,” International Journal of Production Research, vol. 50, no. 24, pp. 7447–7466, 2012. View at Publisher · View at Google Scholar · View at Scopus
  62. M. Rabiee, F. Jolai, H. Asefi, P. Fattahi, and S. Lim, “A biogeography-based optimisation algorithm for a realistic no-wait hybrid flow shop with unrelated parallel machines to minimise mean tardiness,” International Journal of Computer Integrated Manufacturing, pp. 1–18, 2016. View at Publisher · View at Google Scholar · View at Scopus
  63. J.-W. Song and J.-F. Tang, “No-wait hybrid flow shop scheduling method based on discrete particle swarm optimization,” Journal of System Simulation, vol. 22, no. 10, pp. 2257–2261, 2010. View at Google Scholar
  64. S. Wang and M. Liu, “A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem,” Computers & Operations Research, vol. 40, no. 4, pp. 1064–1075, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  65. S. Wang, M. Liu, and C. Chu, “A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling,” International Journal of Production Research, pp. 1–25, 2014. View at Google Scholar
  66. W. Bozejko and M. Makuchowski, “Solving the no-wait job-shop problem by using genetic algorithm with automatic adjustment,” International Journal of Advanced Manufacturing Technology, vol. 57, no. 5–8, pp. 735–752, 2011. View at Publisher · View at Google Scholar · View at Scopus
  67. R. Bürgy and H. Gröflin, “Optimal job insertion in the no-wait job shop,” Journal of Combinatorial Optimization, vol. 26, no. 2, pp. 345–371, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  68. J. Zhu, X. Li, and W. Shen, “A divide and conquer-based greedy search for two-machine no-wait job shop problems with makespan minimisation,” International Journal of Production Research, vol. 50, no. 10, pp. 2692–2704, 2012. View at Publisher · View at Google Scholar
  69. B. Na, S. Ahmed, G. Nemhauser, and J. Sokol, “A cutting and scheduling problem in float glass manufacturing,” Journal of Scheduling, vol. 17, no. 1, pp. 95–107, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  70. J. Pei, X. Liu, P. M. Pardalos, W. Fan, and S. Yang, “Single machine serial-batching scheduling with independent setup time and deteriorating job processing times,” Optimization Letters, vol. 9, no. 1, pp. 91–104, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  71. J.-B. Wang and L. Sun, “Single-machine group scheduling with linearly decreasing time-dependent setup times and job processing times,” International Journal of Advanced Manufacturing Technology, vol. 49, no. 5–8, pp. 765–772, 2010. View at Publisher · View at Google Scholar · View at Scopus
  72. J.-B. Wang, X. Huang, Y.-B. Wu, and P. Ji, “Group scheduling with independent setup times, ready times, and deteriorating job processing times,” International Journal of Advanced Manufacturing Technology, vol. 60, no. 5–8, pp. 643–649, 2012. View at Publisher · View at Google Scholar · View at Scopus
  73. A. Gharbi, T. Ladhari, M. K. Msakni, and M. Serairi, “The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies,” European Journal of Operational Research, vol. 231, no. 1, pp. 69–78, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  74. S.-J. Yang, “Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine,” Applied Mathematical Modelling. Simulation and Computation for Engineering and Environmental Systems, vol. 35, no. 8, pp. 4008–4016, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  75. S.-S. Liu and C.-J. Wang, “Profit optimization for multiproject scheduling problems considering cash flow,” Journal of Construction Engineering and Management, vol. 136, no. 12, pp. 1268–1278, 2010. View at Publisher · View at Google Scholar · View at Scopus
  76. J. S. Neufeld, J. N. D. Gupta, and U. Buscher, “A comprehensive review of flowshop group scheduling literature,” Computers & Operations Research, vol. 70, pp. 56–74, 2016. View at Publisher · View at Google Scholar · View at MathSciNet
  77. H. Aytug, M. A. Lawley, K. McKay, S. Mohan, and R. Uzsoy, “Executing production schedules in the face of uncertainties: a review and some future directions,” European Journal of Operational Research, vol. 161, no. 1, pp. 86–110, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  78. G. E. Vieira, J. W. Herrmann, and E. Lin, “Rescheduling manufacturing systems: a framework of strategies, policies, and methods,” Journal of Scheduling, vol. 6, no. 1, pp. 39–62, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  79. X. Qi, J. F. Bard, and G. Yu, “Disruption management for machine scheduling: the case of SPT schedules,” International Journal of Production Economics, vol. 103, no. 1, pp. 166–184, 2006. View at Publisher · View at Google Scholar · View at Scopus
  80. A. Alaswad and Y. Xiang, “A review on condition-based maintenance optimization models for stochastically deteriorating system,” Reliability Engineering & System Safety, vol. 157, pp. 54–63, 2017. View at Publisher · View at Google Scholar
  81. Y. Yin, T. C. Cheng, and D.-J. Wang, “Rescheduling on identical parallel machines with machine disruptions to minimize total completion time,” European Journal of Operational Research, vol. 252, no. 3, pp. 737–749, 2016. View at Publisher · View at Google Scholar · View at MathSciNet
  82. M. A. Salido, J. Escamilla, F. Barber, and A. Giret, “Rescheduling in job-shop problems for sustainable manufacturing systems,” Journal of Cleaner Production, 2016. View at Publisher · View at Google Scholar
  83. A. Hamzadayi and G. Yildiz, “Event driven strategy based complete rescheduling approaches for dynamic m identical parallel machines scheduling problem with a common server,” Computers and Industrial Engineering, vol. 91, pp. 66–84, 2016a. View at Publisher · View at Google Scholar · View at Scopus
  84. A. Hamzadayi and G. Yildiz, “Hybrid strategy based complete rescheduling approaches for dynamic m identical parallel machines scheduling problem with a common server,” Simulation Modelling Practice and Theory, vol. 63, pp. 104–132, 2016b. View at Publisher · View at Google Scholar · View at Scopus
  85. C. Akkan, “Improving schedule stability in single-machine rescheduling for new operation insertion,” Computers & Operations Research, vol. 64, pp. 198–209, 2015. View at Publisher · View at Google Scholar · View at MathSciNet
  86. K. Mao, Q.-K. Pan, X. Pang, and T. Chai, “An effective Lagrangian relaxation approach for rescheduling a steelmaking-continuous casting process,” Control Engineering Practice, vol. 30, pp. 67–77, 2014. View at Publisher · View at Google Scholar · View at Scopus
  87. J.-P. Arnaout, “Rescheduling of parallel machines with stochastic processing and setup times,” Journal of Manufacturing Systems, vol. 33, no. 3, pp. 376–384, 2014. View at Publisher · View at Google Scholar · View at Scopus
  88. H. Hoogeveen, C. Lenté, and V. T'kindt, “Rescheduling for new orders on a single machine with setup times,” European Journal of Operational Research, vol. 223, no. 1, pp. 40–46, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  89. M. Nourelfath, “Service level robustness in stochastic production planning under random machine breakdowns,” European Journal of Operational Research, vol. 212, no. 1, pp. 81–88, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  90. K. Sabri-Laghaie, M. Mansouri, A. Motaghedi-Larijani, and G. Jalali-Naini, “Combining a maintenance center M/M/c/m queue into the economic production quantity model with stochastic machine breakdowns and repair,” Computers and Industrial Engineering, vol. 63, no. 4, pp. 864–874, 2012. View at Publisher · View at Google Scholar · View at Scopus
  91. J.-C. Ke and C.-H. Wu, “Multi-server machine repair model with standbys and synchronous multiple vacation,” Computers and Industrial Engineering, vol. 62, no. 1, pp. 296–305, 2012. View at Publisher · View at Google Scholar · View at Scopus
  92. P. Yan, A. Che, X. Cai, and X. Tang, “Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance,” Computers and Operations Research, vol. 50, pp. 128–140, 2014. View at Publisher · View at Google Scholar · View at Scopus
  93. J. Yin, T. Tang, L. Yang, Z. Gao, and B. Ran, “Energy-efficient metro train rescheduling with uncertain time-variant passenger demands: an approximate dynamic programming approach,” Transportation Research Part B: Methodological, vol. 91, pp. 178–210, 2016. View at Publisher · View at Google Scholar · View at Scopus
  94. Y. Gao, L. Kroon, M. Schmidt, and L. Yang, “Rescheduling a metro line in an over-crowded situation after disruptions,” Transportation Research Part B: Methodological, vol. 93, pp. 425–449, 2016. View at Publisher · View at Google Scholar
  95. T. van Vianen, J. Ottjes, and G. Lodewijks, “Simulation-based rescheduling of the stacker-reclaimer operation,” Journal of Computational Science, vol. 10, pp. 149–154, 2015. View at Publisher · View at Google Scholar · View at Scopus
  96. J. O. Brunner, “Rescheduling of flights during ground delay programs with consideration of passenger and crew connections,” Transportation Research Part E: Logistics and Transportation Review, vol. 72, pp. 236–252, 2014. View at Publisher · View at Google Scholar · View at Scopus
  97. A. R. Albrecht, D. M. Panton, and D. H. Lee, “Rescheduling rail networks with maintenance disruptions using problem space search,” Computers and Operations Research, vol. 40, no. 3, pp. 703–712, 2013. View at Publisher · View at Google Scholar · View at Scopus
  98. E. Erdem, X. Qu, and J. Shi, “Rescheduling of elective patients upon the arrival of emergency patients,” Decision Support Systems, vol. 54, no. 1, pp. 551–563, 2012. View at Publisher · View at Google Scholar · View at Scopus
  99. E. C. Oehler, R. L. Day, D. B. Robinson, and L. H. Brown, “Has the rescheduling of hydrocodone changed ED prescribing practices?” The American Journal of Emergency Medicine, vol. 34, no. 12, pp. 2388–2391, 2016. View at Publisher · View at Google Scholar
  100. G. Yao, Y. Ding, L. Ren, K. Hao, and L. Chen, “An immune system-inspired rescheduling algorithm for workflow in cloud systems,” Knowledge-Based Systems, vol. 99, pp. 39–50, 2016. View at Publisher · View at Google Scholar · View at Scopus
  101. D. Gupta, C. T. Maravelias, and J. M. Wassick, “From rescheduling to online scheduling,” Chemical Engineering Research and Design, vol. 116, pp. 83–97, 2016. View at Publisher · View at Google Scholar
  102. J. T. van Essen, J. L. Hurink, W. Hartholt, and B. J. van den Akker, “Decision support system for the operating room rescheduling problem,” Health Care Management Science, vol. 15, no. 4, pp. 355–372, 2012. View at Publisher · View at Google Scholar · View at Scopus
  103. C. N. Gross, A. Fügener, and J. O. Brunner, “Online rescheduling of physicians in hospitals,” Flexible Services and Manufacturing Journal, pp. 1–13, 2017. View at Publisher · View at Google Scholar
  104. G. B. Dantzig and J. H. Ramser, “The truck dispatching problem,” Management Science, vol. 6, no. 1, pp. 80–91, 1959. View at Publisher · View at Google Scholar · View at MathSciNet
  105. G. Clarke and J. W. Wright, “Scheduling of vehicles from a central depot to a number of delivery points,” Operations Research, vol. 12, no. 4, pp. 568–581, 1964. View at Publisher · View at Google Scholar
  106. B. Eksioglu, A. V. Vural, and A. Reisman, “The vehicle routing problem: a taxonomic review,” Computers and Industrial Engineering, vol. 57, no. 4, pp. 1472–1483, 2009. View at Publisher · View at Google Scholar · View at Scopus
  107. K. Braekers, K. Ramaekers, and I. Van Nieuwenhuyse, “The vehicle routing problem: state of the art classification and review,” Computers and Industrial Engineering, vol. 99, pp. 300–313, 2016. View at Google Scholar
  108. G. Laporte, “Fifty years of vehicle routing,” Transportation Science, vol. 43, no. 4, pp. 408–416, 2009. View at Publisher · View at Google Scholar · View at Scopus
  109. A. M. Campbell and J. H. Wilson, “Forty years of periodic vehicle routing,” Networks, vol. 63, no. 1, pp. 2–15, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  110. O. Bräysy and M. Gendreau, “Vehicle routing problem with time windows, part I: route construction and local search algorithms,” Transportation Science, vol. 39, no. 1, pp. 104–118, 2005. View at Publisher · View at Google Scholar · View at Scopus
  111. O. Bräysy and M. Gendreau, “Vehicle routing problem with time windows, Part II: metaheuristics,” Transportation Science, vol. 39, no. 1, pp. 119–139, 2005. View at Publisher · View at Google Scholar · View at Scopus
  112. M. Gendreau and C. D. Tarantilis, Solving Large-Scale Vehicle Routing Problems with Time Windows: The State-of-the-Art, Montreal, Canada, 2010.
  113. V. Pillac, M. Gendreau, C. Guéret, and A. L. Medaglia, “A review of dynamic vehicle routing problems,” European Journal of Operational Research, vol. 225, no. 1, pp. 1–11, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  114. G. Berbeglia, J.-F. Cordeau, I. Gribkovskaia, and G. Laporte, “Static pickup and delivery problems: a classification scheme and survey,” TOP, vol. 15, no. 1, pp. 1–31, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  115. J. R. Montoya-Torres, J. L. Franco, S. N. Isaza, H. Felizzola Jiménez, and N. Herazo-Padilla, “A literature review on the vehicle routing problem with multiple depots,” Computers & Industrial Engineering, vol. 79, pp. 115–129, 2015. View at Publisher · View at Google Scholar · View at Scopus
  116. C. Archetti and M. G. Speranza, “Vehicle routing problems with split deliveries,” International Transactions in Operational Research, vol. 19, no. 1-2, pp. 3–22, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  117. R. Lahyani, M. Khemakhem, and F. Semet, “Rich vehicle routing problems: from a taxonomy to a definition,” European Journal of Operational Research, vol. 241, no. 1, pp. 1–14, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  118. C. Lin, K. L. Choy, G. T. S. Ho, S. H. Chung, and H. Y. Lam, “Survey of green vehicle routing problem: past and future trends,” Expert Systems with Applications, vol. 41, no. 4, pp. 1118–1138, 2014. View at Publisher · View at Google Scholar · View at Scopus
  119. M. Drexl, “Synchronization in vehicle routing—a survey of VRPs with multiple synchronization constraints,” Transportation Science, vol. 46, no. 3, pp. 297–316, 2012. View at Publisher · View at Google Scholar · View at Scopus
  120. R. Musa, J.-P. Arnaout, and H. Jung, “Ant colony optimization algorithm to solve for the transportation problem of cross-docking network,” Computers & Industrial Engineering, vol. 59, no. 1, pp. 85–92, 2010. View at Publisher · View at Google Scholar · View at Scopus
  121. J. G. Villegas, C. Prins, C. Prodhon, A. L. Medaglia, and N. Velasco, “A GRASP with evolutionary path relinking for the truck and trailer routing problem,” Computers and Operations Research, vol. 38, no. 9, pp. 1319–1334, 2011. View at Publisher · View at Google Scholar · View at Scopus
  122. C. D. Tarantilis, F. Stavropoulou, and P. P. Repoussis, “A template-based tabu search algorithm for the consistent vehicle routing problem,” Expert Systems with Applications, vol. 39, no. 4, pp. 4233–4239, 2012. View at Publisher · View at Google Scholar · View at Scopus
  123. F. Chen, H. Wang, C. Qi, and Y. Xie, “An ant colony optimization routing algorithm for two order pickers with congestion consideration,” Computers and Industrial Engineering, vol. 66, no. 1, pp. 77–85, 2013. View at Publisher · View at Google Scholar · View at Scopus
  124. C. Lin, K. L. Choy, G. T. S. Ho, and T. W. Ng, “A Genetic Algorithm-based optimization model for supporting green transportation operations,” Expert Systems with Applications, vol. 41, no. 7, pp. 3284–3296, 2014. View at Publisher · View at Google Scholar · View at Scopus
  125. C. Archetti, N. Bianchessi, and M. G. Speranza, “A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem,” Computers & Operations Research, vol. 64, pp. 1–10, 2015. View at Publisher · View at Google Scholar · View at MathSciNet
  126. U. Emeç, B. Çatay, and B. Bozkaya, “An adaptive large neighborhood search for an E-grocery delivery routing problem,” Computers & Operations Research, vol. 69, pp. 109–125, 2016. View at Publisher · View at Google Scholar · View at MathSciNet
  127. R. Baldacci, P. Toth, and D. Vigo, “Exact algorithms for routing problems under vehicle capacity constraints,” Annals of Operations Research, vol. 175, pp. 213–245, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  128. P. P. Repoussis, C. D. Tarantilis, O. Bräysy, and G. Ioannou, “A hybrid evolution strategy for the open vehicle routing problem,” Computers & Operations Research, vol. 37, no. 3, pp. 443–455, 2010. View at Publisher · View at Google Scholar · View at Scopus
  129. F. L. Usberti, P. M. França, and A. L. M. França, “The open capacitated arc routing problem,” Computers & Operations Research, vol. 38, no. 11, pp. 1543–1555, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  130. X. Li, S. C. H. Leung, and P. Tian, “A multistart adaptive memory-based tabu search algorithm for the heterogeneous fixed fleet open vehicle routing problem,” Expert Systems with Applications, vol. 39, no. 1, pp. 365–374, 2012. View at Publisher · View at Google Scholar · View at Scopus
  131. A. D. López-Sánchez, A. G. Hernández-Díaz, D. Vigo, R. Caballero, and J. Molina, “A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem,” European Journal of Operational Research, vol. 238, no. 1, pp. 104–113, 2014. View at Publisher · View at Google Scholar · View at Scopus
  132. Y. Nagata, O. Bräysy, and W. Dullaert, “A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows,” Computers and Operations Research, vol. 37, no. 4, pp. 724–737, 2010. View at Google Scholar
  133. S. R. Balseiro, I. Loiseau, and J. Ramonet, “An ant colony algorithm hybridized with insertion heuristics for the time dependent vehicle routing problem with time windows,” Computers & Operations Research, vol. 38, no. 6, pp. 954–966, 2011. View at Publisher · View at Google Scholar · View at Scopus
  134. L. Hong, “An improved LNS algorithm for real-time vehicle routing problem with time windows,” Computers and Operations Research, vol. 39, no. 2, pp. 151–163, 2012. View at Publisher · View at Google Scholar · View at Scopus
  135. T. Vidal, T. G. Crainic, M. Gendreau, and C. Prins, “A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows,” Computers & Operations Research, vol. 40, no. 1, pp. 475–489, 2013. View at Publisher · View at Google Scholar · View at Scopus
  136. T.-C. Chiang and W.-H. Hsu, “A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows,” Computers & Operations Research, vol. 45, pp. 25–37, 2014. View at Publisher · View at Google Scholar
  137. B. Yang, Z.-H. Hu, C. Wei, S.-Q. Li, L. Zhao, and S. Jia, “Routing with time-windows for multiple environmental vehicle types,” Computers and Industrial Engineering, vol. 89, pp. 150–161, 2015. View at Publisher · View at Google Scholar
  138. D. Cinar, K. Gakis, and P. M. Pardalos, “A 2-phase constructive algorithm for cumulative vehicle routing problems with limited duration,” Expert Systems with Applications, vol. 56, pp. 48–58, 2016. View at Publisher · View at Google Scholar · View at Scopus
  139. E. E. Zachariadis, C. D. Tarantilis, and C. T. Kiranoudis, “An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries,” European Journal of Operational Research, vol. 202, no. 2, pp. 401–411, 2010. View at Publisher · View at Google Scholar · View at Scopus
  140. E. E. Zachariadis and C. T. Kiranoudis, “A local search metaheuristic algorithm for the vehicle routing problem with simultaneous pick-ups and deliveries,” Expert Systems with Applications, vol. 38, no. 3, pp. 2717–2726, 2011. View at Publisher · View at Google Scholar · View at Scopus
  141. F. P. Goksal, I. Karaoglan, and F. Altiparmak, “A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery,” Computers & Industrial Engineering, vol. 65, no. 1, pp. 39–53, 2013. View at Publisher · View at Google Scholar · View at Scopus
  142. C. Gauvin, G. Desaulniers, and M. Gendreau, “A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands,” Computers & Operations Research, vol. 50, pp. 141–153, 2014. View at Publisher · View at Google Scholar · View at Scopus
  143. A. García-Nájera, J. A. Bullinaria, and M. A. Gutiérrez-Andrade, “An evolutionary approach for multi-objective vehicle routing problems with backhauls,” Computers and Industrial Engineering, vol. 81, pp. 90–108, 2015. View at Publisher · View at Google Scholar · View at Scopus
  144. M. Avci and S. Topaloglu, “A hybrid metaheuristic algorithm for heterogeneous vehicle routing problem with simultaneous pickup and delivery,” Expert Systems with Applications, vol. 53, pp. 160–171, 2016. View at Publisher · View at Google Scholar · View at Scopus
  145. V. F. Yu, S.-W. Lin, W. Lee, and C.-J. Ting, “A simulated annealing heuristic for the capacitated location routing problem,” Computers and Industrial Engineering, vol. 58, no. 2, pp. 288–299, 2010. View at Publisher · View at Google Scholar · View at Scopus
  146. J.-M. Belenguer, E. Benavent, C. Prins, C. Prodhon, and R. Wolfler Calvo, “A branch-and-cut method for the capacitated location-routing problem,” Computers & Operations Research, vol. 38, no. 6, pp. 931–941, 2011. View at Publisher · View at Google Scholar · View at Scopus
  147. K. Govindan, A. Jafarian, R. Khodaverdi, and K. Devika, “Two-echelon multiple-vehicle location-routing problem with time windows for optimization of sustainable supply chain network of perishable food,” International Journal of Production Economics, vol. 152, pp. 9–28, 2014. View at Publisher · View at Google Scholar · View at Scopus
  148. M. Wen, J.-F. Cordeau, G. Laporte, and J. Larsen, “The dynamic multi-period vehicle routing problem,” Computers & Operations Research, vol. 37, no. 9, pp. 1615–1623, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  149. Z. Zhang, O. Che, B. Cheang, A. Lim, and H. Qin, “A memetic algorithm for the multiperiod vehicle routing problem with profit,” European Journal of Operational Research, vol. 229, no. 3, pp. 573–584, 2013. View at Publisher · View at Google Scholar · View at Scopus
  150. I. Dayarian, T. G. Crainic, M. Gendreau, and W. Rei, “A branch-and-price approach for a multi-period vehicle routing problem,” Computers and Operations Research, vol. 55, pp. 167–184, 2015. View at Publisher · View at Google Scholar · View at Scopus
  151. V. N. S. A. Kumar, V. Kumar, M. Brady, J. A. Garza-Reyes, and M. Simpson, “Resolving forward-reverse logistics multi-period model using evolutionary algorithms,” International Journal of Production Economics, vol. 183, pp. 458–469, 2016. View at Publisher · View at Google Scholar · View at Scopus
  152. R. Liu, Z. Jiang, R. Y. K. Fung, F. Chen, and X. Liu, “Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration,” Computers and Operations Research, vol. 37, no. 5, pp. 950–959, 2010. View at Google Scholar
  153. Y. Kuo and C.-C. Wang, “A variable neighborhood search for the multi-depot vehicle routing problem with loading cost,” Expert Systems with Applications, vol. 39, no. 8, pp. 6949–6954, 2012. View at Publisher · View at Google Scholar · View at Scopus
  154. J. Luo and M.-R. Chen, “Improved shuffled frog leaping algorithm and its multi-phase model for multi-depot vehicle routing problem,” Expert Systems with Applications, vol. 41, no. 5, pp. 2535–2545, 2014. View at Publisher · View at Google Scholar · View at Scopus
  155. I. Dayarian, T. G. Crainic, M. Gendreau, and W. Rei, “A column generation approach for a multi-attribute vehicle routing problem,” European Journal of Operational Research, vol. 241, no. 3, pp. 888–906, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  156. F. B. De Oliveira, R. Enayatifar, H. J. Sadaei, F. G. Guimarães, and J.-Y. Potvin, “A cooperative coevolutionary algorithm for the multi-depot vehicle routing problem,” Expert Systems with Applications, vol. 43, pp. 117–130, 2016. View at Publisher · View at Google Scholar · View at Scopus
  157. E. E. Zachariadis and C. T. Kiranoudis, “An effective local search approach for the vehicle routing problem with backhauls,” Expert Systems with Applications, vol. 39, no. 3, pp. 3174–3184, 2012. View at Publisher · View at Google Scholar · View at Scopus
  158. D. Palhazi Cuervo, P. Goos, K. Sörensen, and E. Arráiz, “An iterated local search algorithm for the vehicle routing problem with backhauls,” European Journal of Operational Research, vol. 237, no. 2, pp. 454–464, 2014. View at Publisher · View at Google Scholar · View at Scopus
  159. A. Bortfeldt, T. Hahn, D. Männel, and L. Mönch, “Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints,” European Journal of Operational Research, vol. 243, no. 1, pp. 82–96, 2015. View at Publisher · View at Google Scholar · View at MathSciNet
  160. L. C. Coelho, J.-F. Cordeau, and G. Laporte, “The inventory-routing problem with transshipment,” Computers & Operations Research, vol. 39, no. 11, pp. 2537–2548, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  161. L. Qin, L. Miao, Q. Ruan, and Y. Zhang, “A local search method for periodic inventory routing problem,” Expert Systems with Applications, vol. 41, no. 2, pp. 765–778, 2014. View at Publisher · View at Google Scholar · View at Scopus
  162. J.-F. Cordeau, D. Laganà, R. Musmanno, and F. Vocaturo, “A decomposition-based heuristic for the multiple-product inventory-routing problem,” Computers & Operations Research, vol. 55, pp. 153–166, 2015. View at Publisher · View at Google Scholar · View at MathSciNet
  163. G. Iassinovskaia, S. Limbourg, and F. Riane, “The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains,” International Journal of Production Economics, vol. 183, pp. 570–582, 2016. View at Google Scholar
  164. F. Ferrucci and S. Bock, “A general approach for controlling vehicle en-route diversions in dynamic vehicle routing problems,” Transportation Research Part B, vol. 77, pp. 76–87, 2015. View at Publisher · View at Google Scholar · View at Scopus
  165. S.-C. Liu and W.-T. Lee, “A heuristic method for the inventory routing problem with time windows,” Expert Systems with Applications, vol. 38, no. 10, pp. 13223–13231, 2011. View at Publisher · View at Google Scholar · View at Scopus
  166. J. Cordeau and M. Maischberger, “A parallel iterated tabu search heuristic for vehicle routing problems,” Computers and Operations Research, vol. 39, no. 9, pp. 2033–2050, 2012. View at Publisher · View at Google Scholar · View at Scopus
  167. A. Subramanian, E. Uchoa, and L. S. Ochi, “A hybrid algorithm for a class of vehicle routing problems,” Computers & Operations Research, vol. 40, no. 10, pp. 2519–2531, 2013. View at Publisher · View at Google Scholar · View at Scopus
  168. J. Michallet, C. Prins, L. Amodeo, F. Yalaoui, and G. Vitry, “Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services,” Computers & Operations Research, vol. 41, pp. 196–207, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  169. A. Rahimi-Vahed, T. G. Crainic, M. Gendreau, and W. Rei, “Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm,” Computers & Operations Research, vol. 53, pp. 9–23, 2015. View at Publisher · View at Google Scholar · View at MathSciNet
  170. M. Albareda-Sambola, E. Fernández, and G. Laporte, “The dynamic multiperiod vehicle routing problem with probabilistic information,” Computers & Operations Research, vol. 48, no. 2, pp. 31–39, 2014. View at Publisher · View at Google Scholar · View at Scopus
  171. M. Avci and S. Topaloglu, “An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries,” Computers and Industrial Engineering, vol. 83, pp. 15–29, 2015. View at Publisher · View at Google Scholar · View at Scopus
  172. B. Çatay, “A new saving-based ant algorithm for the vehicle routing problem with simultaneous pickup and delivery,” Expert Systems with Applications, vol. 37, no. 10, pp. 6809–6817, 2010. View at Publisher · View at Google Scholar · View at Scopus
  173. S. Ceschia, A. Schaerf, and T. Stützle, “Local search techniques for a routing-packing problem,” Computers and Industrial Engineering, vol. 66, no. 4, pp. 1138–1149, 2013. View at Publisher · View at Google Scholar · View at Scopus
  174. P. Belfiore and H. T. Y. Yoshizaki, “Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries,” Computers & Industrial Engineering, vol. 64, no. 2, pp. 589–601, 2013. View at Publisher · View at Google Scholar · View at Scopus
  175. S.-W. Lin, V. F. Yu, and C.-C. Lu, “A simulated annealing heuristic for the truck and trailer routing problem with time windows,” Expert Systems with Applications, vol. 38, no. 12, pp. 15244–15252, 2011. View at Publisher · View at Google Scholar · View at Scopus
  176. S. Salhi, A. Imran, and N. A. Wassan, “The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation,” Computers & Operations Research, vol. 52, pp. 315–325, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  177. E. E. Zachariadis and C. T. Kiranoudis, “An open vehicle routing problem metaheuristic for examining wide solution neighborhoods,” Computers and Operations Research, vol. 37, no. 4, pp. 712–723, 2010. View at Publisher · View at Google Scholar · View at Scopus
  178. Z. Zhang, L. Wei, and A. Lim, “An evolutionary local search for the capacitated vehicle routing problem minimizing fuel consumption under three-dimensional loading constraints,” Transportation Research Part B, vol. 82, pp. 20–35, 2015. View at Publisher · View at Google Scholar · View at Scopus
  179. P. Devapriya, W. Ferrell, and N. Geismar, “Integrated production and distribution scheduling with a perishable product,” European Journal of Operational Research, vol. 259, no. 3, pp. 906–916, 2017. View at Google Scholar
  180. J. Jiang, K. M. Ng, K. L. Poh, and K. M. Teo, “Vehicle routing problem with a heterogeneous fleet and time windows,” Expert Systems with Applications, vol. 41, no. 8, pp. 3748–3760, 2014. View at Publisher · View at Google Scholar · View at Scopus
  181. Q. Ruan, Z. Zhang, L. Miao, and H. Shen, “A hybrid approach for the vehicle routing problem with three-dimensional loading constraints,” Computers & Operations Research, vol. 40, no. 6, pp. 1579–1589, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  182. D. Taş, N. Dellaert, T. Van Woensel, and T. De Kok, “Vehicle routing problem with stochastic travel times including soft time windows and service costs,” Computers & Operations Research, vol. 40, no. 1, pp. 214–224, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  183. D. Taş, O. Jabali, and T. Van Woensel, “A vehicle routing problem with flexible time windows,” Computers and Operations Research, vol. 52, pp. 39–54, 2014. View at Publisher · View at Google Scholar · View at Scopus
  184. J. Brandão, “A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem,” Computers & Operations Research, vol. 38, no. 1, pp. 140–151, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  185. S.-C. Liu and A.-Z. Chen, “Variable neighborhood search for the inventory routing and scheduling problem in a supply chain,” Expert Systems with Applications, vol. 39, no. 4, pp. 4149–4159, 2012. View at Publisher · View at Google Scholar · View at Scopus
  186. R. Nambirajan, A. Mendoza, S. Pazhani, T. T. Narendran, and K. Ganesh, “CARE: heuristics for two-stage multi-product inventory routing problems with replenishments,” Computers and Industrial Engineering, vol. 97, pp. 41–57, 2016. View at Publisher · View at Google Scholar · View at Scopus
  187. Y.-B. Park, J.-S. Yoo, and H.-S. Park, “A genetic algorithm for the vendor-managed inventory routing problem with lost sales,” Expert Systems with Applications, vol. 53, no. 1, pp. 149–159, 2016. View at Publisher · View at Google Scholar · View at Scopus
  188. Y. Xiao, Q. Zhao, I. Kaku, and Y. Xu, “Development of a fuel consumption optimization model for the capacitated vehicle routing problem,” Computers and Operations Research, vol. 39, no. 7, pp. 1419–1431, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  189. L. C. Coelho, J.-F. Cordeau, and G. Laporte, “Heuristics for dynamic and stochastic inventory-routing,” Computers & Operations Research, vol. 52, part A, pp. 55–67, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  190. L. C. Coelho and G. Laporte, “Improved solutions for inventory-routing problems through valid inequalities and input ordering,” International Journal of Production Economics, vol. 155, pp. 391–397, 2014. View at Publisher · View at Google Scholar · View at Scopus
  191. D. Popović, M. Vidović, and G. Radivojević, “Variable neighborhood search heuristic for the inventory routing problem in fuel delivery,” Expert Systems with Applications, vol. 39, no. 18, pp. 13390–13398, 2012. View at Publisher · View at Google Scholar · View at Scopus
  192. H. Shaabani and I. N. Kamalabadi, “An efficient population-based simulated annealing algorithm for the multi-product multi-retailer perishable inventory routing problem,” Computers and Industrial Engineering, vol. 99, pp. 189–201, 2016. View at Publisher · View at Google Scholar · View at Scopus
  193. M. Soysal, J. M. Bloemhof-Ruwaard, R. Haijema, and J. G. A. J. van der Vorst, “Modeling a green inventory routing problem for perishable products with horizontal collaboration,” Computers and Operations Research, 2016. View at Publisher · View at Google Scholar
  194. P. Vansteenwegen and M. Mateo, “An iterated local search algorithm for the single-vehicle cyclic inventory routing problem,” European Journal of Operational Research, vol. 237, no. 3, pp. 802–813, 2014. View at Publisher · View at Google Scholar · View at Scopus
  195. Y. Ren, M. Dessouky, and F. Ordóñez, “The multi-shift vehicle routing problem with overtime,” Computers & Operations Research, vol. 37, no. 11, pp. 1987–1998, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  196. C. Lei, W.-H. Lin, and L. Miao, “A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem,” European Journal of Operational Research, vol. 238, no. 3, pp. 699–710, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  197. M. N. Kritikos and G. Ioannou, “The heterogeneous fleet vehicle routing problem with overloads and time windows,” International Journal of Production Economics, vol. 144, no. 1, pp. 68–75, 2013. View at Publisher · View at Google Scholar · View at Scopus
  198. L. Wen and R. Eglese, “Minimum cost VRP with time-dependent speed data and congestion charge,” Computers & Operations Research, vol. 56, pp. 41–50, 2015. View at Publisher · View at Google Scholar · View at MathSciNet
  199. T. Bektaş and G. Laporte, “The pollution-routing problem,” Transportation Research B: Methodological, vol. 45, no. 8, pp. 1232–1250, 2011. View at Publisher · View at Google Scholar · View at Scopus
  200. E. Demir, T. Bektaş, and G. Laporte, “An adaptive large neighborhood search heuristic for the pollution-routing problem,” European Journal of Operational Research, vol. 223, no. 2, pp. 346–359, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  201. Y. Suzuki, “A dual-objective metaheuristic approach to solve practical pollution routing problem,” International Journal of Production Economics, vol. 176, pp. 143–153, 2016. View at Publisher · View at Google Scholar · View at Scopus
  202. M. Soysal, J. M. Bloemhof-Ruwaard, and T. Bektaş, “The time-dependent two-echelon capacitated vehicle routing problem with environmental considerations,” International Journal of Production Economics, vol. 164, pp. 366–378, 2015. View at Publisher · View at Google Scholar · View at Scopus
  203. M. N. Kritikos and G. Ioannou, “The balanced cargo vehicle routing problem with time windows,” International Journal of Production Economics, vol. 123, no. 1, pp. 42–51, 2010. View at Publisher · View at Google Scholar · View at Scopus
  204. J. Yang and H. Sun, “Battery swap station location-routing problem with capacitated electric vehicles,” Computers and Operations Research, vol. 55, pp. 217–232, 2015. View at Publisher · View at Google Scholar · View at MathSciNet
  205. D. Black, R. Eglese, and S. Wohlk, “The time-dependent prize-collecting arc routing problem,” Computers and Operations Research, vol. 40, no. 2, pp. 526–535, 2013. View at Publisher · View at Google Scholar · View at Scopus
  206. L. Calvet, A. Ferrer, M. I. Gomes, A. A. Juan, and D. Masip, “Combining statistical learning with metaheuristics for the multi-depot vehicle routing problem with market segmentation,” Computers and Industrial Engineering, vol. 94, pp. 93–104, 2016. View at Publisher · View at Google Scholar · View at Scopus
  207. J. E. Korsvik, K. Fagerholt, and G. Laporte, “A large neighbourhood search heuristic for ship routing and scheduling with split loads,” Computers & Operations Research, vol. 38, no. 2, pp. 474–483, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  208. J. de Armas and B. Melián-Batista, “Variable neighborhood search for a dynamic rich vehicle routing problem with time windows,” Computers and Industrial Engineering, vol. 85, pp. 120–131, 2015. View at Publisher · View at Google Scholar · View at Scopus
  209. L. Grandinetti, F. Guerriero, D. Laganá, and O. Pisacane, “An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem,” Computers & Operations Research, vol. 39, no. 10, pp. 2300–2309, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  210. K. Li, B. Chen, A. I. Sivakumar, and Y. Wu, “An inventory-routing problem with the objective of travel time minimization,” European Journal of Operational Research, vol. 236, no. 3, pp. 936–945, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  211. C. A. Valle, L. C. Martinez, A. S. da Cunha, and G. R. Mateus, “Heuristic and exact algorithms for a min-max selective vehicle routing problem,” Computers & Operations Research, vol. 38, no. 7, pp. 1054–1065, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  212. S. Allahyari, M. Salari, and D. Vigo, “A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem,” European Journal of Operational Research, vol. 242, no. 3, pp. 756–768, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  213. J. F. Ehmke, A. M. Campbell, and B. W. Thomas, “Vehicle routing to minimize time-dependent emissions in urban areas,” European Journal of Operational Research, vol. 251, no. 2, pp. 478–494, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  214. A. Tiwari and P.-C. Chang, “A block recombination approach to solve green vehicle routing problem,” International Journal of Production Economics, vol. 164, pp. 379–387, 2015. View at Publisher · View at Google Scholar · View at Scopus
  215. J. Zhang, Y. Zhao, W. Xue, and J. Li, “Vehicle routing problem with fuel consumption and carbon emission,” International Journal of Production Economics, vol. 170, pp. 234–242, 2015b. View at Publisher · View at Google Scholar · View at Scopus
  216. A. Mohapatra, P. R. Bijwe, and B. K. Panigrahi, “An efficient OPF based approach for identification of infeasible contingencies and preventive rescheduling,” Electric Power Systems Research, vol. 111, pp. 148–155, 2014. View at Publisher · View at Google Scholar · View at Scopus
  217. A. L. Kok, E. W. Hans, and J. M. J. Schutten, “Vehicle routing under time-dependent travel times: the impact of congestion avoidance,” Computers and Operations Research, vol. 39, no. 5, pp. 910–918, 2012. View at Publisher · View at Google Scholar · View at Scopus
  218. S.-W. Lin and K.-C. Ying, “Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics,” Omega, vol. 64, pp. 115–125, 2016. View at Google Scholar
  219. S. Dabia, S. Ropke, T. Van Woensel, and T. De Kok, “Branch and price for the time-dependent vehicle routing problem with time windows,” Transportation Science, vol. 47, no. 3, pp. 380–396, 2013. View at Publisher · View at Google Scholar · View at Scopus
  220. J. A. Gromicho, J. J. van Hoorn, F. Saldanha-da-Gama, and G. T. Timmer, “Solving the job-shop scheduling problem optimally by dynamic programming,” Computers & Operations Research, vol. 39, no. 12, pp. 2968–2977, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  221. Y.-W. An and H.-S. Yan, “Lagrangean relaxation approach to joint optimization for production planning and scheduling of synchronous assembly lines,” International Journal of Production Research, pp. 1–18, 2016. View at Publisher · View at Google Scholar · View at Scopus
  222. C. Contardo, J.-F. Cordeau, and B. Gendron, “An exact algorithm based on cut-and-column generation for the capacitated location-routing problem,” INFORMS Journal on Computing, vol. 26, no. 1, pp. 88–102, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  223. G. Dong, J. F. Tang, K. K. Lai, and Y. Kong, “An exact algorithm for vehicle routing and scheduling problem of free pickup and delivery service in flight ticket sales companies based on set-partitioning model,” Journal of Intelligent Manufacturing, vol. 22, no. 5, pp. 789–799, 2011. View at Publisher · View at Google Scholar · View at Scopus
  224. J. Kelbel and Z. Hanzálek, “Solving production scheduling with earliness/tardiness penalties by constraint programming,” Journal of Intelligent Manufacturing, vol. 22, no. 4, pp. 553–562, 2011. View at Publisher · View at Google Scholar · View at Scopus
  225. K. S. Moghaddam, “Multi-objective preventive maintenance and replacement scheduling in a manufacturing system using goal programming,” International Journal of Production Economics, vol. 146, no. 2, pp. 704–716, 2013. View at Publisher · View at Google Scholar · View at Scopus
  226. M. Yaghini, M. Karimi, and M. Rahbar, “A set covering approach for multi-depot train driver scheduling,” Journal of Combinatorial Optimization, vol. 29, no. 3, pp. 636–654, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  227. C. Blum and A. Roli, “Metaheuristics in combinatorial optimi zation: overview and conceptual comparison,” ACM Computing Surveys, vol. 35, no. 3, pp. 268–308, 2003. View at Publisher · View at Google Scholar · View at Scopus
  228. I. Boussaïd, J. Lepagnot, and P. Siarry, “A survey on optimization metaheuristics,” Information Sciences, vol. 237, pp. 82–117, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  229. C.-W. Tsai and J. J. P. C. Rodrigues, “Metaheuristic scheduling for cloud: a survey,” IEEE Systems Journal, vol. 8, no. 1, pp. 279–291, 2014. View at Publisher · View at Google Scholar · View at Scopus
  230. C. Wang, D. Mu, F. Zhao, and J. W. Sutherland, “A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup-delivery and time windows,” Computers and Industrial Engineering, vol. 83, article no. 3950, pp. 111–122, 2015. View at Publisher · View at Google Scholar · View at Scopus
  231. Y. Zheng, Y. Xiao, and Y. Seo, “A tabu search algorithm for simultaneous machine/AGV scheduling problem,” International Journal of Production Research, pp. 1–16, 2014. View at Google Scholar
  232. J.-Y. Ding, S. Song, J. N. D. Gupta, R. Zhang, R. Chiong, and C. Wu, “An improved iterated greedy algorithm with a tabu-based reconstruction strategy for the no-wait flowshop scheduling problem,” Applied Soft Computing Journal, vol. 30, pp. 604–613, 2015. View at Publisher · View at Google Scholar · View at Scopus
  233. F. Luiz Usberti, P. M. França, and A. L. M. França, “GRASP with evolutionary path-relinking for the capacitated arc routing problem,” Computers & Operations Research, vol. 40, no. 12, pp. 3206–3217, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  234. L. Wei, Z. Zhang, D. Zhang, and A. Lim, “A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints,” European Journal of Operational Research, vol. 243, no. 3, pp. 798–814, 2015. View at Publisher · View at Google Scholar · View at Scopus
  235. M. Alzaqebah and S. Abdullah, “An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling,” Journal of Scheduling, vol. 17, no. 3, pp. 249–262, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  236. S. Nguyen, M. Zhang, M. Johnston, and K. Tan, “Hybrid evolutionary computation methods for quay crane scheduling problems,” Computers and Operations Research, vol. 40, no. 8, pp. 2083–2093, 2013. View at Publisher · View at Google Scholar · View at Scopus
  237. M. H. Sebt, Y. Alipouri, and Y. Alipouri, “Solving resource-constrained project scheduling problem with evolutionary programming,” Journal of the Operational Research Society, vol. 64, no. 9, pp. 1327–1335, 2012. View at Publisher · View at Google Scholar · View at Scopus
  238. M. Đurasević, D. Jakobović, and K. Knežević, “Adaptive scheduling on unrelated machines with genetic programming,” Applied Soft Computing Journal, vol. 48, pp. 419–430, 2016. View at Publisher · View at Google Scholar · View at Scopus
  239. 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
  240. J. Tang, J. Zhang, and Z. Pan, “A scatter search algorithm for solving vehicle routing problem with loading cost,” Expert Systems with Applications, vol. 37, no. 6, pp. 4073–4083, 2010b. View at Publisher · View at Google Scholar · View at Scopus
  241. E. Pacini, C. Mateos, and C. García Garino, “Distributed job scheduling based on Swarm Intelligence: a survey,” Computers and Electrical Engineering, vol. 40, no. 1, pp. 252–269, 2014. View at Publisher · View at Google Scholar · View at Scopus
  242. D. Thiruvady, A. T. Ernst, and G. Singh, “Parallel ant colony optimization for resource constrained job scheduling,” Annals of Operations Research, vol. 242, no. 2, pp. 355–372, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  243. L. Sun, H. Ge, and L. Wang, “A coevolutionary bacterial foraging model using pso in job-shop scheduling environments,” International Journal of Grid and Distributed Computing, vol. 9, no. 9, pp. 379–394, 2016. View at Publisher · View at Google Scholar
  244. W. Y. Szeto, Y. Wu, and S. C. Ho, “An artificial bee colony algorithm for the capacitated vehicle routing problem,” European Journal of Operational Research, vol. 215, no. 1, pp. 126–135, 2011. View at Publisher · View at Google Scholar · View at Scopus
  245. S. Abdollahpour and J. Rezaeian, “Minimizing makespan for flow shop scheduling problem with intermediate buffers by using hybrid approach of artificial immune system,” Applied Soft Computing Journal, vol. 28, pp. 44–56, 2015. View at Publisher · View at Google Scholar · View at Scopus
  246. Y.-J. Zheng, H.-F. Ling, H.-H. Shi, H.-S. Chen, and S.-Y. Chen, “Emergency railway wagon scheduling by hybrid biogeography-based optimization,” Computers & Operations Research, vol. 43, pp. 1–8, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  247. M. R. Amin-Naseri and A. J. Afshari, “A hybrid genetic algorithm for integrated process planning and scheduling problem with precedence constraints,” International Journal of Advanced Manufacturing Technology, vol. 59, no. 1–4, pp. 273–287, 2012. View at Publisher · View at Google Scholar · View at Scopus
  248. R. Qing-Dao-Er-Ji and Y. Wang, “A new hybrid genetic algorithm for job shop scheduling problem,” Computers & Operations Research, vol. 39, no. 10, pp. 2291–2299, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  249. R. Qing-Dao-Er-Ji and Y. Wang, “Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm,” Applied Mathematics and Computation, vol. 243, pp. 637–643, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  250. R. Qing-Dao-Er-Ji and Y. Wang, “Inventory based Bi-objective flow shop scheduling model and its hybrid genetic algorithm,” Mathematical Problems in Engineering, vol. 2013, Article ID 976065, 7 pages, 2013. View at Publisher · View at Google Scholar · View at Scopus
  251. R. Qing-Dao-Er-Ji, Y. Wang, and X. Wang, “Inventory based two-objective job shop scheduling model and its hybrid genetic algorithm,” Applied Soft Computing, vol. 13, no. 3, pp. 1400–1406, 2012. View at Publisher · View at Google Scholar · View at Scopus
  252. S. G. Ahmad, C. S. Liew, E. U. Munir, T. F. Ang, and S. U. Khan, “A hybrid genetic algorithm for optimization of scheduling workflow applications in heterogeneous computing systems,” Journal of Parallel and Distributed Computing, vol. 87, pp. 80–90, 2016. View at Publisher · View at Google Scholar · View at Scopus
  253. A.-D. Do Ngoc, S.-H. Lee, and I. Moon, “Hybrid genetic algorithm for test bed scheduling problems,” International Journal of Production Research, pp. 1–16, 2013. View at Google Scholar
  254. L.-Y. Tseng and Y.-T. Lin, “A hybrid genetic algorithm for no-wait flowshop scheduling problem,” International Journal of Production Economics, vol. 128, no. 1, pp. 144–152, 2010. View at Publisher · View at Google Scholar · View at Scopus
  255. J. Wy and B.-I. Kim, “A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem,” Computers and Operations Research, vol. 40, no. 8, pp. 1947–1952, 2013. View at Publisher · View at Google Scholar · View at Scopus
  256. B. Jarboui, M. Eddaly, and P. Siarry, “A hybrid genetic algorithm for solving no-wait flowshop scheduling problems,” International Journal of Advanced Manufacturing Technology, vol. 54, no. 9–12, pp. 1129–1143, 2011. View at Publisher · View at Google Scholar · View at Scopus
  257. L. Zhou, Z. Chen, and S. Chen, “An effective detailed operation scheduling in MES based on hybrid genetic algorithm,” Journal of Intelligent Manufacturing, pp. 1–19, 2015. View at Publisher · View at Google Scholar · View at Scopus
  258. L. Zhang, L. Gao, and X. Li, “A hybrid genetic algorithm and tabu search for a multi-objective dynamic job shop scheduling problem,” International Journal of Production Research, pp. 1–16, 2013. View at Google Scholar
  259. S. Meeran and M. S. Morshed, “Evaluation of a hybrid genetic tabu search framework on job shop scheduling benchmark problems,” International Journal of Production Research, vol. 52, no. 19, pp. 5780–5798, 2014. View at Publisher · View at Google Scholar · View at Scopus
  260. X. Li and L. Gao, “An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem,” International Journal of Production Economics, vol. 174, pp. 93–110, 2016. View at Publisher · View at Google Scholar · View at Scopus
  261. S. Yu, C. Ding, and K. Zhu, “A hybrid GA-TS algorithm for open vehicle routing optimization of coal mines material,” Expert Systems with Applications, vol. 38, no. 8, pp. 10568–10573, 2011. View at Publisher · View at Google Scholar · View at Scopus
  262. E. Safari and S. J. Sadjadi, “A hybrid method for flowshops scheduling with condition-based maintenance constraint and machines breakdown,” Expert Systems with Applications, vol. 38, no. 3, pp. 2020–2029, 2011. View at Publisher · View at Google Scholar · View at Scopus
  263. H. Rafiei, M. Rabbani, H. Gholizadeh, and H. Dashti, “A novel hybrid SA/GA algorithm for solving an integrated cell formation–job scheduling problem with sequence-dependent set-up times,” International Journal of Management Science and Engineering Management, pp. 1–9, 2015. View at Google Scholar
  264. Ö. H. Bettemir and R. Sonmez, “Hybrid genetic algorithm with simulated annealing for resource-constrained project scheduling,” Journal of Management in Engineering, vol. 31, no. 5, Article ID 04014082, 2015. View at Publisher · View at Google Scholar · View at Scopus
  265. G. Du, Z. Jiang, Y. Yao, and X. Diao, “Clinical pathways scheduling using hybrid genetic algorithm,” Journal of Medical Systems, vol. 37, no. 3, article no. 9945, 2013. View at Publisher · View at Google Scholar · View at Scopus
  266. M. R. Yu, Y. J. Zhang, K. Chen, and D. Zhang, “Integration of process planning and scheduling using a hybrid GA/PSO algorithm,” The International Journal of Advanced Manufacturing Technology, vol. 78, no. 1–4, pp. 583–592, 2015. View at Publisher · View at Google Scholar · View at Scopus
  267. L.-L. Liu, R.-S. Hu, X.-P. Hu, G.-P. Zhao, and S. Wang, “A hybrid PSO-GA algorithm for job shop scheduling in machine tool production,” International Journal of Production Research, vol. 53, no. 19, pp. 5755–5781, 2015. View at Publisher · View at Google Scholar · View at Scopus
  268. N. Kumar and D. P. Vidyarthi, “A novel hybrid PSO–GA meta-heuristic for scheduling of DAG with communication on multiprocessor systems,” Engineering with Computers, vol. 32, no. 1, pp. 35–47, 2016. View at Publisher · View at Google Scholar · View at Scopus
  269. J. Zhang and J. Yi, “A hybrid genetic-monkey algorithm for the vehicle routing problem,” International Journal of Hybrid Information Technology, vol. 9, no. 1, pp. 397–404, 2016. View at Publisher · View at Google Scholar
  270. R.-N. Mohammad and M. Ghasem, “A hybrid genetic and linear programming algorithm for two-agent order acceptance and scheduling problem,” Applied Soft Computing Journal, vol. 33, pp. 37–47, 2015. View at Publisher · View at Google Scholar · View at Scopus
  271. C. Chamnanlor, K. Sethanan, C.-F. Chien, and M. Gen, “Re-entrant flow shop scheduling problem with time windows using hybrid genetic algorithm based on auto-tuning strategy,” International Journal of Production Research, pp. 1–18, 2013. View at Google Scholar
  272. R. Zhang, P.-C. Chang, and C. Wu, “A hybrid genetic algorithm for the job shop scheduling problem with practical considerations for manufacturing costs: investigations motivated by vehicle production,” International Journal of Production Economics, vol. 145, no. 1, pp. 38–52, 2013. View at Publisher · View at Google Scholar · View at Scopus
  273. F. Tao, Y. Feng, L. Zhang, and T. W. Liao, “CLPS-GA: a case library and Pareto solution-based hybrid genetic algorithm for energy-aware cloud service scheduling,” Applied Soft Computing Journal, vol. 19, pp. 264–279, 2014. View at Publisher · View at Google Scholar · View at Scopus
  274. J. E. Mendoza, L.-M. Rousseau, and J. G. Villegas, “A hybrid metaheuristic for the vehicle routing problem with stochastic demand and duration constraints,” Journal of Heuristics, vol. 22, no. 4, pp. 539–566, 2016. View at Publisher · View at Google Scholar · View at Scopus
  275. J. Brito, F. J. Martínez, J. A. Moreno, and J. L. Verdegay, “An ACO hybrid metaheuristic for close-open vehicle routing problems with time windows and fuzzy constraints,” Applied Soft Computing Journal, vol. 32, pp. 154–163, 2015. View at Publisher · View at Google Scholar · View at Scopus
  276. M. Keshtzari, B. Naderi, and E. Mehdizadeh, “An improved mathematical model and a hybrid metaheuristic for truck scheduling in cross-dock problems,” Computers and Industrial Engineering, vol. 91, pp. 197–204, 2016. View at Publisher · View at Google Scholar · View at Scopus
  277. A. Alonso-Ayuso, L. F. Escudero, M. Guignard, M. Quinteros, and A. Weintraub, “Forestry management under uncertainty,” Annals of Operations Research, vol. 190, no. 1, pp. 17–39, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  278. W.-W. Cui, Z. Q. Lu, and E. S. Pan, “Integrated production scheduling and maintenance policy for robustness in a single machine,” Computers & Operations Research, vol. 47, no. 7, pp. 81–91, 2014. View at Publisher · View at Google Scholar · View at Scopus
  279. V. Cacchiani and P. Toth, “Nominal and robust train timetabling problems,” European Journal of Operational Research, vol. 219, no. 3, pp. 727–737, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  280. A. L. Soyster, “Convex programming with set-inclusive constraints and applications to inexact linear programming,” Operations Research, vol. 21, no. 5, pp. 1154–1157, 1973. View at Google Scholar
  281. I. E. Grossmann and G. Guillén-Gosálbez, “Scope for the application of mathematical programming techniques in the synthesis and planning of sustainable processes,” Computers and Chemical Engineering, vol. 34, no. 9, pp. 1365–1376, 2010. View at Publisher · View at Google Scholar · View at Scopus
  282. A. Ben-Tal, A. Goryashko, E. Guslitzer, and A. Nemirovski, “Adjustable robust solutions of uncertain linear programs,” Mathematical Programming, vol. 99, no. 2, pp. 351–376, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  283. A. Ben-Tal, B. Golany, A. Nemirovski, and J.-P. Vial, “Retailer-supplier flexible commitments contracts: a robust optimization approach,” Manufacturing and Service Operations Management, vol. 7, no. 3, pp. 248–271, 2005. View at Publisher · View at Google Scholar · View at Scopus
  284. L. P. Veelenturf, D. Potthoff, D. Huisman, L. G. Kroon, G. Maróti, and A. P. M. Wagelmans, “A quasi-robust optimization approach for crew rescheduling,” Transportation Science, vol. 50, no. 1, pp. 204–215, 2016. View at Publisher · View at Google Scholar · View at Scopus
  285. I. Sungur, F. Ordóñez, and M. Dessouky, “A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty,” IIE Transactions, vol. 40, no. 5, pp. 509–523, 2008. View at Publisher · View at Google Scholar · View at Scopus
  286. F. Ordonez, “Robust vehicle routing,” in INFORMS TutORials in Operations Research, J. J. Hasenbein, Ed., pp. 153–178, INFORMS, Hanover, Md, USA, 2010. View at Google Scholar
  287. C. E. Gounaris, W. Wiesemann, and C. A. Floudas, “The robust capacitated vehicle routing problem under demand uncertainty,” Operations Research, vol. 61, no. 3, pp. 677–693, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  288. C. E. Gounaris, P. P. Repoussis, C. D. Tarantilis, W. Wiesemann, and C. A. Floudas, “An adaptive memory programming framework for the robust capacitated vehicle routing problem,” Transportation Science, vol. 50, no. 4, pp. 1239–1260, 2016. View at Publisher · View at Google Scholar