Apply GRASP Algorithm to Solve the Flow-shop Scheduling without Intermediate Queues Using Traveling Salesman Problem

Subject Areas : Industrial Management

Javad Behnamian ¹ (Assistant Professor, Department of Industrial Engineering, Faculty of Engineering, Bu-Ali Sina University, Hamedan, Iran)
Ronak Mohammadi ² (Ms, Department of Industrial Engineering, Faculty of Engineering, Bu-Ali Sina University,)
Omid Rezaei ³ (Department of Industrial Engineering, Faculty of Engineering, Bu-Ali Sina University, Hamedan, Iran)

Received: 2016-06-27 Accepted : 2016-11-09 Published : 2016-12-10

Keywords:

Abstract :

The aim of this paper is to minimize the period of manufacturing in the flow shop scheduling problem without intermediate queues. Scheduling problem without intermediate queues occurs when the process of one job should be processed on the machines from start to finish without interrupting. Since this structure is similar to standard traveling salesman problem, in the present study, a new approach was applied to calculate the tardiness, in which the tardiness matrix obtained from salesman problem is used to find the optimal sequence of operations that has the shortest distance time. Furthermore, the greedy random adaptive search algorithm (GRASP) as the meta-heuristic algorithm is applied to solve the sequencing workflow without queues central workshop problem and its performance is compared to the ant colony algorithm after determining its parameters through full factorial experimental design method.

References:

1. Aldowaisan, T., & Allahverdi, A. (1998). Total flowtime in no-wait flowshops with separated setup times. Computers & Operations Research. 25(9), 757-765.‏


2. Baker, K.R., Trietsch, D. (2009). Principles of Sequencing and Scheduling, Wiley.


3. Bertolissi, E. (2000). Heuristic algorithm for scheduling in the no-wait flow-shop.


4. Feo, T.A., & Resende, M. G. (1995). Greedy randomized adaptive search procedures. Journal of global optimization. 6(2), 109-133.‏


5. Festa, P. (2003). Greedy randomized adaptive search procedures. AIROnews, 7(4), 7-11.‏


6. Gupta, J. N., & Stafford E. F. (2006). Flowshop scheduling research after five decades. European Journal of Operational Research. 169(3), 699-711.‏


7. Hahsler, M., & Hornik, H. (2009). Introduction toTSP - infrastructure for the traveling salespersonproblem. Journal of Statistical Software. 23, 1–21.


8. Hall, N. G., & Sriskandarajah, C. (1996). A survey of machine scheduling problems with blocking and no-wait in process. Operations research. 44(3), 510-525.‏


9. Hejazi, S. R., & Saghafian, S. (2005). Flowshop-scheduling problems with make span criterion: a review. International Journal of Production Research. 43(14), 2895-2929.


10. Jaillet, P. (1988). A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Operations Research, 36(6). 929-936.‏


11. Jayaswal, S. (2008). A comparative study of tabu search and simulated annealing for traveling salesman problem. Department of Management Sciences, University of Waterloo. Project Report.‏


12. Johnson, D.S., & McGeoch, L. A. (1997). The traveling salesman problem: A case study in local optimization. Local search in combinatorial optimization. 1, 215-310.‏


13. Layeb, A., Ammi, M., & Chikhi, S. (2013). A GRASP Algorithm Based on New Randomized Heuristic for Vehicle Routing Problem. CIT. Journal of Computing and Information Technology. 21(1), 35-46.‏


14. Li, X, Wang, Q, & Wu, C. (2008). Heuristic for no-wait flow shops with make span minimization. International Journal of Production Research. 46(9), 2519-2530.‏


15. Pan, Q. K., Wang, L., Tasgetiren, M. F., & Zhao, B. H. (2008). A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion. The International Journal of Advanced Manufacturing Technology. 38(3-4), 337-347.‏


16. Papadimitriou, C. H., & Kanellakis, P. C. (1980). Flowshop scheduling with limited temporary storage. Journal of the ACM. 27(3), 533-549.‏


17. Rajendran, C., & Chaudhuri, D. (1990). Heuristic algorithms for continuous flow‐shop problem. Naval Research Logistics. 37(5), 695-705.‏


18. Reddi, S. S., & Ramamoorthy, C. V. (1972). On the flow-shop sequencing problem with no wait in process. Operational Research Quarterly. 323-331.‏


19. Selen, W.J., & Hott, D.D. (1986). A new formulation and solution of the flow shop scheduling problem with no in process waiting. Applied Mathematical Modeling. 10, 246-248.


20. Tseng, L.Y., & Lin, Y.T.(2010). A hybrid genetic algorithm for no-wait flowshop scheduling problem. International Journal of Production Economics. 128(1), 144–152.


21. Xie, J., Xing, W., Liu, Z., & Dong, J. (2004). Minimum deviation algorithm for two-stageno-wait flow shops with parallel machines. Computers & Mathematics with Applications. 47(12), 1857-1863.