Fetching the paper…
Reading the bibliography…
There hardly exists a general solver that is efficient for scheduling problems due to their diversity and complexity.
R. Bellman, “Dynamic programming,” Science , vol. 153, no. 3731, pp. 34–37, 1966
1966
Earlier work this paper cites.
J. Bracken and J. T. McGill, “Mathematical programs with optimization problems in the constraints,” Operations Research , vol. 21, no. 1, pp. 37–44, 1973
1973
Earlier work this paper cites.
L. N. Vicente and P. H. Calamai, “Bilevel and multilevel programming: A bibliography review,” Journal of Global optimization , vol. 5, no. 3, pp. 291–306, 1994
1994
Earlier work this paper cites.
L. M. Gambardella and M. Dorigo, “Ant-q: A reinforcement learning approach to the traveling salesman problem,” in Machine Learning Proceedings 1995 . Elsevier, 1995, pp. 252–260
1995
Earlier work this paper cites.
G. Verfaillie, M. Lemaître, and T. Schiex, “Russian doll search for solving constraint optimization problems,” in AAAI/IAAI, Vol. 1 , 1996, pp. 181–187
1996
Earlier work this paper cites.
D. Bertsimas and J. N. Tsitsiklis, Introduction to linear optimization . Athena Scientific Belmont, MA, 1997, vol. 6
1997
Earlier work this paper cites.
W. J. Wolfe and S. E. Sorensen, “Three scheduling algorithms applied to the earth observing systems domain,” Management Science , vol. 46, no. 1, pp. 148–166, 2000
2000
Earlier work this paper cites.
A. Jones, L. C. Rabelo, and A. T. Sharawi, “Survey of job shop scheduling techniques,” Wiley encyclopedia of electrical and electronics engineering , 2001
2001
Earlier work this paper cites.
O. Bräysy and M. Gendreau, “Tabu search heuristics for the vehicle routing problem with time windows,” Top , vol. 10, no. 2, pp. 211–237, 2002
2002
Earlier work this paper cites.
Y. Wei and M. Zhao, “A reinforcement learning-based approach to dynamic job-shop scheduling,” Acta Automatica Sinica , vol. 31, no. 5, p. 765, 2005
2005
Earlier work this paper cites.
P. Baptiste, P. Laborie, C. Le Pape, and W. Nuijten, “Constraint-based scheduling and planning,” in Foundations of artificial intelligence . Elsevier, 2006, vol. 2, pp. 761–799
2006
Earlier work this paper cites.
C.-C. Tsai and S. H. Li, “A two-stage modeling with genetic algorithms for the nurse scheduling problem,” Expert Systems with Applications , vol. 36, no. 5, pp. 9506–9512, 2009
2009
Earlier work this paper cites.
S. Hartmann and D. Briskorn, “A survey of variants and extensions of the resource-constrained project scheduling problem,” European Journal of operational research , vol. 207, no. 1, pp. 1–14, 2010
2010
Earlier work this paper cites.
H. Kona, A. Burde, and D. Zanwar, “A review of traveling salesman problem with time window constraint,” IJIRST-International Journal for Innovative Research in Science & Technology , vol. 2, 2015
2015
Earlier work this paper cites.
A. Parisio and C. N. Jones, “A two-stage stochastic programming approach to employee scheduling in retail outlets with uncertain demand,” Omega , vol. 53, pp. 97–103, 2015
2015
Earlier work this paper cites.
G. Wu, W. Pedrycz, H. Li, M. Ma, and J. Liu, “Coordinated planning of heterogeneous earth observation resources,” IEEE Transactions on Systems, Man, and Cybernetics: Systems , vol. 46, no. 1, pp. 109–125, 2015
2015
Cited alongside, same era.
H. Dashti, A. J. Conejo, R. Jiang, and J. Wang, “Weekly two-stage robust generation scheduling for hydrothermal power systems,” IEEE Transactions on Power Systems , vol. 31, no. 6, pp. 4554–4564, 2016
2016
Cited alongside, same era.
J. Lu, J. Han, Y. Hu, and G. Zhang, “Multilevel decision-making: A survey,” Information Sciences , vol. 346, pp. 463–487, 2016
2016
Cited alongside, same era.
J. Turner, Q. Meng, G. Schaefer, A. Whitbrook, and A. Soltoggio, “Distributed task rescheduling with time constraints for the optimization of total task allocations in a multirobot system,” IEEE transactions on cybernetics , vol. 48, no. 9, pp. 2583–2597, 2017
2017
Cited alongside, same era.
H. Qiu, B. Zhao, W. Gu, and R. Bo, “Bi-level two-stage robust optimal scheduling for ac/dc hybrid multi-microgrids,” IEEE Transactions on Smart Grid , vol. 9, no. 5, pp. 5455–5466, 2018
2018
Later among the works it cites.
R. Václavík, A. Novák, P. Šøucha, and Z. Hanzálek, “Accelerating the branch-and-price algorithm using machine learning,” European Journal of Operational Research , vol. 271, no. 3, pp. 1055–1069, 2018
2018
Later among the works it cites.
M. Nazari, A. Oroojlooy, L. Snyder, and M. Takác, “Reinforcement learning for solving the vehicle routing problem,” in Advances in Neural Information Processing Systems , 2018, pp. 9839–9849
2018
Later among the works it cites.
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
B. Deng, C. Jiang, L. Kuang, S. Guo, J. Lu, and S. Zhao, “Two-phase task scheduling in data relay satellite systems,” IEEE Transactions on Vehicular Technology , vol. 67, no. 2, pp. 1782–1793, 2017
2017
Cited alongside, same era.
F. Wu and R. Sioshansi, “A two-stage stochastic optimization model for scheduling electric vehicle charging loads to relieve distribution-system constraints,” Transportation Research Part B: Methodological , vol. 102, pp. 55–82, 2017
2017
Cited alongside, same era.
X. Chu, Y. Chen, and L. Xing, “A branch and bound algorithm for agile earth observation satellite scheduling,” Discrete Dynamics in Nature and Society , vol. 2017, 2017
2017
Cited alongside, same era.
Y. Xiao and A. Konak, “A genetic algorithm with exact dynamic programming for the green vehicle routing & scheduling problem,” Journal of Cleaner Production , vol. 167, pp. 1450–1463, 2017
2017
Cited alongside, same era.
X. Liu, G. Laporte, Y. Chen, and R. He, “An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time,” Computers & Operations Research , vol. 86, pp. 41–53, 2017
2017
Cited alongside, same era.
E. Khalil, H. Dai, Y. Zhang, B. Dilkina, and L. Song, “Learning combinatorial optimization algorithms over graphs,” in Advances in Neural Information Processing Systems , 2017, pp. 6348–6358
2017
Cited alongside, same era.
K. Luo, H. Wang, Y. Li, and Q. Li, “High-performance technique for satellite range scheduling,” Computers & Operations Research , vol. 85, pp. 12–21, 2017
2017
Cited alongside, same era.
B. Ji, X. Yuan, and Y. Yuan, “A hybrid intelligent approach for co-scheduling of cascaded locks with multiple chambers,” IEEE transactions on cybernetics , vol. 49, no. 4, pp. 1236–1248, 2018
2018
Cited alongside, same era.
T. T. Nguyen, N. D. Nguyen, and S. Nahavandi, “Deep reinforcement learning for multi-agent systems: A review of challenges,” Solutions and Applications , 2018
2018
Later among the works it cites.
Y. Du, T. Wang, B. Xin, L. Wang, Y. Chen, and L. Xing, “A data-driven parallel scheduling approach for multiple agile earth observation satellites,” IEEE Transactions on Evolutionary Computation , 2019
2019
Later among the works it cites.
H. Lu, X. Zhang, and S. Yang, “A learning-based iterative method for solving vehicle routing problems,” in International Conference on Learning Representations , 2019
2019
Later among the works it cites.
Y. Wang, Z.-Y. Ru, K. Wang, and P.-Q. Huang, “Joint deployment and task scheduling optimization for large-scale mobile users in multi-uav-enabled mobile edge computing,” IEEE Transactions on Cybernetics , 2019
2019
Later among the works it cites.
A. Dixit, A. Mishra, and A. Shukla, “Vehicle routing problem with time windows using meta-heuristic algorithms: a survey,” in Harmony Search and Nature Inspired Optimization Algorithms . Springer, 2019, pp. 539–546
2019
Later among the works it cites.
Y. He, Y. Chen, J. Lu, C. Chen, and G. Wu, “Scheduling multiple agile earth observation satellites with an edge computing framework and a constructive heuristic algorithm,” Journal of Systems Architecture , vol. 95, pp. 55–66, 2019
2019
Later among the works it cites.
S. Mitrovic-Minic, D. Thomson, J. Berger, and J. Secker, “Collection planning and scheduling for multiple heterogeneous satellite missions: Survey, optimization problem, and mathematical programming formulation,” in Modeling and Optimization in Space Engineering . Springer, 2019, pp. 271–305
2019
Later among the works it cites.
2019
Later among the works it cites.
K. Li, T. Zhang, and R. Wang, “Deep reinforcement learning for multiobjective optimization,” IEEE Transactions on Cybernetics , 2020
2020
Later among the works it cites.
M. Goerigk, A. Kasperski, and P. Zieliński, “Two-stage combinatorial optimization problems under risk,” Theoretical Computer Science , vol. 804, pp. 29–45, 2020
2020
Later among the works it cites.