Particle Swarm Optimization Algorithm for Integrated Lot-sizing and Scheduling in Flowshop Production Environment

Document Type : Research Paper

Authors

Department of Industrial Engineering, K.N. Toosi University of Technology, Tehran, I.R. Iran

Abstract

  Production planning and scheduling are the most important issues of the production industries, which have a considerable influence on the productivity of the production systems. Although, production planning and scheduling are in two different medium-term and short-term decision making levels, there are a very close relationship between them. Ignoring this important feature in production planning aggravates costs and reduces productivity of system. Accordingly, in this paper, scheduling constraints have been considered in production planning in order to take into account, the interconnection between these two levels
   The purpose of this paper is to study the multi-product and multi-period production systems in the flowshop environement so that the production and scheduling constraints are considered integrated. A more efficient mixed integer programming model with big bucket time approach is proposed to formulate the problem, which can simultaneously achieve a production plan and schedule and that is one of the main novelty of the paper. The objective function includes the cost of production, inventory, shortage and setups. Due to the high computational complexity, particle swarm optimization algorithm is proposed to solve the problem. To evaluate the efficiency of the algorithm, two mixed integer programming-based approaches with rolling horizon framework is proposed and the results are compared with each othre. . In addition, Taguchi method is used for tunning the parameters of implemented meta-heuristic.The presented algorithms explore the solution space for both lot-sizing and scheduling and find a combination of production plan and sequence that is feasible and close to optimum. Computational experiments are performed on randomly generated instances to show the efficiency of the solution methods. Computational experiments demonstrate that the performed methods have good-quality results for the test problems. Computational experiences show that the proposed algorithms can find good quality solution for the problem in a reasonable time. Also, the computational experiences confirm the efficiency of meta-heuristic against exact and heuristic methods. The average of objective value for PSO, heuristic 1 and heuristic 2 are 98.21, 104.20 and 108.29 (×103), respectively.

Keywords

References

1. Lasserre, J. B. (1992). “An integrated model for job-shop planning and scheduling.” Management Science, Vol. 38, No. 8, 1201–1211.
2. Anwar, M. F. and Nagi, R. (1997). “Integrated lot-sizing and scheduling for just-in-time production of complex assemblies with finite set-ups.” International Journal of Production Research, Vol. 35, 1447–1470.
3. Kim, H., Jeong, H. -I., and Park, J. (2008). “Integrated model for production planning and scheduling in a supply chain using benchmarked genetic algorithm.” International Journal of Advanced Manufacturing Technology, Vol. 39, 1207–1226.
4. Karimi, B., Fatemi Ghomi, S. M. T., and Wilson, J. M. (2003). “The capacitated lot sizing problem: A review of models and algorithms.” Omega, Vol. 31, No. 5, 365–378.
5. Drexl, A. and Kimms, A. (1997). “Lot sizing and scheduling, survey and extensions.” European Journal of Operational Research, Vol. 99, No. 2, 221–235.
6. Fleischmann, B. and Meyr, H. (1997). “The General Lotsizing and Scheduling Problem.” OR Spektrum, Vol. 19, No. 1, 11-21.
7. Clark, A. R. and Clark, S. J. (2000). “Rolling-horizon lot-sizing when setup times are sequence-dependent.” International Journal of Production Research, Vol. 38, No. 10, 2287–2308.
8. Buschkühl, L., Sahling, F., Helber, S., and Tempelmeier, H. (2010). “Dynamic capacitated lot-sizing problems: a classification and review of solution approaches.” OR Spectrum, Vol. 32, 231–261.
9. Kimms, A. (1996). “Multi-level, single-machine lotsizing and scheduling (with initial inventory).” European Journal of Operational Research, Vol. 89, No. 1, 86–99.
10. Kimms, A. and Drexl, A. (1998). “Some insights into proportional lotsizing and scheduling.” Journal of the Operational Research, Vol. 49, No. 11, 1196-1205.
11. Fandel, G. and Stammen-Hegene, C. (2006). “Simultaneous lot sizing and scheduling for multi-product multi-level production.” International Journal of Production Economics, Vol. 104, No. 2, 308–316.
12. Mohammadi, M., Fatemi Ghomi, S. M. T., Karimi, B., and Torabi, S. A. (2010). “Rolling-horizon and fix-and-relax heuristics for the multi-product multi-level capacitated lotsizing problem with sequence-dependent setups.” Journal of Intelligent Manufacturing, Vol. 21, 501–510.
13. Mohammadi, M., Karimi, B., Fatemi Ghomi, S. M. T., and Torabi, S. A. (2010). “A new algorithmic approach for capacitated lot-sizing problem in flow shops with sequence-dependent setups.” International Journal of Advanced Manufacturing Technology, Vol. 49, 201–211.
14. Mohammadi, M. (2010). “Integrating lotsizing, loading, and scheduling decisions in flexible flow shops.” International Journal of Advanced Manufacturing Technology, Vol. 50, 1165–1174.
15. Ramezanian, R., Saidi-Mehrabad, M., and Teimoury, E. (2013). “A mathematical model for integrating lot-sizing and scheduling problem in capacitated flow shop environments.” International Journal of Advanced Manufacturing Technology, Vol. 66, 347–361.
16. Merece, C. and Fonton, G. (2003). “MIP-based heuristics for capacitated lotsizing problems.” International Journal of 1 - Production Economics, Vol. 85, No. 1, 97–111.
17. Eberhart, R. and Kennedy, J. (1995). A New Optimizer Using Particles Swarm Theory. Proc. Sixth International Symposium on Micro Machine and Human Science (Nagoya, Japan), IEEE Service Center, Piscataway, NJ, 39-43.
18. Kennedy, J. and Eberhart, R. (1995). Particle Swarm Optimization. IEEE Conference on Neural Networks, (Perth, Australia), Piscataway, NJ, IV, 1942-1948.
19. Shi, Y. and Eberhart, R. C. (1998). A modified particle swarm optimizer. In Proceedings of the IEEE Congress on Evolutionary Computation, 69–73.
20. Chinneck, J. W. (2008). Feasibility and Infeasibility in Optimization: Algorithms and Computational Methods. Springer Science+Business Media, New York.
21. Pinedo, M. (2008). Scheduling: Theory, Algorithms and Systems, springer, 3th edition.
22. Nawaz, M., Enscore Jr, E., and Ham, I. (1983). “A heuristic algorithm for the m-machine, n job flowshop sequencing problem.” OMEGA International Journal Management Science, Vol. 11, 91-95.
23. Taguchi, G., Chowdhury, S., and Taguchi, S. (2000).  Robust engineering. McGraw-Hill, New York.
24. Jeff Wu, C. F. and Hamada, M. (2002). Experiments: Planning analysis and parameter design optimization. Wiley.
25. Phadke, M. S. (1989). Quality engineering using robust design. USA: Prentice-Hall.
Advances in Industrial Engineering
Volume 48, Issue 2 - Serial Number 2
October 2014
Pages 215-228

Files

Share

How to cite

Statistics