Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in Small and Medium Enterprises
- 583 Downloads
Scheduling problems are naturally dynamic. Increasing flexibility will help solve bottleneck issues, increase production, and improve performance and competitive advantage of Small Medium Enterprises (SMEs). Maximum make span, as well as the average workflow time and latency time of parts are considered the objectives of scheduling, which are compatible with the philosophy of on-time production and supply chain management goals. In this study, these objectives were selected to optimize the resource utilization, minimize inventory turnover, and improve commitment to customers; simultaneously controlling these objectives improved system performance. In the job-shop scheduling problem considered in this paper, the three objectives were to find the best total weight of the objectives, maximize the number of reserved jobs and improve job-shop performance. To realize these targets, a multi-parametric objective function was introduced with dynamic and flexible parameters. The other key accomplishment is the development of a new method called TIME_GELS that uses the gravitational emulation local search algorithm (GELS) for solving the multi-objective flexible dynamic job-shop scheduling problem. The proposed algorithm used two of the four parameters, namely velocity and gravity. The searching agents in this algorithm are a set of masses that interact with each other based on Newton’s laws of gravity and motion. The results of the proposed method are presented for slight, mediocre and complete flexibility stages. These provided average improvements of 6.61, 6.5 and 6.54 %. The results supported the efficiency of the proposed method for solving the job-shop scheduling problem particularly in improving SME’s productivity.
KeywordsFlexible job-shop Scheduling Makespan GELS Algorithm Newton’s law Small Medium Enterprises
This research was supported financially by the University of Malaya Grant (no. RG316-14AFR).
- Bagrezai, A., Makki, S. V. A.-D., & Rostami, A. S. (2013). A new energy consumption algorithm with active sensor selection using GELS in target coverage WSN. International Journal of Computer Science Issues, 10(4), 11–18.Google Scholar
- Baker, K. R. (1974). Introduction to sequencing and scheduling. New York: Wiley.Google Scholar
- Balachandar, S. R., & Kannan, K. (2010). A meta-heuristic algorithm for Set covering problem based on gravity. International Journal of Computational and Mathematical Sciences, 4, 223–228.Google Scholar
- Bennett, K. P., & Parrado-Hernández, E. (2006). The interplay of optimization and machine learning research. Journal of Machine Learning Research, 7, 1265–1281.Google Scholar
- Chunlin, L., Xiu, Z. J., & Layuan, L. (2009). Resource scheduling with conflicting objectives in grid environments: Model and evaluation. Journal of Network and Computer Applications, 32(3), 760–769.Google Scholar
- Dorigo, M. & Stützle, T. (2004). Bradford Book: Ant colony optimization.Google Scholar
- Goldberg, D. E. (1989). Genetic algorithm in search: Optimization and machine learning.Google Scholar
- Halliday, D., Resnick, R., & Walker, J. (2010). Fundamentals of physics. New York: Wiley.Google Scholar
- Hosseinabadi, A. R., Farahabadi, A. B., Rostami, M. S., & Lateran, A. F. (2013). Presentation of a new and beneficial method through problem solving timing of open shop by random algorithm gravitational emulation local search. International Journal of Computer Science Issues, 10(1), 745–752.Google Scholar
- Koza, J. R. (1992). Genetic programming: On the programming of computers by means of natural selection. Bradford.Google Scholar
- Pooranian, Z., Shojafar, M., Abawajy, J., & Abraham, A. (2013). An efficient meta-heuristic algorithm for grid computing. Journal of Combinatorial Optimization, 1–22. doi: 10.1007/s10878-013-9644-6.
- Rezaeian, J., Seidgar, H., & Kiani, M. (2013). Scheduling of a hybrid flow shop with multiprocessor tasks by a hybrid approach based on genetic and imperialist competitive algorithms. Journal of Optimization in Industrial Engineering, 6(13), 1–11.Google Scholar
- Saffari-Aman, S., Akbarzadeh-T, M. R. & Shamshirband, S. (2008). Load balancing in switching network with multi-ACO. Paper presented at the In Proceedings of the 9th conference on intelligent systems and 2nd joint congress on fuzzy and intelligent systems, Tehran.Google Scholar
- Su, L. H., Chang, P. C., & Lee, E. S. (1998). A heuristic for scheduling general Job shops to minimize maximum lateness. Mathematical and Computer Modelling, 27, 1–15.Google Scholar
- Tay, J. C., & Wibowo, D. (2004). An effective chromosome representation for evolving flexible job-shop scheduling. Genetic and Evolutionary Computation Conference, 3103, 210–221.Google Scholar
- Tvay, J. C. & Ho, N. B. (2007). Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Computer & Industrial Engineering.Google Scholar
- Voudouris, C. & Tsang, E. (1995). Guided local search. European Journal of Operational Research, 1–18.Google Scholar
- Webster, B. (2004). Solving combinatorial optimization problems using a new algorithm based on gravitational attraction. Melbourne.Google Scholar