참고문헌 (56)

1. Adams, Joseph, Balas, Egon, Zawack, Daniel. The Shifting Bottleneck Procedure for Job Shop Scheduling. Management science, vol.34, no.3, 391-401.

   상세보기

2. Applegate, David, Cook, William. A Computational Study of the Job-Shop Scheduling Problem. ORSA journal on computing, vol.3, no.2, 149-156.

   상세보기

3. Aydin, M.Emin, Öztemel, Ercan. Dynamic job-shop scheduling using reinforcement learning agents. Robotics and autonomous systems, vol.33, no.2, 169-178.

   상세보기

4. Battaglia, Peter W., Jessica B. Hamrick, Victor Bapst, Alvaro Sanchez-Gonzalez, Vinicius Zambaldi, Mateusz Malinowski, Andrea Tacchetti, et al. 2018. “Relational Inductive Biases, Deep Learning, and Graph Networks.” arXiv preprint arXiv:1806.01261 . 

5. Baykasoğlu, Adil, Karaslan, Fatma S.. Solving comprehensive dynamic job shop scheduling problem by using a GRASP-based approach. International journal of production research, vol.55, no.11, 3308-3325.

   상세보기

6. 10.1007/978-1-4419-1306-7_1 

   

7. Chen, Ruey-Maw, Huang, Yueh-Min. Competitive neural network to solve scheduling problems. Neurocomputing, vol.37, no.1, 177-196.

   상세보기

8. Demirkol, Ebru, Mehta, Sanjay, Uzsoy, Reha. Benchmarks for shop scheduling problems. European journal of operational research, vol.109, no.1, 137-141.

   상세보기

9. Industrial Scheduling Fisher Henry. 225 1963 

10. International Journal of Information Technology and Intelligent Computing Gabel Thomas 14 24 4 2008 

11. Gabel, Thomas, Riedmiller, Martin. Distributed policy search reinforcement learning for job-shop scheduling tasks. International journal of production research, vol.50, no.1, 41-61.

    상세보기

12. Garey, M. R., Johnson, D. S., Sethi, Ravi. The Complexity of Flowshop and Jobshop Scheduling. Mathematics of operations research, vol.1, no.2, 117-129.

    상세보기

13. Geiger, Christopher D., Kempf, Karl G., Uzsoy, Reha. A Tabu search approach to scheduling an automated wet etch station. Journal of manufacturing systems, vol.16, no.2, 102-116.

    상세보기

14. Glorot, Xavier, Antoine Bordes, and Yoshua Bengio. 2011. “Deep Sparse Rectifier Neural Networks.” In Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics , 315-323. 

15. Google or tools. 2019. version 7.3. https://github.com/google/or-tools. 

16. Gupta, Amit Kumar, Sivakumar, Appa Iyer. Job shop scheduling techniques in semiconductor manufacturing. International journal of advanced manufacturing technology, vol.27, no.11, 1163-1169.

    상세보기

17. Hill, Ashley, Antonin Raffin, Maximilian Ernestus, Adam Gleave, Anssi Kanervisto, Rene Traore, Prafulla Dhariwal, et al. 2018. “Stable Baselines.” https://github.com/hill-a/stable-baselines. 

18. Holthaus, Oliver, Rajendran, Chandrasekharan. Efficient dispatching rules for scheduling in a job shop. International journal of production economics, vol.48, no.1, 87-105.

    상세보기

19. Kaempfer, Yoav, and Lior Wolf. 2018. “Learning the Multiple Traveling Salesmen Problem With Permutation Invariant Pooling Networks.” arXiv preprint arXiv:1803.09621 . 

20. Advances in Neural Information Processing Systems Khalil Elias 6348 30 2017 

21. Kingma, Diederik P., and Jimmy Ba. 2014. “Adam: A Method for Stochastic Optimization.” arXiv preprint arXiv:1412.6980 . 

22. Kool, Wouter, Herke van Hoof, and Max Welling. 2018. “Attention, Learn to Solve Routing Problems!” arXiv preprint arXiv:1803.08475 . 

23. Resouce Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques (supplement) Lawrence S. 1984 

24. Li, Zhuwen, Qifeng Chen, and Vladlen Koltun. 2018. “Combinatorial Optimization With Graph Convolutional Networks and Guided Tree Search.” In Advances in Neural Information Processing Systems , 539-548. 

25. Lin, Chun-Cheng, Deng, Der-Jiunn, Chih, Yen-Ling, Chiu, Hsin-Ting. Smart Manufacturing Scheduling With Edge Computing Using Multiclass Deep Q Network. IEEE transactions on industrial informatics, vol.15, no.7, 4276-4284.

    상세보기

26. Lomnicki, Z. A.. A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling Problem. OR, operational research quarterly, vol.16, no.1, 89-100.

    상세보기

27. Manne, Alan S.. On the Job-Shop Scheduling Problem. Operations research, vol.8, no.2, 219-223.

    상세보기

28. Mittal, Akash, Anuj Dhawan, Sourav Medya, Sayan Ranu, and Ambuj Singh. 2019. “Learning Heuristics Over Large Graphs Via Deep Reinforcement Learning.” arXiv preprint arXiv:1903.03332 . 

29. Mnih, Volodymyr, Koray Kavukcuoglu, David Silver, Alex Graves, Ioannis Antonoglou, Daan Wierstra, and Martin Riedmiller. 2013. “Playing Atari With Deep Reinforcement Learning.” arXiv preprint arXiv:1312.5602 . 

30. Ong, Chung Sin. 2013. “Hybrid Genetic Algorithm With Multi-Parents Recombination for Job Shop Scheduling Problems/Ong Chung Sin.” PhD thesis, University of Malaya. 

31. Ozturk, Gurkan, Bahadir, Ozan, Teymourifar, Aydin. Extracting priority rules for dynamic multi-objective flexible job shop scheduling problems using gene expression programming. International journal of production research, vol.57, no.10, 3121-3137.

    상세보기

32. Panwalkar, S. S., Iskander, Wafik. A Survey of Scheduling Rules. Operations research, vol.25, no.1, 45-61.

    상세보기

33. Energy Park Junyoung 115883 187 2019 10.1016/j.energy.2019.115883 

    상세보기

34. Pinedo, M. 2008. “Scheduling: Theory, Algorithms, and Systems Multi-Coloring”. 

35. 10.1609/aaai.v33i01.33014731 Prates, Marcelo, Pedro H. C. Avelar, Henrique Lemos, Luis C Lamb, and Moshe Y. Vardi. 2019. “Learning to Solve np-Complete Problems: A Graph Neural Network for Decision tsp.” In Proceedings of the AAAI Conference on Artificial Intelligence , Vol. 33, 4731-4738. 

    상세보기

36. Note ds Roy Bernard 9 1964 

37. Sanchez-Gonzalez, Alvaro, Nicolas Heess, Jost Tobias Springenberg, Josh Merel, Martin Riedmiller, Raia Hadsell, and Peter Battaglia. 2018. “Graph Networks as Learnable Physics Engines for Inference and Control.” arXiv preprint arXiv:1806.01242 . 

38. Schulman, John, Sergey Levine, Pieter Abbeel, Michael Jordan, and Philipp Moritz. 2015. “Trust Region Policy Optimization.” In International Conference on Machine Learning , 1889-1897. 

39. Schulman, John, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. 2017. “Proximal Policy Optimization Algorithms.” arXiv preprint arXiv:1707.06347 . 

40. Seo, Sungyong, and Yan Liu. 2019. “Differentiable Physics-Informed Graph Networks.” arXiv preprint arXiv:1902.02950 . 

41. Storer, Robert H., Wu, S. David, Vaccari, Renzo. New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling. Management science, vol.38, no.10, 1495-1509.

    상세보기

42. Reinforcement Learning: An Introduction Sutton Richard S 2018 

43. Sutton, Richard S., Precup, Doina, Singh, Satinder. Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning. Artificial intelligence, vol.112, no.1, 181-211.

    상세보기

44. Taillard, E.. Benchmarks for basic scheduling problems. European journal of operational research, vol.64, no.2, 278-285.

    상세보기

45. 10.1007/978-3-540-48584-1_4 

    

46. Tay, J.C., Ho, N.B.. Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Computers & industrial engineering, vol.54, no.3, 453-473.

    상세보기

47. van Hoorn, Jelke J.. The Current state of bounds on benchmark instances of the job-shop scheduling problem. Journal of scheduling, vol.21, no.1, 127-128.

    상세보기

48. International Conference on Learning Representations Wang Tingwu 2018 

49. Weckman, Gary R., Ganduri, Chandrasekhar V., Koonce, David A.. A neural network job-shop scheduler. Journal of intelligent manufacturing, vol.19, no.2, 191-201.

    상세보기

50. Willems, T. M., Brandts, L. E. M. W.. Implementing heuristics as an optimization criterion in neural networks for job-shop scheduling. Journal of intelligent manufacturing, vol.6, no.6, 377-387.

    상세보기

51. International conference on learning representations Xinyi Zhang 2018 

52. Xu, Keyulu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2018. “How Powerful are Graph Neural Networks?” arXiv preprint arXiv:1810.00826 . 

53. Yamada, Takeshi. 2003. “Studies on Metaheuristics for Jobshop and Flowshop Scheduling Problems”. 

54. Yamada, Takeshi, and Ryohei Nakano. 1992. “A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems.” In PPSN , Vol. 2, 281-290. 

55. Yang, Zhilin, Jake Zhao, Bhuwan Dhingra, Kaiming He, William W. Cohen, Ruslan Salakhutdinov, and Yann LeCun. 2018. “Glomo: Unsupervisedly Learned Relational Graphs as Transferable Representations.” arXiv preprint arXiv:1806.05662 . 

56. Yim, Seong Jin; Lee, Doo Yong etc. "Scheduling cluster tools in wafer fabrication using candidate list and simulated annealing." Journal of intelligent manufacturing, v.10 no.6 (1999), pp. 531-540, doi:10.1023/A:1008904604531.

    

활용도 Top5 논문

더보기

해당 논문의 주제분야에서 활용도가 높은 상위 5개 콘텐츠를 보여줍니다.
더보기 버튼을 클릭하시면 더 많은 관련자료를 살펴볼 수 있습니다.