Improving the migrating birds optimization metaheuristic for the permutation flow shop with sequence-dependent set-up times

International Journal of Production Research

Volumn 55, Issue 20, 2017, Pages 6145-6157

  Benkalai, Imène ^a   Rebaine, Djamal ^a   Gagné, Caroline ^a   Baptiste, Pierre ^b  

^a UNIVERSITÉ DU QUÉBEC À CHICOUTIMI   (Canada)

^b ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

flow shop; makespan; metaheuristics; set up times

Indexed keywords

BIRDS; MACHINE SHOP PRACTICE; SCHEDULING;

FLOW-SHOPS; MAKESPAN; META HEURISTICS; OPTIMIZATION METAHEURISTIC; PERMUTATION FLOW SHOPS; REAL-WORLD SCHEDULING; SEQUENCE-DEPENDENT SET-UP TIME; SET-UP TIME;

OPTIMIZATION;

EID: 85019557267     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2017.1327732     Document Type: Article

References (22)

1. Allahverdi, A., C. T., Ng, T. C. E., Cheng, and M. Y., Kovalyov. 2008. “A Survey of Scheduling Problems with Setup Times or Costs.” European Journal of Operational Research 187:985–1032.
2. Benkalai, I., D., Rebaine, C., Gagné, and P., Baptiste. 2016. “The Migrating Birds Optimization Metaheuristic for the Permutation Flow Shop with Sequence-dependent Setup Times.” In 8th IFAC Conference on Manufacturing Modelling, Management and Control, Troyes, France.
3. Dong, X., H., Huang, and P., Chen. 2009. “Study on Heuristics for the Permutation Flowshop with Sequence Dependent Setup Times.” In IEEE International Conference on Information Reuse & Integration, Las Vegas, USA.
4. Duman, E., M., Uysal, and A., Fuat Alkaya. 2012. “Migrating Birds Optimization:A New Metaheuristic Approach and its Performance on Quadratic Assignment Problem.” Information Sciences 217:65–77.
5. Fay, M. P., and M. A., Proschan. 2010. “Wilcoxon-Mann-Whitney or t-test? On Assumptions for Hypothesis Tests and Multiple Interpretations of Decision Rules.” Statistic Surveys 4:1–39.
6. França, P. M., J. N. D., Gupta, A. S., Mendes, P., Moscato, and K., Veltink. 2005. “Evolutionary Algorithms for Scheduling a Flow Shop Manufacturing Cell with Sequence Dependent Family Setups.” Computers and Industrial Engineering 48 (3):491–506.
7. Golden, B. L., and W. R., Stewart. 1985. “Empirical Analysis of Heuristics.” In The Traveling Salesman Problem:A Guided Tour of Combinatorial Optimization, edited by E., Lawler, J. K., Lenstra, A. H. G., Rinnooy Kan and D. B., Shmoys, 207–249. Chichester:Wiley.
8. Gupta, J. N. D., 1986. “Flowshop Schedules with Sequence Dependent Setup Times.” Journal of the Operational Research Society of Japan 29 (3):206–219.
9. Gupta, J., and W., Darrow. 1986. “The Two-machine Sequence Dependent Flowshop Scheduling Problem.” European Journal of Operational Research 24:439–446.
10. Gupta, J. N. D., and E. F., Stafford Jr. 2006. “Flowshop Scheduling Research after Five Decades.” European Journal of Operational Research 169:699–711.
11. Hendizadeh, S. H., H., Faramarzi, S. A., Mansouri, J. N. D., Gupta, and T. Y., ElMekkawy. 2008. “Metaheuristics for Scheduling a Flowline Manufacturing Cell with Sequence Dependent Family Setup Times.” International Journal of Production Economics 111 (2):593–605.
12. Kumar, G., and S., Singhal. 2013. “Genetic Algorithm Optimization of Flow Shop Scheduling Problem with Sequence Dependent Setup Time and Lot Splitting.” International Journal of Engineering, Business and Enterprise Applications 4 (1):62–71.
13. Lin, S.-W., K.-C., Ying, C.-C., Lu, and J. N. D., Gupta. 2011. “Applying Multi-start Simulated Annealing to Schedule a Flowline Manufacturing Cell with Sequence Dependent Family Setup Times.” International Journal of Production Economics 130:246–254.
14. Nawaz, M., E., Enscore Jr., and I., Ham. 1983. “A Heuristic Algorithm for the m-machine n-job Flow-shop Sequencing Problem.” Omega -- The International Journal of Management Science 11:91–95.
15. Or, I., 1976. “Traveling Salesman-type Combinatorial Problems and their Relation to the Logistics of Regional Blood Banking.” PhD diss., Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL.
16. Pinedo, M., 2002. Scheduling:Theory, Algorithms and Systems. Upper Saddle River, NJ:Prentice Hall.
17. Ramanathan, L., and K., Ulaganathan. 2014. “Nature-inspired Metaheuristic Optimization Technique-migrating Birds Optimization in Industrial Scheduling Problem.” SSRG International Journal of Industrial Engineering (SSRG-IJIE) 1 (3):1–6.
18. Rìos-Mercado, R., and J., Bard. 1998. “Heuristics for the Flow Line Problem with Setup Costs.” European Journal of Operational Research 110:76–98.
19. Ruiz, R., M., Concepción, and J., Alcaraz. 2004. “Solving the Flowshop Scheduling Problem with Sequence Dependent Setup Times using Advanced Metaheuristics.” European Journal of Operational Research 217:34–54.
20. Ruiz, R., and T., Stutzle. 2005. “An Iterated Greedy Algorithm for the Flowshop Problem with Sequence Dependent Setup Times.” In MIC2005. The 6th Metaheuristics International Conference, Vienna, Austria.
21. Tongur, V., and E., Ulker. 2014. “Migrating Birds Optimization for Flow Shop Sequencing Problem.” Journal of Computer and Communications 2:142–147.
22. Vallada, E., R., Ruiz, and C., Maroto. 2003. Synthetic and Real Benchmarks for Complex Flow-shop Problems. Technical report. Universidad Politecnica de Valencia, Valencia, Espana, Grupo de Investigation Operativa GIO.