Application of Adaptive Particle Swarm Optimization to Bi - level Job - Shop Scheduling Problem

다국어 초록 (Multilingual Abstract)

This study presents an application of adaptive particle swarm optimization (APSO) to solving the bi-level job-shop scheduling problem (JSP). The test problem presented here is 10×10 JSP (ten jobs and ten machines) with tribottleneck machines formulated as a bi-level formulation. APSO is used to solve the test problem and the result is compared with the result solved by basic PSO. The results of the test problem show that the results from APSO are significantly different when compared with the result from basic PSO in terms of the upper level objective value and the iteration number in which the best solution is first identified, but there is no significant difference in the lower objective value. These results confirmed that the quality of solutions from APSO is better than the basic PSO. Moreover, APSO can be used directly on a new problem instance without the exercise to select parameters.

목차 (Table of Contents)

• ABSTRACT
• 1. INTRODUCTION
• 2. PRELIMINARIES
• 3. NUMERICAL ILLUSTRATION
• 4. CONCLUSION
• REFERENCES

참고문헌 (Reference)

1 Kasemset, C, "TOC based job-shop scheduling" Asian Institute of Technology 2009

2 Lin, F. R, "Scheduling printed circuit board production systems using the two-level scheduling approach" 16 (16): 129-149, 1997

3 Ueno, G, "Robust adaptive particle swarm optimization" 3915-3920, 2005

4 Kennedy, J, "Particle swarm optimization" 1942-1948, 1995

5 Arumugam, M. S, "On the improved performances of the particle swarm optimization algorithms with adaptive parameters, cross-over operators and root mean square (RMS)variants for computing optimal control of a class of hybrid systems" 8 (8): 324-336, 2008

6 Semnani, S. H, "New approach to multi-level processor scheduling" 19 (19): 335-346, 2010

7 Ai, T. J, "Dispersion and velocity indices for observing dynamic behavior of particle swarm optimization" 3264-3271, 2007

8 Voratas Kachitvichyanukul, "Comparison of Three Evolutionary Algorithms: GA, PSO, and DE" 대한산업공학회 11 (11): 215-223, 2012

9 Logendran, R, "Combined heuristics for bi-level group scheduling problems" 38 (38): 133-145, 1995

10 Kasemset, C, "Bi-level multi-objective mathematical model for job-shop scheduling: the application of Theory of Constraints" 48 (48): 6137-6154, 2010

11 Kasemset, C, "AsiaSim 2007" Springer 47-55, 2007

12 Kuo, R. J, "Application of particle swarm optimization algorithm for solving bilevel linear programming problem" 58 (58): 678-685, 2009

13 Zhang, G, "An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem" 56 (56): 1309-1318, 2009

14 Xia, W, "An effective hybrid optimization approach for multi-objective flexible jobshop scheduling problems" 48 (48): 409-425, 2005

15 Warisa Wisittipanich, "An Efficient PSO Algorithm for Finding Pareto-Frontier in Multi-Objective Job Shop Scheduling Problems" 대한산업공학회 12 (12): 151-160, 2013

16 Ai, T. J, "Adaptive particle swarm optimization algorithms" 460-469, 2008

17 Gao, Y, "Adaptive particle swarm optimization algorithm with genetic mutation operation" 211-215, 2007

18 Pratchayaborirak, T, "A two-stage PSO algorithm for job shop scheduling problem" 6 (6): 83-92, 2011

19 Pongchairerks, P, "A two-level particle swarm optimisation algorithm on job-shop scheduling problems" 4 (4): 390-411, 2009

20 Cheng, R, "A tutorial survey of job-shop scheduling problems using genetic algorithms : I. Representation" 30 (30): 983-997, 1996

21 Ai, T. J, "A study on adaptive particle swarm optimization for solving vehicle routing problems" 2008

22 Lian, Z, "A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan" 183 (183): 1008-1017, 2006

23 Chander, A, "A new social and momentum component adaptive PSO algorithm for image segmentation" 38 (38): 4998-5004, 2011

24 Rahimi-Vahed, A. R, "A multi-objective particle swarm for a flow shop scheduling problem" 13 (13): 79-102, 2007

25 Shi, Y, "A modified particle swarm optimizer" 69-73, 1998

26 Sha, D. Y, "A hybrid particle swarm optimization for job shop scheduling problem" 51 (51): 791-808, 2006

27 Kuo, R. J, "A hybrid of genetic algorithm and particle swarm optimization for solving bi-level linear programming problem: a case study on supply chain model" 35 (35): 6905-3917, 2011

28 Pezzella, F, "A genetic algorithm for the flexible job-shop scheduling problem" 35 (35): 3202-3212, 2008

29 Kimms A, "A genetic algorithm for multi-level, multi-machine lot sizing and scheduling" 26 (26): 829-848, 1999

30 Pan, Q. K, "A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem" 35 (35): 2807-2839, 2008

31 Lei, D, "A Pareto archive particle swarm optimization for multi-objective job shop scheduling" 54 (54): 960-971, 2008

32 Kasemset, C, "A PSObased procedure for a bi-level multi-objective TOCbased job-shop scheduling problem" 14 (14): 50-69, 2012