Author:
Roohnavazfar Mina,Pasandideh Seyed Hamid Reza
Publisher
Springer Science and Business Media LLC
Subject
Management of Technology and Innovation,Computational Theory and Mathematics,Management Science and Operations Research,Statistics, Probability and Uncertainty,Strategy and Management,Modeling and Simulation,Numerical Analysis
Reference53 articles.
1. Agnetis A, Rossi F, Smriglio S (2019) Some results on shop scheduling with S-precedence constraints among job tasks. Algorithms 12:1–12
2. Angel-Bello F, Martinez-Salazar I, Alvarez A (2013) Minimizing waiting times in a route design problem with multiple use of a single vehicle. J Electron Notes Discrete Math 41:269–276
3. Augerat P, Belenguer J, Benavent E, Corberan A, Naddef D, Rinaldi G (1995) Computational results with a branch and cut code for the capacitated vehicle routing problem. Tech. Rep. 949-M, Universit e Joseph Fourier, Grenoble, France
4. Azi N, Gendreau M, Potvin J-Y, Schneide M (2007) An exact algorithm for a single-vehicle routing problem with time windows and multiple routes. Eur J Oper Res 178:755–766
5. Barzanji R, Naderi B, Begen M (2020) Decomposition algorithms for the integrated process planning and scheduling problem. Omega 93:1–13
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献