A discrete particle swarm optimization for lot-streaming flowshop scheduling problem

European Journal of Operational Research

Volumn 191, Issue 2, 2008, Pages 360-373

  Tseng, Chao Tang ^a   Liao, Ching Jong ^b  

^a CHAOYANG UNIVERSITY OF TECHNOLOGY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Lot streaming; Metaheuristic; Particle swarm optimization; Scheduling; Weighted earliness and tardiness

Indexed keywords

ALGORITHMS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

LOT STREAMING; METAHEURISTIC; PARTICLE SWARM OPTIMIZATION; WEIGHTED EARLINESS;

SCHEDULING;

EID: 43849110246     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.08.030     Document Type: Article

References (25)

1. Allahverdi A., and Al-Anzi F.S. A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application. Computers and Operations Research 33 (2006) 1056-1080
2. Baker K.R., and Pyke D.F. Solution procedures for the lot-streaming problem. Decision Sciences 21 (1990) 475-491
3. Bukchin J., Tzur M., and Jaffe M. Lot splitting to minimize average flow-time in a two-machine flow-shop. IIE Transactions 34 (2002) 953-970
4. Chang J.H., and Chiu H.N. A comprehensive review of lot streaming. International Journal of Production Research 43 (2005) 1515-1536
5. Clerc M. Discrete particle swarm optimization, illustrated by the traveling salesman problem. New Optimization Techniques in Engineering (2004), Springer, Heidelberg, Germany 219-239
6. Hansen P., and Mladenović N. Variable neighborhood search: Principles and applications. European Journal of Operational Research 130 (2001) 449-467
7. Kalir A.A., and Sarin S.C. A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots. Omega 29 (2001) 577-584
8. Kennedy, J., Eberhart, R.C., 1995. Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, Piscataway, NJ, pp. 1942-1948.
9. Kennedy, J., Eberhart, R.C., 1997. A discrete binary version of the particle swarm algorithm. In: Proceedings of the World Multiconference on Systemics, Cybernetics and Informatics, Piscatawary, NJ, pp. 4104-4109.
10. Kennedy J., Eberhart R.C., and Shi Y. Swarm Intelligence (2001), Morgan Kaufman, CA
11. Kropp D.H., and Smunt T.L. Optimal and heuristic models for lot splitting in a flow shop. Decision Sciences 21 (1990) 691-709
12. Liao C.J., Tseng C.T., and Luarn P. A discrete version of particle swarm optimization for flowshop scheduling problems. Computers and Operations Research 34 (2007) 3099-3111
13. Murata T., Ishibuchi H., and Tanaka H. Genetic algorithms for flowshop scheduling problems. Computers and Industrial Engineering 30 (1996) 1061-1071
14. Onwubolu G.C. Emerging Optimization Techniques in Production Planning and Control (2002), Imperial College Press, London
15. Potts C.N., and Baker K.R. Flow shop scheduling with lot streaming. Operations Research Letters 8 (1989) 297-303
16. Rameshkumar K., Suresh R.K., and Mohanasundaram K.M. Discrete particle swarm optimization (DPSO) algorithm for permutation flowshop scheduling to minimize makespan. Lecture Notes in Computer Science 3612 (2005) 572-581
17. Reiter S. A system for managing job shop production. The Journal of Business 34 (1966) 371-393
18. Tasgetiren, M.F., Sevkli, M., Liang, Y.C., Gencyilmaz, G., 2004a. Particle swarm optimization algorithm for single machine total weighted tardiness problem. In: Proceedings of the IEEE Congress on Evolutionary Computation, Portland, Oregon, pp. 1412-1419.
19. Tasgetiren, M.F., Liang, Y.C., Sevkli, M., Gencyilmaz, G., 2004b. Particle swarm optimization algorithm for makespan and maximum lateness minimization in permutation flowshop sequencing problem. In: Proceedings of the Fourth International Symposium on Intelligent Manufacturing Systems, Sakarya, Turkey, pp. 431-441.
20. Tasgetiren M.F., Liang Y.C., Sevkli M., and Gencyilmaz G. A particle swarm optimization algorithm for makespan and total flowtime minimization in permutation flowshop sequencing problem. European Journal of Operational Research 177 (2007) 1930-1947
21. Trietsch D., and Baker K.R. Basic techniques for lot streaming. Operations Research 41 (1993) 1065-1076
22. Van den Bergh F., and Engelbrecht A.P. Cooperative learning in neural network using particle swarm optimizers. South African Computer Journal 26 (2000) 84-90
23. Vickson R.G., and Alfredsson B.E. Two- and three-machine flow shop scheduling problems with equal sized transfer batches. International Journal of Production Research 30 (1992) 1551-1574
24. Yoon S.H., and Ventura J.A. Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling. Computers and Operations Research 29 (2002) 1301-1315
25. Yoon S.H., and Ventura J.A. An application of genetic algorithms to lot-streaming flow shop scheduling. IIE Transactions 34 (2002) 779-787