Particle swarm optimization algorithm applied to scheduling problems

ScienceAsia

Volumn 35, Issue 1, 2009, Pages 89-94

  Pongchairerks, Pisut ^a  

^a THAMMASAT UNIVERSITY   (Thailand)

Author keywords

Job shop; Open shop

Indexed keywords

EID: 64549160335     PISSN: 15131874     EISSN: None     Source Type: Journal    
DOI: 10.2306/scienceasia1513-1874.2009.35.089     Document Type: Article

References (23)

1. Croce F, Tadei R, Volta G (1995) A genetic algorithm for the job shop problem. Comput Oper Res 22, 15-24.
2. Gen M, Cheng R (1997) Genetic A lgorithms and Engineering Design, John Wiley & Sons, New York.
3. Gen M, Tsujimura Y, Kubota E (1994) Solving jobshop scheduling problem using genetic algorithms. In: The 16th International Conference on Computers and Industrial Engineering, Japan, pp 576-9.
4. Prins C (2000) Competitive genetic algorifluns for the open-shop scheduling problem. Math Meth Oper Res 52,389-411.
5. Blum C (2005) Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling. Comput Oper Res 32, 1565-91.
6. Blum C, Roli A, Dorigo M (2001) The hyper-cube framework for ant colony optimization. In: Proceedings of the Fourth Meta-heuristics International Conference, Porto, pp 399-403.
7. Colorni A, Dorigo M, Maniezzo V, Trubian M (1994) Ant system for job-shop scheduling. Belg J Oper Res Statist Comput Sci 34, 39-53.
8. Udomsakdigool A, Kachitvichyanukul V (2008) Multiple colony ant algorithm for job-shop scheduling problem. Int J Prod Res 46, 4155-75.
9. Kennedy J, Eberhart RC, Shi Y (2001) Swarm Intelligence, Morgan Kaufmann, San Francisco.
10. Pongchairerks P, Kachitvichyanukul V (2005) A non-homogeneous particle swarm optimization with multiple social structures. In: Proceedings of International Conference on Simulation and Modeling, Thailand, A5-02.
11. Pongchairerks P, Kachitvichyanukul V (2006) Particle swarm optimization algorithm with multiple social learning structures. In: Proceedings of the 36th CIE Conference on Computers & Industrial Engineering, Taiwan, pp 1556-67.
12. Clerc M (2006) Particle Swarm Optimization. ISTE Ltd, California.
13. Bean JC (1994) Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6, 154-60.
14. Bierwirth C, Mattfeld DC (1999) Production scheduling and rescheduling with genetic algorithms. Evol Computt, 7, 1-17.
15. Storer RH, Wu SD, Vaccari R (1992) New search spaces for sequencing problems with application to job shop scheduling. Manag Sei 38, 1495-509.
16. Mattfeld DC, Bierwirth C (2004) An efficient genetic algorithm for job shop scheduling with tardiness objectives. Eur J Oper Res 155, 616-30.
17. Gonçalves JF, Mendes JJM, Resende MGC (2005) A hybrid genetic algorithm for the job shop scheduling problem. Eur J Oper Res 167, 77-95.
18. Brucker P, Schlie R (1990) Job-shop scheduling with multi-purpose machines. Computing 45, 369-75.
19. Veeramachaneni K, Peram T, Mohan C, Osadciw LA (2003) Optimization using particle swarms with near neighbor interactions. In: Genetic and Evolutionary Computation - GECCO 2003, Springer, Berlin, pp 110-21.
20. Fisher H, Thompson GL (1963) Probabilistic learning combinations of local job-shop scheduling rules. In: Muth JF, Thompson GL (eds) Industrial Scheduling, Prentice Hall, Englcwood Cliffs, pp 225-51.
21. Lawrence S (1984) Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Tech Rep, GSIA, Carnegie Mellon Univ.
22. Jurisch B (1992) Scheduling jobs in shops with multipurpose machines. PhD thesis, Universität Osnabrück.
23. Taillard ED (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64, 278-85.