Self-Optimization module for Scheduling using Case-based Reasoning

Applied Soft Computing Journal

Volumn 13, Issue 3, 2013, Pages 1419-1432

  Pereira, I ^a   Madureira, A ^a  

^a INSTITUTE OF ENGINEERING   (Portugal)

Author keywords

Autonomic Computing; Case based Reasoning; Learning; Meta heuristics; Multi Agent Systems; Scheduling

Indexed keywords

AUTONOMOUS AGENTS; HEURISTIC ALGORITHMS; MULTI AGENT SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

AUTONOMIC COMPUTING; COMPUTATIONAL STUDIES; DYNAMIC SCHEDULING PROBLEMS; LEARNING; LITERATURE REVIEWS; META HEURISTICS; PARAMETERS SETTING; QUALITY OF SOLUTION;

CASE BASED REASONING;

EID: 84881661197     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2012.02.009     Document Type: Article

References (84)

1. P. Horn, Autonomic Computing IBM's Perspective on the State of Information Technology, IBM Research, 2001.
2. J. Kephart, D. Chess, The vision of autonomic computing, Computer Magazine (January) (2003).
3. E. Plaza, J.L. Arcos, F. Martin, Cooperative case-based reasoning, in: G. Weiss (Ed.), Distributed Artificial Intelligence Meets Machine Learning, Lecture Notes in Artificial Intelligence, Springer, 1996.
4. T. Gonzalez, Handbook of Approximation Algorithms and Metaheuristics, Chapman&Hall/Crc Computer and Information Science Series, 2007.
5. H.Md. Azamathulla, F.-C. Wu, A.Ab. Ghani, S.M. Narulkar, N.A. Zakaria, C.K. Chang, Comparison between genetic algorithm and linear programming approach for real time operation, Journal of Hydro-environment Research 2 (3) (2008) 172-181.
6. H.Md. Azamathulla, A.Ab. Ghani, Genetic programming to predict river pipeline scour, ASCE, Journal of Pipeline System and Engineering Practice 1 (3) (2010) 127-132.
7. Z. Ahmad, H.Md. Azamathulla, N.A. Zakaria, ANFIS-based approach forthe estimation of transverse mixing coefficient, IWA-Water Science & Technology 63 (5)(2011)1004-1009.
8. K.Y. Chan, M.E. Aydin, T.C. Fogarty, Main effect fine-tuning of the mutation operator and the neighbourhood function for uncapacitated facility location problems, Soft Computing 10 (11) (2006).
9. K.Y. Chan, C.K. Kwong, T.S. Dillon, Y.C. Tsim, Reducing overfitting in manufacturing process modeling using a backward elimination based genetic programming, Applied Soft Computing 11 (2) (2011) 1648-1656.
10. K.Y. Chan, T.S. Dillon, C.K. Kwong, Modeling of a liquid epoxy molding process using a particle swarm optimization-based fuzzy regression approach, IEEE Transactions on Industrial Informatics 7 (1) (2011) 148-158.
11. G. Beddoe, S. Petrovic, J. Li, A hybrid metaheuristic case-based reasoning system for nurse rostering, Journal of Scheduling 12 (2) (2009) 99-119.
12. K.R. Baker, D. Trietsch, Principles of Sequencing and Scheduling, John Wiley & Sons, Inc., 2009.
13. M. Pinedo, Scheduling: Theory, Algorithms, and Systems, Fourth edition, Springer, 2012.
14. H. Aytug, M.A. Lawley, K. McKay, S. Mohan, R. Uzsoy, Executing production schedules in the face of uncertainties: a review and some future directions, European Journal of Operational Research 16 (1) (2005) 86-110.
15. L. Monostori, J. Váncza, S. Kumara, Agent based systems for manufacturing, CIRP Annals-Manufacturing Technology 55 (2) (2006) 697-720.
16. A. Madureira, Meta-heuristics application to scheduling in dynamic environments of discrete manufacturing, Ph.D. Dissertation, University of Minho, Braga, Portugal, 2003 (in Portuguese).
17. M. Parashar, S. Hariri, Autonomic Computing: Concepts, Infrastructure, and Applications, CRC Press, 2006.
18. S. Whiteson, P. Stone, Towards autonomic computing: adaptive job routing and scheduling, in: Proceedings of the 16th Conference on Innovative applications of Artificial Intelligence (IAAI'04), 2004, pp. 916-922.
19. J. Abawajy, Autonomic job scheduling policy for grid computing, Lecture Notes in Computer Science 3516 (2005) 213-220.
20. K. Ross, N. Bambos, Job scheduling for maximal throughput in autonomic computing systems, in: International Workshop on SelfOrganizing Systems, 2006.
21. A. Madureira, I. Pereira, Self-Optimization for Dynamic Scheduling in Manufacturing Systems, Technological Developments in Networking, Education and Automation, Springer, Netherlands, 2010, pp. 421-426.
22. C. Blum, A. Roli, Metaheuristics in combinatorial optimization: overview and conceptual comparison, ACM Computing Surveys 35 (2003) 268-308.
23. F. Glover, Future paths for integer prog. and links to artificial intelligence, Computers & Operations Research 5 (1986) 533-549.
24. G. Vilcot, J.-C. Billaut, A tabu search and a genetic algorithm for solving abicri-teria general job shop scheduling problem, European Journal of Operational Research 190 (2) (2008)398-411.
25. X. Wang, L. Tang, A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers, Computers & Operations Research 36 (3) (2009).
26. J.-Q. Li, Q.-K. Pan, Y.C. Liang, An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems, Computers & Industrial Engineering 59 (4) (2010) 647-662.
27. J.-Q. Li, Q.-K. Pan, N. Suganthan, T.J. Chua, A hybrid tabu search algorithm with an efficient neighborhood structure forthe flexible job shop scheduling problem, The International Journal of Advanced Manufacturing Technology 52 (2011)683-697.
28. S. Kirkpatrick, CD. Gelatt, M.P. Vecchi, Optimization by simulated annealing, Science 220 (4598) (1983) 671-680.
29. V. Cerny, A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm, Journal of Optimization Theory and Applications 45 (1985)41-51.
30. S.-W. Lin, J. Gupta, K.-C. Ying, Z.-J. Lee, Using simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup times, International Journal of Production Research 47 (12) (2009)3205-3217.
31. P.-H. Chen, S.M. Shahandashti, Hybrid of genetic algorithm and simulated annealing for multiple project scheduling with multiple resource constraints, Automation in Construction 18 (4) (2009) 434-443.
32. B. Naderi, R. Tavakkoli-Moghaddam, M. Khalili, Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan, Knowledge-Based Systems 23 (2) (2010) 77-85.
33. R. Zhang, C. Wu, A hybrid immune simulated annealing algorithm forthe job shop scheduling problem, Applied Soft Computing 10 (2010) 79-89.
34. J.H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan, 1975.
35. C. Darwin, On the Origins of Species by Means of Natural Selection, or the Preservation of Favoured Races in the Struggle of Life, 1859.
36. D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, 1989.
37. H. Zhou, W. Cheung, L. Leung, Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm, European Journal of Operational Research 194 (3) (2009) 637-649.
38. J.J.M. Mendes, J.F. Goncalves, M.G.C. Resende, A random key based genetic algorithm forthe resource constrained project scheduling problem, Computers & Operations Research36 (2009) 92-109.
39. L. De Giovanni, F. Pezzella, An improved genetic algorithm forthe distributed and flexible job-shop scheduling problem, European Journal of Operational Research 200 (2) (2010) 395-408.
40. D. Ouelhadj, S. Petrovic, A survey of dynamic scheduling in manufacturing systems, Journal of Scheduling (2008).
41. V. Maniezzo, L.M. Gambardella, F. De Luigi, Ant colony optimization, in: G.C. Onwubolu, B.V. Babu (Eds.), New Optimization Techniques in Engineering, Springer, 2004, pp. 101-117.
42. M. Dorigo, V. Maniezzo, A. Colorni, The ant system: an autocatalytic optimizing, Technical Report, TR91-016, Politecnico di Milano, 1991.
43. Z. Haipeng, G. Mitsuo, F. Shigeru, K.K. Woo, Hybrid ant colony optimization for job-shop scheduling problem, Faji Shisutemu Shinpojiumu Koen Ronbunshu 20 (2004)304-305.
44. M. Yoshikawa, H. Terai, A hybrid ant colony optimization technique for job-shop scheduling problems, in: Proceedings of the Fourth International Conference on Software Engineering Research, Management and Applications (SERA'06), 2006.
45. L.-N. Xing, Y.-W. Chen, P. Wang, Q.-S. Zhao, J. Xiong, A knowledge-based ant colony optimization for flexible job shop scheduling problems, Applied Soft Computing 10 (3) (2010) 888-896.
46. B. Yagmahan, M. Yenisey, A multi-objective ant colony system algorithm for flow shop scheduling problem, Expert Systems with Applications 37 (2) (2010) 1361-1368.
47. W. Xiang, H.P. Lee, Ant colony intelligence in multi-agent dynamic manufacturing scheduling, Engineering Applications of Artificial Intelligence 21 (2008) 73-85.
48. J. Kennedy, R. Eberhart, Particle swarm optimization, in: Procedures of the IEEE International Conference on Neural Networks, 1995.
49. H. Liu, A. Abraham, O. Choi, S.H. Moon, Variable neighborhood particle swarm optimization for multi-objective flexible job-shop scheduling problems, in: 6th international Conference, SEAL 2006, Springer, China, 2006.
50. P. Pongchairerks, V. Kachitvichyanukul, A particle swarm optimization algorithm on job-shop scheduling problems with multi-purpose machines, Asia-Pacific Journal of Operational Research (APJOR) 26 (2) (2009) 161-184.
51. D.Y. Sha, C. Hsu, A hybrid particle swarm optimization for job shop scheduling problem, Computers & Industrial Engineering 51 (4) (2006) 791-808.
52. G.G. Yen, B. Ivers, Job shop scheduling optimization through multiple independent particle swarms, International Journal of Intelligent Computing and Cybernetics 2 (1) (2009) 5-33.
53. H. Liu, A. Abraham, A.E. Hassanien, Scheduling jobs on computational grids using a fuzzy particle swarm optimization algorithm, Future Generation Computer Systems 26 (8)(2010)1336-1343.
54. D. Karaboga, An Idea Based On Honey Bee Swarm For Numerical Optimization, Technical Report-TR06(Erciyes University, Engineering Faculty, Computer Engineering Department), 2005.
55. P. Pansuwan, N. Rukwong, P. Pongcharoen, Identifying Optimum Artificial Bee Colony (ABC) Algorithm's Parameters for Scheduling the Manufacture and Assembly of Complex Products, in: Second International Conference on Computer and Network Technology (ICCNT), 2010, pp. 339-343.
56. R. Xiao, T. Chen, Enhancing ABC Optimization with Ai-Net Algorithm for solving project scheduling problem, in: Seventh International Conference on Natural Computation (ICNC), vol. 3, 2011, pp. 1284-1288.
57. G. Zhou, L. Wang, Y. Xu, S. Wang, An effective artificial bee colony algorithm for multi-objective flexible job-shop scheduling problem, in: D.-S. Huang, Y. Gan, P. Gupta, M.M. Gromiha(Eds.), 'ICIC (2)', Springer, 2011, pp. 1-8.
58. A. Banharnsakun, B. Sirinaovakul, T. Achalakul, Job shop scheduling with the best-so-far ABC, Engineering Applications of Artificial Intelligence (2011).
59. L. Panait, S. Luke, Cooperative multi-agent learning: the state of the art, Autonomous Agents and Multi-Agent Systems (2005) 387-434.
60. F. Zambonelli, H. Parunak, Towards a paradigm change in computer science and software engineering: a synthesis, The Knowledge Engineering Review 18 (4) (2004).
61. M. Luck, P. McBurney, O. Shehory, S. Willmott, Agent Technology: Computing as Interaction (A Roadmap for Agent Based Computing), 2005.
62. W. Shen, D.H. Norrie, Agent based systems for intelligent manufacturing: a state of the art survey, International Journal of Knowledge and Information Systems 1 (2) (1999) 129-156.
63. W. Shen, D.H. Norrie, J.P.A. Barthes, Multi-agent Systems for Concurrent Intelligent Design and Manufacturing, Taylor & Francis, London, 2001.
64. T.C.E. Cheng, C.T. Ng, J.J. Yuan, Multi-agent scheduling on a single machine with max-form criteria, European Journal of Operational Research 188 (2) (2008) 603-609.
65. K. Lee, B.C. Choi, J. Leung, M. Pinedo, Approximation algorithms for multi-agent scheduling to minimize total weighted completion time, Information Processing Letters 109 (16) (2009) 913-917.
66. J. Leung, M. Pinedo, G. Wan, Competitive two-agent scheduling and its applications, Operations Research 58 (2) (2010) 458-469.
67. A. Madureira, I. Pereira, N. Sousa, P. Ávila, J. Bastos, Scheduling a Cutting and Treatment Stainless Steel Sheet Line with Self-Management Capabilities, Computational Intelligence for Engineering Systems: Emergent Applications, Springer, 2011.
68. J. Kolodner, Case-Based Reasoning, Morgan Kaufmann Publishers Inc, 1993.
69. S. Petrovic, Y. Yang, M. Dror, Case-based selection of initialisation heuristics for metaheuristic examination timetabling, Expert Systems with Applications 33 (2007)772-785.
70. A. Aamodt, E. Plaza, Case-based reasoning: foundational issues, methodological variations, and system approaches, Artificial Intelligence Communications 7 (1994)39-52.
71. E.K. Burke, B.L. MacCarthy, S. Petrovic, R. Qu, Knowledge Discovery in a Hyper-Heuristic for Course Timetabling Using Case-Based Reasoning PATAT 2002, 2002.
72. S. Oman, P. Cunningham, Using case retrieval to seed genetic algorithms, International Journal of Computational Intelligence and Applications (2001) 71-82.
73. E. Xia, I. Jurisica, J. Waterhouse, V. Sloan, Runtime estimation using the case-based reasoning approach for scheduling in a grid environment, in: Proceedings of ICCBR'2010, 2010, pp. 525-539.
74. A. Madureira, I. Pereira, N. Sousa, Collective intelligence on dynamic manufacturing scheduling optimization, in: Proceedings of the IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA 2010), Liverpool, 2010, pp. 1693-1697.
75. A. Madureira, N. Sousa, I. Pereira, Negotiation mechanism for self-organized scheduling system, in: Third World Congress on Nature and Biologically Inspired Computing (NaBIC), 2011, pp. 291-296.
76. B. Horling, V. Lesser, A survey of multi-agent organizational paradigms, Knowledge Engineering Review 19 (4) (2004) 281-316
77. OR-Library, http://people.brunel.ac.uk/∼mastjjb/jeb/info.html.
78. J. Adams, E. Balas, D. Zawack, The shifting bottleneck procedure for job shop scheduling, Management Science 34 (1988) 391-401.
79. H. Fisher, G.L. Thompson, Probabilistic learning combinations of local job-shop scheduling rules, in: J.F. Muth, G.L Thompson (Eds.), Industrial Scheduling, Prentice Hall, 1963, pp. 225-251.
80. S. Lawrence, Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques (Supplement), Graduate School of Industrial Administration, Carnegie-Mellon University, 1984.
81. D. Applegate, W. Cook, A computational study of the job-shop scheduling instance, ORSA Journal on Computing 3 (1991) 149-156.
82. R.H. Storer, S.D. Wu, R. Vaccari, New search spaces for sequencing instances with application to job shop scheduling, Management Science 38 (1992) 1495-1509.
83. T. Yamada, R. Nakano, A genetic algorithm applicable to large-scale job-shop instances, in: R. Manner, B. Manderick (Eds.), Parallel Instance Solving from Nature 2, North-Holland, Amsterdam, 1992, pp. 281-290.
84. A. Madureira, I. Pereira, N. Sousa, Self-organization for Scheduling in Agile Manufacturing, in: Proceedings of the 10th IEEE International Conference on Cybernetic Intelligent Systems, London, 2011, pp. 38-43.