Minimizing the total flow time in a flow shop with blocking by using hybridm harmony search algorithms

Expert Systems with Applications

Volumn 37, Issue 12, 2010, Pages 7929-7936

  Wang, Ling ^a   Pan, Quan Ke ^b   Tasgetiren, M Fatih ^c  

^a TSINGHUA UNIVERSITY   (China)

^b LIAOCHENG UNIVERSITY   (China)

^c YASAR UNIVERSITY   (Turkey)

Author keywords

Blocking flow shop; Harmony search; Hybrid algorithms; Pitch adjustment rule; Total flow time

Indexed keywords

BENCHMARKING; HYDRAULIC STRUCTURES; LEARNING ALGORITHMS; SCHEDULING;

BLOCKING FLOW SHOPS; HARMONY SEARCH; HYBRID ALGORITHMS; PITCH ADJUSTMENTS; TOTAL FLOWTIME;

MACHINE SHOP PRACTICE;

EID: 77957844759     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2010.04.042     Document Type: Article

References (25)

1. Abadi, I. N. K., Hall, N. G., & Sriskandarajh, C. (2000). Minimizing cycle time in a blocking flowshop. Operations Research, 48, 177-180.
2. Allahverdi, A., Ng, C. T., Cheng, T. C. E., et al. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187, 985-1032.
3. Caraffa, V., Ianes, S., Bagchi, T. P., & Sriskandarajah, C. (2001). Minimizing makespan in a blocking flowshop using genetic algorithms. International Journal of Production Economics, 70, 101-115.
4. Eberhart, R. C., & Kennedy, J. (1995). A new optimizer using particle swarm theory. In Proceedings of the sixth international symposium on micro machine and human science (pp. 39-43). Nagoya, Japan.
5. Framinan, J. M., & Leisten, R. (2003). An effective constructive heuristic for flowtime minimisation in permutation flow shops. Omega, 31, 311-317.
6. Framinan, J. M., Leisten, R., & Rajendran, C. (2003). Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem. International Journal of Production Research, 41, 121-148.
7. Geem, Z. W. (2008). Novel derivative of harmony search algorithm for discrete design variables. Applied Mathematics and Computation, 199, 223-230.
8. Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001). A new heuristic optimization algorithm: Harmony search. Simulations, 76, 60-68.
9. Geem, Z. W., Lee, K. S., & Park, Y. J. (2005). Application of harmony search to vehicle routing. American Journal of Applied Sciences, 2, 1552-1557.
10. Grabowski, J., & Pempera, J. (2000). Sequencing of jobs in some production system. European Journal of Operational Research, 125, 535-550.
11. Grabowski, J., & Pempera, J. (2007). The permutation flow shop problem with blocking. A tabu search approach. Omega, 35, 302-311.
12. Hall, N. G., & Sriskandarajah, C. (1996). A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44, 510-525.
13. Lee, K. S., & Geem, Z. W. (2005). A new meta-heuristic algorithm for continuous engineering optimization, harmony search theory and practice. Computer Methods in Applied Mechanics and Engineering, 194, 3902-3933.
14. Lee, K. S., Geem, Z. W., Lee, S. H., & Bae, K. W. (2005). The harmony search heuristic algorithm for discrete structural optimization. Engineering Optimization, 37, 663-684.
15. Leisten, R. (1990). Flowshop sequencing problems with limited buffer storage. International Journal of Production Research, 28, 2085-2100.
16. Mahdavi, M., Fesanghary, M., & Damangir, E. (2007). An improved harmony search algorithm for solving optimization problems. Applied Mathematics and Computation, 188, 1567-1579.
17. McCormich, S. T., Pinedo, M. L., Shenker, S., & Wolf, B. (1989). Sequencing in an assembly line with blocking to minimize cycle time. Operations Research, 37, 925-936.
18. Nawaz, M., Enscore, E. E. J., & Ham, I. (1983). A heuristic algorithm for the mmachine, n-job flow shop sequencing problem. Omega, 11, 91-95.
19. Omran, M. G. H., & Mahdavi, M. (2008). Global-best harmony search. Applied Mathematics and Computation, 198, 643-656.
20. Pinedo, M. (2002). Scheduling, theory, algorithms and systems. New Jersey: Prentice- Hall.
21. Qian, B., Wang, L., Huang, D. X., & Wang, X. (2009). An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers. International Journal of Production Research, 47, 1-24.
22. Ronconi, D. P. (2004). A note on constructive heuristics for the flowshop problem with blocking. International Journal of Production Economics, 87, 39-48.
23. Ronconi, D. P. (2005). A branch-and-bound algorithm to minimize the makespan in a flowshop problem with blocking. Annals of Operations Research, 138, 53-65.
24. Ronconi, D. P., & Henriques, L. R. S. (2009). Some heuristic algorithms for total tardiness minimization in a flowshop with blocking. Omega, 37, 272-281.
25. Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64, 278-285.