Monte-Carlo tree search for a reentrant scheduling problem

40th International Conference on Computers and Industrial Engineering: Soft Computing Techniques for Advanced Manufacturing and Service Systems, CIE40 2010

Volumn , Issue , 2010, Pages

  Matsumoto, Shimpei ^a   Hirosue, Noriaki ^b   Itonaga, Kyohei ^c   Ueno, Nobuyuki ^d   Ishii, Hiroaki ^e  

^a HIROSHIMA INSTITUTE OF TECHNOLOGY   (Japan)

^b KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

^c OITA NATIONAL COLLEGE OF TECHNOLOGY   (Japan)

^d PREFECTURAL UNIVERSITY OF HIROSHIMA   (Japan)

^e KWANSEI GAKUIN UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BEST FIRST SEARCH; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTER GO; EVALUATION FUNCTION; INFORMATION GAME; META HEURISTIC ALGORITHM; MONTE CARLO; NUMERICAL EXPERIMENTS; OBJECTIVE FUNCTIONS; PRACTICAL PROBLEMS; PSEUDO RANDOM; SCHEDULING PROBLEM; SEARCH SPACES; SIMULATION STRATEGIES; TREE SEARCH; TWO-PLAYER GAMES;

HEURISTIC ALGORITHMS; INDUSTRIAL ENGINEERING; SOFT COMPUTING;

COMBINATORIAL OPTIMIZATION;

EID: 78651429601     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCIE.2010.5668320     Document Type: Conference Paper

References (24)

1. B. Brügmann, "Monte Carlo Go, Technical report," Physics Department, Syracuse University, 1993.
2. D. Huang, T. Enkawa and M. Akiba, "Generation of a New Dispatching Rule for the Mean Tardiness Job Shop Scheduling Problem through the Application of Machine Learning Concepts", Journal of Japan Industrial Management Association, Vol.41(6), pp.383-389, 1991 (In Japanese).
3. G. Chaslot, M. Winands, J. Uiterwijk and H. Van der Herik, "Progressive Strategies for Monte Carlo Tree Search", Proc. of the 10th Joint Conference on Information Sciences, pp.655-661, 2007.
4. G. Vieira, J. Herrmann and E. Lin, "Analytical Models to Predict the Performance of Single-Machine System under Periodic and Event-Driven Rescheduling Strategies", International Journal of Production Research, Vol.38, No.8, pp.1899-1915, 2000!%
5. I. Sabuncuoglu and O. Kizililsik, "Reactive Scheduling in a Dynamic and Stochastic FMS Environment," International journal of production research, Vol.41, No. 17, pp.4211-4231, 2003.
6. Joseph Y-T.Leung, "Handbook of Scheduling Algorithums, Models, and Performance Analysis", CHAPMAN&HALL/CRC, 2004.
7. K. Abe and K. Ida, "Two Proposed Algorithms for Re-Entrant Flow Shop Problem", Transactions on Electronics, Information and Systems, Vol. 129(4), pp.720-725, 2009 (In Japanese).
8. K. Sakakibara, H. Tamaki, H. Murao and S. Kitamura, "Genetics-Based Machine Learning Approach for Flexible Shop Scheduling Problems: Rule Acquisition for Real-time Scheduling ", IPSJ Journal, Vol.45, No.2, pp.91-98 2004 (In Japanese).
9. L. Kocsis and Csaba Szepesvári, "Bandit Based Monte-Carlo Planning", Machine Learning: ECML 2006, Vol.4212, pp.282-293, 2006.
10. M. Sakuta, "Studies on Imperfect-Information Games," Operations Research, Vol.52, No.l, pp.27-34, 2007 (In Japanese).
11. M. Schadd, M. Winands, H. van den Herik and H. Aldewereld, "Addressing NP-Complete Puzzles with Monte-Carlo Methods." Proc. of the AISB 2008 Symposium on Logic and the Simulation of Interaction and Reasoning, Vol. 9, pp.55-61, 2008.
12. M. Winands, Y. Bjornsson and J. Saito, "Monte-Carlo Tree Search Solver," Computers and Games, Vol.5131, pp.25-36, 2008.
13. N. Honda, H. Ishii and T. Masuda, "Tree Based Algorithm for the Flow-shop Model to Maximize Number of Just-In-Time Jobs", Scienliae Malhematicae Japonicae, Vol.61(2), pp.371-378, 2005.
14. P. Brucker, "Scheduling Algorithms", Springer-Verlag, Berlin, 1998.
15. R. Coulom, "Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search," Computers and Games, Vol.4630, pp.72-83, 2007.
16. S. Fujii, H. Suwa and H. Morita, "An Acquisition of Scheduling Rules Based on Information of Task Location", IPSJ SIG Technical Report , Vol.95(4), pp.1-8 1995 (In Japanese).
17. S. Gelly and D. Silver, "Combining Online and Offline Knowledge in UCT," Proc. of the International Conference on Machine Learning, No.227, pp.273-280, 2007.
18. S. Gelly, Y. Wang, R. Munos and O. Teytaud, "Modification of UCT with Patterns in Monte-Carlo Go," Technical Report RR-6062, INRIA, 2006.
19. S. Matsumoto, N. Ueno, K. Okuhara and H. Ishii, "Business Process Analysis to Obtain Empirical Lot Sizing Rule in Printing Process", Proc. of 2008 IEEE Conference on Automation Science and Engineering, pp.59l-596, 2008.
20. S Matsumoto, N Ueno, K Okuhara and H Ishii, "Design of Knowledge-Based Scheduling Solution Based on Expert's Technical Knowledge in Printing Process and Proposal of its Improvement", International Journal of Innovative Computing, Information and Control, Vol.5, No.11(B), pp.4125-4143, 2009.
21. S. Noronha and V Sarma, "Knowledge-based approaches for scheduling problems: a survey", IEEE Transactions on Knowledge and Data Engineering, Vol.3(2), pp.160-171, 2002.
22. T. Biedl, E. Demaine, M. Demaine, R. Fleischer, L. Jacobsen and J Munro, "The Complexity of Clickomania", Proc. ofMSRI Workshop on Combinatorial Games, pp.389-404, 2002.
23. T. Eguchi, H. Kawai and F. Oba, "Bi-criteria Scheduling for Meeting Due-dates and Minimizing Setup Times Using the Mixture of a Genetic Algorithm and a Priority Rule: An Efficient Search Method by Changing the Characteristic of Priority rule", Journal of the Japan Society for Precision Engineering, Vol.72(3) pp.342-347 2006 (In Japanese).
24. T. Sakaguchi, Y. Tanimizu and N. Sugimura, "Genetic Algorithm Based Reactive Scheduling : 2nd Report, Modification of Production Schedule for Additional Jobs," Transactions of the Japan Society of Mechanical Engineers. C, Vol.71(711), pp.3299-3305, 2005 (In Japanese).