A biogeography-based optimisation algorithm for a realistic no-wait hybrid flow shop with unrelated parallel machines to minimise mean tardiness

References

• Asefi, H., F. Jolai, M. Rabiee, and M. E. Araghi. 2014. “A Hybrid NSGA-II and VNS for Solving a Bi-Objective No-Wait Flexible Flowshop Scheduling Problem.” The International Journal of Advanced Manufacturing Technology 75 (5–8): 1017–1033. doi:10.1007/s00170-014-6177-9.
   Web of Science ®Google Scholar
• Behnamian, J., S. M. T. Ghomi, and M. Zandieh. 2009. “A Multi-Phase Covering Pareto-Optimal Front Method to Multi-Objective Scheduling in a Realistic Hybrid Flowshop Using a Hybrid Metaheuristic.” Expert Systems with Applications 36 (8): 11057–11069. doi:10.1016/j.eswa.2009.02.080.
   Web of Science ®Google Scholar
• Behnamian, J., and M. Zandieh. 2011. “A Discrete Colonial Competitive Algorithm for Hybrid Flowshop Scheduling to Minimize Earliness and Quadratic Tardiness Penalties.” Expert Systems with Applications 38 (12): 14490–14498. doi:10.1016/j.eswa.2011.04.241.
   Web of Science ®Google Scholar
• Bianchi, L., M. Dorigo, L. M. Gambardella, and W. J. Gutjahr. 2009. “A Survey on Metaheuristics for Stochastic Combinatorial Optimization.” Natural Computing: an International Journal 8 (2): 239–287. doi:10.1007/s11047-008-9098-4.
   Google Scholar
• Brucker, P. 1998. Scheduling Algorithms. 2nd ed. Berlin: Springer.
   Google Scholar
• Cha, Y., and M. Jung. 2003. “Satisfaction Assessment of Multi-Objective Schedules Using Neural Fuzzy Methodology.” International Journal of Production Research 41 (8): 1831–1849. doi:10.1080/1352816031000074937.
   Web of Science ®Google Scholar
• Chihaoui, F. B., I. Kacem, A. B. Hadj-Alouane, N. Dridi, and N. Rezg. 2011. “No-Wait Scheduling of a Two-Machine Flow-Shop to Minimise the MCT under Non-Availability Constraints and Different Release Dates.” International Journal of Production Research. doi:10.1080/00207543.2010.531775.
   Web of Science ®Google Scholar
• Chryssolouris, G. 2006. Manufacturing Systems: Theory and Practice. 2nd ed. New York: Springer-Verlag.
   Google Scholar
• Chryssolouris, G., K. Dicke, and M. Lee. 1992. “On the Resources Allocation Problem.” The International Journal of Production Research 30 (12): 2773–2795. doi:10.1080/00207549208948190.
   Web of Science ®Google Scholar
• Croes, G. A. 1958. “A Method for Solving Traveling-Salesman Problems.” Operations Research 6 (6): 791–812. doi:10.1287/opre.6.6.791.
   Web of Science ®Google Scholar
• Elmi, A., and S. Topaloglu. 2014. “Scheduling Multiple Parts in Hybrid Flow Shop Robotic Cells Served by a Single Robot.” International Journal of Computer Integrated Manufacturing 27 (12): 1144–1159. doi:10.1080/0951192X.2013.874576.
   Web of Science ®Google Scholar
• Eren, T., and E. Güner. 2006. “A Bicriteria Flowshop Scheduling Problem with Setup Times.” Applied Mathematics and Computation 183 (2): 1292–1300. doi:10.1016/j.amc.2006.05.160.
   Web of Science ®Google Scholar
• Gilmore, P. C., and R. E. Gomory. 1964. “Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem.” Operations Research 12 (5): 655–679. doi:10.1287/opre.12.5.655.
   Web of Science ®Google Scholar
• Grabowski, J., and J. Pempera. 2000. “Sequencing of Jobs in Some Production System.” European Journal of Operational Research 125 (3): 535–550. doi:10.1016/S0377-2217(99)00224-6.
   Web of Science ®Google Scholar
• Hall, N. G., and C. Sriskandarajah. 1996. “A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process.” Operations Research 44 (3): 510–525. doi:10.1287/opre.44.3.510.
   Web of Science ®Google Scholar
• Hayrinen, T., M. Johnsson, T. Johtela, J. Smed, and O. Nevalainen. 2000. “Scheduling Algorithms for Computer-Aided Line Balancing in Printed Circuit Board Assembly.” Production Planning & Control 11 (5): 497–510. doi:10.1080/09537280050051997.
   Web of Science ®Google Scholar
• Huang, R.-H., C.-L. Yang, and Y.-C. Huang. 2009. “No-Wait Two-Stage Multiprocessor Flow Shop Scheduling with Unit Setup.” The International Journal of Advanced Manufacturing Technology 44 (9–10): 921–927. doi:10.1007/s00170-008-1865-y.
   Web of Science ®Google Scholar
• Jenabi, M., S. M. T. Ghomi, S. A. Torabi, and B. Karimi. 2007. “Two Hybrid Meta-Heuristics for the Finite Horizon ELSP in Flexible Flow Lines with Unrelated Parallel Machines.” Applied Mathematics and Computation 186 (1): 230–245. doi:10.1016/j.amc.2006.06.121.
   Web of Science ®Google Scholar
• Johnson, D. B. 1977. “Efficient Algorithms for Shortest Paths in Sparse Networks.” Journal of the ACM (JACM) 24 (1): 1–13. doi:10.1145/321992.321993.
   Web of Science ®Google Scholar
• Jolai, F., M. Rabiee, and H. Asefi. 2012. “A Novel Hybrid Meta-Heuristic Algorithm for a No-Wait Flexible Flow Shop Scheduling Problem with Sequence Dependent Setup Times.” International Journal of Production Research 50 (24): 7447–7466. doi:10.1080/00207543.2011.653012.
   Web of Science ®Google Scholar
• Jolai, F., S. Sheikh, M. Rabbani, and B. Karimi. 2009. “A Genetic Algorithm for Solving No-Wait Flexible Flow Lines with Due Window and Job Rejection.” The International Journal of Advanced Manufacturing Technology 42 (5–6): 523–532. doi:10.1007/s00170-008-1618-y.
   Web of Science ®Google Scholar
• Jungwattanakit, J., M. Reodecha, P. Chaovalitwongse, and F. Werner. 2005. “An Evaluation of Sequencing Heuristics for Flexible Flowshop Scheduling Problems with Unrelated Parallel Machines and Dual Criteria.” Otto-von-Guericke-Universi-tat Magdeburg, Preprint, 1–23.
   Google Scholar
• Kadipasaoglu, S. N., W. Xiang, and B. M. Khumawala. 1997. “A Comparison of Sequencing Rules in Static and Dynamic Hybrid Flow Systems.” International Journal of Production Research 35 (5): 1359–1384. doi:10.1080/002075497195371.
   Web of Science ®Google Scholar
• Kheirandish, O., R. Tavakkoli-Moghaddam, and M. Karimi-Nasab. 2014. “An Artificial Bee Colony Algorithm for a Two-Stage Hybrid Flowshop Scheduling Problem with Multilevel Product Structures and Requirement Operations.” International Journal of Computer Integrated Manufacturing 28 (5): 437–450.
   Web of Science ®Google Scholar
• Kin, S. T. M., S. K. Ong, and A. Y. C. Nee. 2014. “Remanufacturing Process Planning.” Procedia CIRP 15: 189–194. doi:10.1016/j.procir.2014.06.087.
   Google Scholar
• Koulamas, C. 1994. “The Total Tardiness Problem: Review and Extensions.” Operations Research 42 (6): 1025–1041. doi:10.1287/opre.42.6.1025.
   Web of Science ®Google Scholar
• Kovalyov, M. Y., and F. Werner. 1997. “A Polynomial Approximation Scheme for Problem F2/Rj/Cmax.” Operations Research Letters 20 (2): 75–79. doi:10.1016/S0167-6377(96)00049-1.
   Web of Science ®Google Scholar
• Kurz, M. E., and R. G. Askin. 2003. “Comparing Scheduling Rules for Flexible Flow Lines.” International Journal of Production Economics 85 (3): 371–388. doi:10.1016/S0925-5273(03)00123-3.
   Web of Science ®Google Scholar
• Kurz, M. E., and R. G. Askin. 2004. “Scheduling Flexible Flow Lines with Sequence-Dependent Setup Times.” European Journal of Operational Research 159 (1): 66–82. doi:10.1016/S0377-2217(03)00401-6.
   Web of Science ®Google Scholar
• Liu, Y., and I. A. Karimi. 2008. “Scheduling Multistage Batch Plants with Parallel Units and No Interstage Storage.” Computers & Chemical Engineering 32 (4–5): 671–693. doi:10.1016/j.compchemeng.2007.02.002.
   Web of Science ®Google Scholar
• Liu, Z., J. Xie, J. Li, and J. Dong. 2003. “A Heuristic for Two-Stage No-Wait Hybrid Flowshop Scheduling with a Single Machine in either Stage.” Tsinghua Science and Technology 8 (1): 43–48.
   Google Scholar
• Low, C. 2005. “Simulated Annealing Heuristic for Flow Shop Scheduling Problems with Unrelated Parallel Machines.” Computers & Operations Research 32 (8): 2013–2025. doi:10.1016/j.cor.2004.01.003.
   Web of Science ®Google Scholar
• MacArthur, R. H., and E. O. Wilson. 1963. “An Equilibrium Theory of Insular Zoogeography.” International Journal of Organic Evolution 17 (4): 373–387.
   Google Scholar
• MacArthur, R. H., and E. O. Wilson. 1967. The Theory of Island Biography. Princeton, NJ: Princeton University Press.
   Google Scholar
• Majumder, A., A. Singh, and A. Goyal. 2009. “Application of Response Surface Methodology for Glucan Production from Leuconostoc Dextranicum and Its Structural Characterization.” Carbohydrate Polymers 75 (1): 150–156. doi:10.1016/j.carbpol.2008.07.014.
   Web of Science ®Google Scholar
• Manurung, R., G. Ritchie, and H. Thompson. 2012. “Using Genetic Algorithms to Create Meaningful Poetic Text.” Journal of Experimental & Theoretical Artificial Intelligence 24 (1): 43–64. doi:10.1080/0952813X.2010.539029.
   Web of Science ®Google Scholar
• Meng, Z., B. Zou, and Y. Zeng. 2012. “Considering Direct Interaction of Artificial Ant Colony Foraging Simulation and Animation.” Journal of Experimental & Theoretical Artificial Intelligence 24 (1): 95–107. doi:10.1080/0952813X.2010.545999.
   Web of Science ®Google Scholar
• Oehlert, G. W. 2000. Design and Analysis of Experiments: Response Surface Design. New York: W.H. Freeman and Company.
   Google Scholar
• Pan, Q.-K., M. Fatih Tasgetiren, and Y.-C. Liang. 2008. “A Discrete Particle Swarm Optimization Algorithm for the No-Wait Flowshop Scheduling Problem.” Computers & Operations Research 35 (9): 2807–2839. doi:10.1016/j.cor.2006.12.030.
   Web of Science ®Google Scholar
• Pan, Q.-K., L. Wang, and B. Qian. 2009. “A Novel Differential Evolution Algorithm for Bi-Criteria No-Wait Flow Shop Scheduling Problems.” Computers & Operations Research 36 (8): 2498–2511. doi:10.1016/j.cor.2008.10.008.
   Web of Science ®Google Scholar
• Pinedo, M. 1995. Scheduling: Theory, Algorithms and Systems. Englewood Cliffs, NJ: Prentice Hall.
   Google Scholar
• Raaymakers, W. H., and J. A. Hoogeveen. 2000. “Scheduling Multipurpose Batch Process Industries with No-Wait Restrictions by Simulated Annealing.” European Journal of Operational Research 126 (1): 131–151. doi:10.1016/S0377-2217(99)00285-4.
   Web of Science ®Google Scholar
• Rabiee, M., R. S. Rad, M. Mazinani, and R. Shafaei. 2014. “An Intelligent Hybrid Meta-Heuristic for Solving a Case of No-Wait Two-Stage Flexible Flow Shop Scheduling Problem with Unrelated Parallel Machines.” The International Journal of Advanced Manufacturing Technology 71 (5–8): 1229–1245. doi:10.1007/s00170-013-5375-1.
   Web of Science ®Google Scholar
• Rabiee, M., M. Zandieh, and A. Jafarian. 2012. “Scheduling of a No-Wait Two-Machine Flow Shop with Sequence-Dependent Setup Times and Probable Rework Using Robust Meta-Heuristics.” International Journal of Production Research 50 (24): 7428–7446. doi:10.1080/00207543.2011.652747.
   Web of Science ®Google Scholar
• Rajendran, C. 1994. “A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan.” Journal of the Operational Research Society 45 (4): 472–478.
   Web of Science ®Google Scholar
• Ramezani, P., M. Rabiee, and F. Jolai. 2013. “No-Wait Flexible Flowshop with Uniform Parallel Machines and Sequence-Dependent Setup Time: A Hybrid Meta-Heuristic Approach.” Journal of Intelligent Manufacturing 26 (4): 731–744.
   Web of Science ®Google Scholar
• Raymond, H. M., and D. C. Montgomery. 2002. Response Surface Methodology: Process and Product Optimization Using Designed Experiment. New York: Wiley-Interscience Publication.
   Google Scholar
• Reddi, S. S., and C. V. Ramamoorthy. 1972. “On the Flow-Shop Sequencing Problem with No Wait in Process.” Journal of the Operational Research Society 23: 323–331. doi:10.1057/jors.1972.52.
   Web of Science ®Google Scholar
• Rohaninejad, M., A. S. Kheirkhah, B. Vahedi Nouri, and P. Fattahi. 2015. “Two Hybrid Tabu Search–Firefly Algorithms for the Capacitated Job Shop Scheduling Problem with Sequence-Dependent Setup Cost.” International Journal of Computer Integrated Manufacturing 28 (5): 470–487.
   Web of Science ®Google Scholar
• Romdhane, L., and B. Ayeb. 2011. “An Evolutionary Algorithm for Abductive Reasoning.” Journal of Experimental & Theoretical Artificial Intelligence 23 (4): 529–544. doi:10.1080/0952813X.2010.505824.
   Web of Science ®Google Scholar
• Ruiz, R., and A. Allahverdi. 2009. “New Heuristics for No-Wait Flow Shops with a Linear Combination of Makespan and Maximum Lateness.” International Journal of Production Research 47 (20): 5717–5738. doi:10.1080/00207540802070942.
   Web of Science ®Google Scholar
• Ruiz, R., and C. Maroto. 2006. “A Genetic Algorithm for Hybrid Flowshops with Sequence Dependent Setup Times and Machine Eligibility.” European Journal of Operational Research 169 (3): 781–800. doi:10.1016/j.ejor.2004.06.038.
   Web of Science ®Google Scholar
• Ruiz, R., F. S. Şerifoğlu, and T. Urlings. 2008. “Modeling Realistic Hybrid Flexible Flowshop Scheduling Problems.” Computers & Operations Research 35 (4): 1151–1175. doi:10.1016/j.cor.2006.07.014.
   Web of Science ®Google Scholar
• Salvador, M. S. (1973). “A Solution to a Special Class of Flow Shop Scheduling Problems.” Symposium on the theory of scheduling and its applications (pp. 83–91). Springer, Berlin, January.
   Google Scholar
• Samarghandi, H., and T. Y. ElMekkawy. 2012. “A Genetic Algorithm and Particle Swarm Optimization for No-Wait Flow Shop Problem with Separable Setup Times and Makespan Criterion.” The International Journal of Advanced Manufacturing Technology 61 (9–12): 1101–1114. doi:10.1007/s00170-011-3766-8.
   Web of Science ®Google Scholar
• Samarghandi, H., and T. Y. ElMekkawy. 2014. “Solving the No-Wait Flow-Shop Problem with Sequence-Dependent Set-Up Times.” International Journal of Computer Integrated Manufacturing 27 (3): 213–228. doi:10.1080/0951192X.2013.812802.
   Web of Science ®Google Scholar
• Sen, T., J. M. Sulek, and P. Dileepan. 2003. “Static Scheduling Research to Minimize Weighted and Unweighted Tardiness: A State-of-the-Art Survey.” International Journal of Production Economics 83 (1): 1–12. doi:10.1016/S0925-5273(02)00265-7.
   Web of Science ®Google Scholar
• Shafaei, R., M. Rabiee, and M. Mirzaeyan. 2011. “An Adaptive Neuro Fuzzy Inference System for Makespan Estimation in Multiprocessor No-Wait Two Stage Flow Shop.” International Journal of Computer Integrated Manufacturing 24 (10): 888–899. doi:10.1080/0951192X.2011.597430.
   Web of Science ®Google Scholar
• Simon, D. 2008. “Biogeography-Based Optimization.” IEEE Transactions on Evolutionary Computation 12 (6): 702–713. doi:10.1109/TEVC.2008.919004.
   Web of Science ®Google Scholar
• Simons, B., and M. Sipser. 1984. “On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals.” Operations Research 32 (1): 80–88. doi:10.1287/opre.32.1.80.
   Web of Science ®Google Scholar
• Sun, C., H. Zhao, and Y. Wang. 2011. “A Comparative Analysis of PSO, HPSO, and HPSO-TVAC for Data Clustering.” Journal of Experimental & Theoretical Artificial Intelligence 23 (1): 51–62. doi:10.1080/0952813X.2010.506287.
   Web of Science ®Google Scholar
• Suresh, V. 1997. “A Note on Scheduling of Two-Stage Flow Shop with Multiple Processors.” International Journal of Production Economics 49 (1): 77–82. doi:10.1016/S0925-5273(96)00125-9.
   Web of Science ®Google Scholar
• Tomoiagă, B., M. Chindriş, A. Sumper, A. Sudria-Andreu, and R. Villafafila-Robles. 2013. “Pareto Optimal Reconfiguration of Power Distribution Systems Using a Genetic Algorithm Based on NSGA-II.” Energies 6 (3): 1439–1455. doi:10.3390/en6031439.
   Web of Science ®Google Scholar
• Wang, S., and M. Liu. 2013. “A Genetic Algorithm for Two-Stage No-Wait Hybrid Flow Shop Scheduling Problem.” Computers & Operations Research 40 (4): 1064–1075. doi:10.1016/j.cor.2012.10.015.
   Web of Science ®Google Scholar
• Wang, S.-Y., L. Wang, M. Liu, and Y. Xu. 2015. “An Order-Based Estimation of Distribution Algorithm for Stochastic Hybrid Flow-Shop Scheduling Problem.” International Journal of Computer Integrated Manufacturing 28 (3): 307–320. doi:10.1080/0951192X.2014.880803.
   Web of Science ®Google Scholar
• Wiers, V. C. 1997. “A Review of the Applicability of OR and AI Scheduling Techniques in Practice.” Omega 25 (2): 145–153. doi:10.1016/S0305-0483(96)00050-3.
   Web of Science ®Google Scholar
• Wismer, D. A. 1972. “Solution of the Flowshop-Scheduling Problem with No Intermediate Queues.” Operations Research 20 (3): 689–697. doi:10.1287/opre.20.3.689.
   Web of Science ®Google Scholar
• Xie, J., and X. Wang. 2005. “Complexity and Algorithms for Two-Stage Flexible Flowshop Scheduling with Availability Constraints.” Computers & Mathematics with Applications 50 (10–12): 1629–1638. doi:10.1016/j.camwa.2005.07.008.
   Web of Science ®Google Scholar
• Xie, J., W. Xing, Z. Liu, and J. Dong. 2004. “Minimum Deviation Algorithm for Two-Stageno-Wait Flowshops with Parallel Machines.” Computers & Mathematics with Applications 47 (12): 1857–1863. doi:10.1016/j.camwa.2003.08.003.
   Web of Science ®Google Scholar
• Yaurima, V., L. Burtseva, and A. Tchernykh. 2009. “Hybrid Flowshop with Unrelated Machines, Sequence-Dependent Setup Time, Availability Constraints and Limited Buffers.” Computers & Industrial Engineering 56 (4): 1452–1463. doi:10.1016/j.cie.2008.09.004.
   Web of Science ®Google Scholar
• Zandieh, M., S. Fatemi Ghomi, and S. Moattar Husseini. 2006. “An Immune Algorithm Approach to Hybrid Flow Shops Scheduling with Sequence-Dependent Setup Times.” Applied Mathematics and Computation 180 (1): 111–127. doi:10.1016/j.amc.2005.11.136.
   Web of Science ®Google Scholar
• Zandieh, M., and M. Gholami. 2009. “An Immune Algorithm for Scheduling a Hybrid Flow Shop with Sequence-Dependent Setup Times and Machines with Random Breakdowns.” International Journal of Production Research 47 (24): 6999–7027. doi:10.1080/00207540802400636.
   Web of Science ®Google Scholar
• Zhao, F., X. Jiang, C. Zhang, and J. Wang. 2015a. “A Chemotaxis-Enhanced Bacterial Foraging Algorithm and Its Application in Job Shop Scheduling Problem.” International Journal of Computer Integrated Manufacturing 28 (10): 1106–1121.
   Web of Science ®Google Scholar
• Zhao, F., J. Zhang, J. Wang, and C. Zhang. 2015b. “A Shuffled Complex Evolution Algorithm with Opposition-Based Learning for a Permutation Flow Shop Scheduling Problem.” International Journal of Computer Integrated Manufacturing 28 (11): 1220–1235.
   Web of Science ®Google Scholar