A hybrid approach for minimizing makespan in permutation flowshop scheduling
- 243 Downloads
This work proposes a hybrid approach for solving traditional flowshop scheduling problems to reduce the makespan (total completion time). To solve scheduling problems, a combination of Decision Tree (DT) and Scatter Search (SS) algorithms are used. Initially, the DT is used to generate a seed solution which is then given input to the SS to obtain optimal / near optimal solutions of makespan. The DT used the entropy function to convert the given problem into a tree structured format / set of rules. The SS provides an extensive investigation of the search space through diversification. The advantages of both DT and SS are used to form a hybrid approach. The proposed algorithm is tested with various benchmark datasets available for flowshop scheduling. The statistical results prove that the proposed method is competent and efficient for solving flowshop problems.
KeywordsFlowshop scheduling makespan decision tree algorithm scatter search algorithm hybrid algorithm
Unable to display preview. Download preview PDF.
The authors are thankful to the referees for their suggestions and comments to improve the earlier version of the paper.
- Baker, K.R. (1974). Introduction to Sequencing and Scheduling. New York: John Wiley & Sons, Inc.Google Scholar
- Balasundaram, R., Valavan, D. & Baskar, N. (2014). Heuristic based approach for bi-criteria optimization of minimizing makespan and total flow time of flowshop scheduling. International Journal of Mechanical & Mechatronics Engineering, 14 (02): 1–11.Google Scholar
- Gen, M. & Cheng, R. (1997). Genetic Algorithms and Engineering Design, New York: John Wiley & Sons, Inc.Google Scholar
- Chen, S., Chang, P.C. & Zhang, Q. (2009). A self-guided genetic algorithm for flowshop scheduling problems. In: Proceedings of the Eleventh Conference on Congress on Evolutionary Computation, pp. 471–478.Google Scholar
- Han, J. & Kamber, M. (2006). Data Mining: Concepts and Techniques, San Francisco: Morgan Kaufmann.Google Scholar
- Modrák, V. & Pandian, R.S. (2010). Flow shop scheduling algorithm to minimize completion time for n-jobs m-machines problem. Technical Gazette, 17 (3): 273–278.Google Scholar
- Nawaz, M., Enscore, EE. & Ham, I. (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA-The International Journal of Management Science, 11 (1): 91–95.Google Scholar
- Rajkumar, R. & Shahabudeen, P. (2008). Performance evaluation of simulated annealing algorithm for flowshop scheduling problems. The International Journal of Applied Management and Technology, 5 (3): 172–189.Google Scholar
- Tasgetiren, M., Sevkli, M. & Liang, Y.C. (2004). Particle swarm optimization algorithm for permutation flowshop sequencing problem, in: M. Dorigo, et al. (eds.), Lecture Notes in Computer Science, vol. 3172, Springer-Verlag, New York, 2004, pp. 382–389.Google Scholar