An agent-based parallel approach for the job shop scheduling problem with genetic algorithms

Mathematical and Computer Modelling

Volumn 52, Issue 11-12, 2010, Pages 1957-1965

  Asadzadeh, Leila ^a   Zamanifar, Kamran ^a  

^a UNIVERSITY OF ISFAHAN   (Iran)

Author keywords

Agents; Job shop scheduling problem; Multi agent systems; Parallel genetic algorithms

Indexed keywords

AGENT BASED; APPROXIMATE SOLUTION; EXACT SOLUTION; HIGH COSTS; INITIAL POPULATION; JOB SHOP SCHEDULING PROBLEMS; MACHINE SCHEDULING; META-HEURISTIC METHODS; NEAR-OPTIMAL SOLUTIONS; NP-HARD; OPTIMAL SOLUTIONS; PARALLEL GENETIC ALGORITHMS; PARALLELIZING; POLYNOMIAL-TIME;

GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; OPTIMAL SYSTEMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

MULTI AGENT SYSTEMS;

EID: 77956343994     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.mcm.2010.04.019     Document Type: Article

References (36)

1. A.S. Jain, S. Meeran, Deterministic job-shop scheduling: past, present and future, Department of Applied Physics and Electronic and Mechanical Engineering, University of Dundee, Dundee, Scotland, UK, 1998.
2. Carlier J., Pinson E. An algorithm for solving the job shop problem. Management Science 1989, 35(29):164-176.
3. Lageweg B.J., Lenstra J.K., Rinnooy Kan A.H.G. Job shop scheduling by implicit enumeration. Management Science 1977, 24:441-450.
4. Brucker P., Jurisch B., Sievers B. A branch and bound algorithm for job-shop scheduling problem. Discrete Applied Mathematics 1994, 49:105-127.
5. Kannan V.R., Ghosh S. Evaluation of the interaction between dispatching rules and truncation procedures in job-shop scheduling. International Journal of Production Research 1993, 31:1637-1654.
6. Vancheeswaran R., Townsend M.A. A two-stage heuristic procedure for scheduling job shops. Journal of Manufacturing Systems 1993, 12:315-325.
7. He Z., Yang T., Deal D.E. Multiple-pass heuristic rule for job scheduling with due dates. International Journal of Production Research 1993, 31:2677-2692.
8. Adams J., Balas E., Zawack D. The shifting bottleneck procedure for job shop scheduling. Management Science 1988, 34:391-401.
9. Nowicki E., Smutnicki C. A fast taboo search algorithm for the job-shop problem. Management Science 1996, 42(6):797-813.
10. Ponnambalam S.G., Aravindan P., Rajesh S.V. A tabu search algorithm for job shop scheduling. International Journal of Advanced Manufacturing Technology 2000, 16:765-771.
11. Laarhoven P.V., Aarts E., Lenstra J.K. Job shop scheduling by simulated annealing. Operations Research 1992, 40:113-125.
12. J.B. Chambers, Classical and flexible job shop scheduling by tabu search, Ph.D. Dissertation, University of Texas at Austin, Austin, TX, 1996.
13. M.E. Aydin, T.C. Fogarty, Simulated annealing with evolutionary processes in job shop scheduling, in: Evolutionary Methods for Design, Optimisation and Control, (Proceeding Of EUROGEN 2001, Athens, 19-21 Sept.) CIMNE, Barcelona, 2002.
14. Kolonko M. Some new results on simulated annealing applied to job shop scheduling problem. European Journal of Operational Research 1999, 113:123-136.
15. Satake T., Morikawa K., Takahashi K., Nakamura N. Simulated annealing approach for minimizing the makespan of the general job-shop. International Journal of Production Economics 1999, 60-61:515-522.
16. Croce F.D., Tadei R., Volta G. A genetic algorithm for the job shop problem. Computers and Operations Research 1995, 22:15-24.
17. Goncalves J.F., Mendes J.J.d.M., Resende M.G.C. A hybrid genetic algorithm for the job shop scheduling problem. European Journal of Operational Research 2005, 167:77-95.
18. Wang L., Zheng D.Z. A modified genetic algorithm for job shop scheduling. International Journal of Advanced Manufacturing Technology 2002, 72-76.
19. Mogaddam R.T., Jolai F., Vaziri F., Ahmed P.K., Azaron A. A hybrid method for solving stochastic job shop scheduling problems. Applied Mathematics and Computation 2005, 170:185-206.
20. Wang L., Zheng D.Z. An effective hybrid optimization strategy for job-shop scheduling problems. Computers & Operations Research 2001, 28:585-596.
21. Foo S.Y., Takefuji Y., Szu H. Scaling properties of neural networks for job shop scheduling. Neurocomputing 1995, 8(1):79-91.
22. Zhang J., Hu X., Tan X., Zhong J.H., Huang Q. Implementation of an ant colony optimization technique for job shop scheduling problem. Transactions of the Institute of Measurement and Control 2006, 28:93-108.
23. Huang K.L., Liao C.J. Ant colony optimization combined with taboo search for the job shop scheduling problem. Computers & Operations Research 2008, 35:1030-1046.
24. J. Montgomery, C. Fayad, S. Petrovic, Solution representation for job shop scheduling problems in ant colony optimization, Faculty of Information & Communication Technologies, Swinburne University of Technology, 2006.
25. M. Ventresca, B. Ombuki, Ant colony optimization for job shop scheduling problem, in: Proceeding of 8th IASTED International Conference on Artificial Intelligence and Soft Computing, ASC 2004, CDROM:451-152, 2004.
26. S. Petrovic, C. Fayad, A genetic algorithm for job shop scheduling with load balancing, School of Computer Science and Information Technology, University of Nottingham, Nottingham, 2005.
27. Rajakumar S., Arunachalam V.P., Selladurai V. Workflow balancing in parallel machine scheduling with precedence constraints using genetic algorithm. Journal of Manufacturing Technology Management 2006, 17:239-254.
28. Ombuki B.M., Ventresca M. Local search genetic algorithms for the job shop scheduling problem. Applied Intelligence 2004, 21:99-109.
29. S.C. Lin, E.D. Goodman, W.F. Punch, Investigating parallel genetic algorithms on job shop scheduling problems, Genetic Algorithm Research and Applications Group, State University of Michigan, Michigan, 1995.
30. Cheng R., Gen M., Tsujimura Y. A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: Hybrid genetic search strategies. Computers & Industrial Engineering 1999, 36:343-364.
31. Y. Chen, Z.Z. Li, Z.W. Wang, Multi-agent-based genetic algorithm for JSSP, in: Proceedings of the Third International Conference on Machine Learning and Cybernetics, 2004, pp. 267-270.
32. Bellifemine F., Poggi A., Rimassa G. Developing multi-agent systems with a FIPA-compliant agent framework. Software: Practice and Experience 2001, 31:103-128.
33. M. Gen, Y. Tsujimura, Genetic algorithms for solving multiprocessor scheduling problems, in: Proceeding of 1st Asia-Pacific Conference on Simulated Evolution and Learning, 1997, pp. 106-115.
34. Goldberg D.E. Genetic Algorithms in Search, Optimization and Machine Learning 1989, Addison-Wesley, MA.
35. D.E. Goldberg, R. Lingle, Alleles, loci, and the TSP, in: Proceeding of 1st International Conference on Genetic Algorithms, 1985, pp. 154-159.
36. D.C. Mattfeld, R.J.M. Vaessens, Job shop scheduling benchmarks, Available: OR Library online, (accessed 10.07.08). http://mscmga.ms.ic.ac.uk.