An extended continuous estimation of distribution algorithm for solving the permutation flow-shop scheduling problem

References

• Ahmadizar, Fardin. 2012. “A New Ant Colony Algorithm for Makespan Minimization in Permutation Flow Shops.” Computers & Industrial Engineering 63 (2): 355–361. doi: 10.1016/j.cie.2012.03.015
   Web of Science ®Google Scholar
• Beasley, J. E. 1996. “Obtaining Test Problems via Internet.” Journal of Global Optimization 8 (8): 429–433. doi: 10.1007/BF02404002
   Web of Science ®Google Scholar
• Bosman, Peter A. N., and Dirk Thierens. 2001. “Crossing the Road to Efficient IDEAs for Permutation Problems.” Paper presented at the Genetic and Evolutionary Computation Conference, San Francisco, CA, July 7–11.
   Google Scholar
• Ceberio, Josu, Ekhine Irurozki, Alexander Mendiburu, and Jose Lozano. 2014. “A Distance-Based Ranking Model Estimation of Distribution Algorithm for the Flowshop Scheduling Problem.” IEEE Transactions on Evolutionary Computation 18 (2): 286–300. doi: 10.1109/TEVC.2013.2260548
   Web of Science ®Google Scholar
• Chang, Pei-Chann, and Meng-Hui Chen. 2014. “A Block Based Estimation of Distribution Algorithm Using Bivariate Model for Scheduling Problems.” Soft Computing 18 (6): 1177–1188. doi: 10.1007/s00500-013-1136-1
   Web of Science ®Google Scholar
• Chen, Yuh-Min, Min-Chih Chen, Pei-Chann Chang, and Shih-Hsin Chen. 2012. “Extended Artificial Chromosomes Genetic Algorithm for Permutation Flowshop Scheduling Problems.” Computers & Industrial Engineering 62 (2): 536–545. doi: 10.1016/j.cie.2011.11.002
   Web of Science ®Google Scholar
• Chen, Chun-Lung, Yeu-Ruey Tzeng, and Chuen-Lung Chen. 2015. “A New Heuristic Based on Local Best Solution for Permutation Flow Shop Scheduling.” Applied Soft Computing 29: 75–81. doi: 10.1016/j.asoc.2014.12.011
   Web of Science ®Google Scholar
• Dong, Xingye, Maciek Nowak, Ping Chen, and Youfang Lin. 2015. “Self-Adaptive Perturbation and Multi-neighborhood Search for Iterated Local Search on the Permutation Flow Shop Problem.” Computers & Industrial Engineering 87: 176–185. doi: 10.1016/j.cie.2015.04.030
   Web of Science ®Google Scholar
• Elhadj, Zeraoulia, and J. C. Sprott. 2008. “A Two-Dimensional Discrete Mapping with C∞ Multifold Chaotic Attractors.” Electronic Journal of Theoretical Physics 5 (17): 111–124.
   Google Scholar
• Hamaizia, Tayeb, René Lozi, and Nasr-eddine Hamri. 2012. “Fast Chaotic Optimization Algorithm Based on Locally Averaged Strategy and Multifold Chaotic Attractor.” Applied Mathematics and Computation 219 (1): 188–196. doi: 10.1016/j.amc.2012.05.062
   Web of Science ®Google Scholar
• Han, Yu Yan, Dunwei Gong, and Xiaoyan Sun. 2014. “A Discrete Artificial Bee Colony Algorithm Incorporating Differential Evolution for the Flow-Shop Scheduling Problem with Blocking.” Engineering Optimization 47 (7): 1–20.
   Web of Science ®Google Scholar
• Heinz, M., and S.-V. Dirk. 1993. “Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization.” Evolutionary Computation 1 (1): 25–49. doi: 10.1162/evco.1993.1.1.25
   Web of Science ®Google Scholar
• Jarboui, Bassem, Mansour Eddaly, and Patrick Siarry. 2009. “An Estimation of Distribution Algorithm for Minimizing the Total Flowtime in Permutation Flowshop Scheduling Problems.” Computers & Operations Research 36 (9): 2638–2646. doi: 10.1016/j.cor.2008.11.004
   Web of Science ®Google Scholar
• Johnson, Selmer Martin. 1954. “Optimal Two- and Three-Stage Production Schedules with Setup Times Included.” Naval Research Logistics Quarterly 1 (1): 61–68. doi: 10.1002/nav.3800010110
   Google Scholar
• Li, Xiangtao, and Minghao Yin. 2013. “An Opposition-Based Differential Evolution Algorithm for Permutation Flow Shop Scheduling Based on Diversity Measure.” Advances in Engineering Software 55 (1): 10–31. doi: 10.1016/j.advengsoft.2012.09.003
   Web of Science ®Google Scholar
• Lin, Qun, Liang Gao, Xinyu Li, and Chunjiang Zhang. 2015. “A Hybrid Backtracking Search Algorithm for Permutation Flow-Shop Scheduling Problem.” Computers & Industrial Engineering 85: 437–446. doi: 10.1016/j.cie.2015.04.009
   Web of Science ®Google Scholar
• Liu, Xueying, and Meiling Fu. 2015. “Cuckoo Search Algorithm Based on Frog Leaping Local Search and Chaos Theory.” Applied Mathematics and Computation 266 (C): 1083–1092. doi: 10.1016/j.amc.2015.06.041
   Web of Science ®Google Scholar
• Liu, Weibo, Yan Jin, and Mark Price. 2016. “A New Nawaz–Enscore–Ham-Based Heuristic for Permutation Flow-Shop Problems with Bicriteria of Makespan and Machine Idle Time.” Engineering Optimization 48 (10): 1808–1822. doi: 10.1080/0305215X.2016.1141202
   Web of Science ®Google Scholar
• Liu, Ying, Minghao Yin, and Wenxiang Gu. 2014. “An Effective Differential Evolution Algorithm for Permutation Flow Shop Scheduling Problem.” Applied Mathematics and Computation 248 (248): 143–159. doi: 10.1016/j.amc.2014.09.010
   Web of Science ®Google Scholar
• Lozano, J. A., and A. Mendiburu. 2002. Estimation of Distribution Algorithms Applied to the Job Shop Scheduling Problem: Some Preliminary Research. Springer US.
   Google Scholar
• Montgomery, Douglas C. 2008. Design and Analysis of Experiments. Hoboken, NJ: John Wiley & Sons.
   Google Scholar
• Mühlenbein, Heinz, and Gerhard Paass. 1996. “From Recombination of Genes to the Estimation of Distributions I. Binary Parameters.” In Parallel Problem Solving from Nature—PPSN IV, 178–87. Springer.
   Google Scholar
• Murata, Tadahiko, Hisao Ishibuchi, and Hideo Tanaka. 1996. “Genetic Algorithms for Flowshop Scheduling Problems.” Computers & Industrial Engineering 30 (4): 1061–1071. doi: 10.1016/0360-8352(96)00053-8
   Web of Science ®Google Scholar
• Pan, Quan-Ke, and Rubén Ruiz. 2012a. “An Estimation of Distribution Algorithm for Lot-Streaming Flow Shop Problems with Setup Times.” Omega 40 (2): 166–180. doi: 10.1016/j.omega.2011.05.002
   Web of Science ®Google Scholar
• Pan, Quan-Ke, and Ruben Ruiz. 2012b. “Local Search Methods for the Flowshop Scheduling Problem with Flowtime Minimization.” European Journal of Operational Research 222 (1): 31–43. doi: 10.1016/j.ejor.2012.04.034
   Web of Science ®Google Scholar
• Pan, Quan-Ke, Ling Wang, and Liang Gao. 2011. “A Chaotic Harmony Search Algorithm for the Flow Shop Scheduling Problem with Limited Buffers.” Applied Soft Computing 11 (8): 5270–5280. doi: 10.1016/j.asoc.2011.05.033
   Web of Science ®Google Scholar
• Pérez-Rodríguez, Ricardo, Arturo Hernández-Aguirre, and S. Jöns. 2015. “A Continuous Estimation of Distribution Algorithm for the Online Order-Batching Problem.” The International Journal of Advanced Manufacturing Technology 79 (1–4): 569–588. doi: 10.1007/s00170-015-6835-6
   Web of Science ®Google Scholar
• Pinedo, Michael L. 2008. Scheduling: Theory, Algorithms, and Systems. 3rd ed. New York, NY: Springer.
   Google Scholar
• Qian, Bin, Ling Wang, Rong Hu, Wan-Liang Wang, De-Xian Huang, and Xiong Wang. 2008. “A Hybrid Differential Evolution Method for Permutation Flow-Shop Scheduling.” The International Journal of Advanced Manufacturing Technology 38 (7–8): 757–777. doi: 10.1007/s00170-007-1115-8
   Web of Science ®Google Scholar
• Reeves, Colin R., and Takeshi Yamada. 1998. “Genetic algorithms, path relinking, and the flowshop sequencing problem.” Evolutionary Computation 6 (1): 45–60. doi: 10.1162/evco.1998.6.1.45
   PubMed Web of Science ®Google Scholar
• Robles, V., P. De Miguel, and P. Larrañaga. 2002. “Solving the Traveling Salesman Problem with EDAs.” Genetic Algorithms & Evolutionary Computation 2: 211–229. doi: 10.1007/978-1-4615-1539-5_10
   Google Scholar
• Samuel, R. K., and P. Venkumar. 2015. “Flow Shop Performance Enhancement by Hybrid Simulated Annealing.” International Journal of Applied Engineering Research 10 (69): 304–310.
   Google Scholar
• Sayadi, M., R. Ramezanian, and N. Ghaffari-Nasab. 2010. “A Discrete Firefly Meta-heuristic with Local Search for Makespan Minimization in Permutation Flow Shop Scheduling Problems.” International Journal of Industrial Engineering Computations 1 (1): 1–10. doi: 10.5267/j.ijiec.2010.01.001
   Google Scholar
• Selen, J. Willem, and D. David Hott. 1986. “A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem.” Journal of the Operational Research Society 37 (12): 1121–1128. doi: 10.1057/jors.1986.197
   Web of Science ®Google Scholar
• Shao, Weishi, and Dechang Pi. 2016. “A Self-Guided Differential Evolution with Neighborhood Search for Permutation Flow Shop Scheduling.” Expert Systems with Applications 51: 161–176. doi: 10.1016/j.eswa.2015.12.001
   Web of Science ®Google Scholar
• Shen, Jing Nan, Ling Wang, and Sheng Yao Wang. 2015. “A Bi-population EDA for Solving the No-Idle Permutation Flow-Shop Scheduling Problem with the Total Tardiness Criterion.” Knowledge-Based Systems 74: 167–175. doi: 10.1016/j.knosys.2014.11.016
   Web of Science ®Google Scholar
• Taillard, E. 1993. “Benchmarks for Basic Scheduling Problems.” European Journal of Operational Research 64 (2): 278–285. doi: 10.1016/0377-2217(93)90182-M
   Web of Science ®Google Scholar
• Tasgetiren, M. Fatih, Yun-Chia Liang, Mehmet Sevkli, and Gunes Gencyilmaz. 2007. “A Particle Swarm Optimization Algorithm for Makespan and Total Flowtime Minimization in the Permutation Flowshop Sequencing Problem.” European Journal of Operational Research 177 (3): 1930–1947. doi: 10.1016/j.ejor.2005.12.024
   Web of Science ®Google Scholar
• Tseng, Lin-Yu, and Ya-Tai Lin. 2009. “A Hybrid Genetic Local Search Algorithm for the Permutation Flowshop Scheduling Problem.” European Journal of Operational Research 198 (1): 84–92. doi: 10.1016/j.ejor.2008.08.023
   Web of Science ®Google Scholar
• Vallada, Eva, and Rubén Ruiz. 2010. “Genetic Algorithms with Path Relinking for the Minimum Tardiness Permutation Flowshop Problem.” Omega 38 (1–2): 57–67. doi: 10.1016/j.omega.2009.04.002
   Web of Science ®Google Scholar
• Vallada, Eva, Rubén Ruiz, and Jose M. Framinan. 2015. “New Hard Benchmark for Flowshop Scheduling Problems Minimising Makespan.” European Journal of Operational Research 240 (3): 666–677. doi: 10.1016/j.ejor.2014.07.033
   Web of Science ®Google Scholar
• Wang, K., S. H. Choi, and H. Qin. 2014. “An Estimation of Distribution Algorithm for Hybrid Flow Shop Scheduling Under Stochastic Processing Times.” International Journal of Production Research 52 (24): 7360–7376. doi: 10.1080/00207543.2014.930535
   Web of Science ®Google Scholar
• Wang, Yu, and Bin Li. 2008. A Restart Univariate Estimation of Distribution Algorithm: Sampling Under Mixed Gaussian and Lévy Probability Distribution. Article presented at the Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence). IEEE Congress on, 1–6 June 2008.
   Google Scholar
• Wang, Sheng Yao, Ling Wang, Min Liu, and Ye Xu. 2012a. “An Enhanced Estimation of Distribution Algorithm for Solving Hybrid Flow-Shop Scheduling Problem with Identical Parallel Machines.” International Journal of Advanced Manufacturing Technology 68 (9–12): 2043–2056. doi: 10.1007/s00170-013-4819-y
   Web of Science ®Google Scholar
• Wang, Sheng-yao, Ling Wang, Min Liu, and Ye Xu. 2013a. “An Effective Estimation of Distribution Algorithm for Solving the Distributed Permutation Flow-Shop Scheduling Problem.” International Journal of Production Economics 145 (1): 387–396. doi: 10.1016/j.ijpe.2013.05.004
   Web of Science ®Google Scholar
• Wang, Shengyao, Ling Wang, Ye Xu, and Min Liu. 2013b. “An Effective Estimation of Distribution Algorithm for the Flexible Job-Shop Scheduling Problem with Fuzzy Processing Time.” International Journal of Production Research 51 (12): 3778–3793. doi: 10.1080/00207543.2013.765077
   Web of Science ®Google Scholar
• Wang, Ling, Shengyao Wang, Ye Xu, Gang Zhou, and Min Liu. 2012b. “A Bi-population Based Estimation of Distribution Algorithm for the Flexible Job-Shop Scheduling Problem.” Computers & Industrial Engineering 62 (4): 917–926. doi: 10.1016/j.cie.2011.12.014
   Web of Science ®Google Scholar
• Xie, Zhanpeng, Chaoyong Zhang, Xinyu Shao, Wenwen Lin, and Haiping Zhu. 2014. “An Effective Hybrid Teaching–Learning-Based Optimization Algorithm for Permutation Flow Shop Scheduling Problem.” Advances in Engineering Software 77: 35–47.
   Google Scholar
• Xu, Ye, Ling Wang, Shengyao Wang, and Min Liu. 2014. “An Effective Hybrid Immune Algorithm for Solving the Distributed Permutation Flow-Shop Scheduling Problem.” Engineering Optimization 46 (9): 1269–1283. doi: 10.1080/0305215X.2013.827673
   Web of Science ®Google Scholar
• Zhang, Yi, and Xiaoping Li. 2011. “Estimation of Distribution Algorithm for Permutation Flow Shops with Total Flowtime Minimization.” Computers & Industrial Engineering 60 (4): 706–718. doi: 10.1016/j.cie.2011.01.005
   Web of Science ®Google Scholar
• Zhao, Fuqing, Yang Liu, Zhongshi Shao, Xin Jiang, Chuck Zhang, and Junbiao Wang. 2016. “A Chaotic Local Search Based Bacterial Foraging Algorithm and its Application to a Permutation Flow-Shop Scheduling Problem.” International Journal of Computer Integrated Manufacturing 29 (9): 962–981. doi: 10.1080/0951192X.2015.1130240
   Web of Science ®Google Scholar
• Zhao, Fuqing, Zhongshi Shao, Junbiao Wang, and Chuck Zhang. 2016. “A Hybrid Differential Evolution and Estimation of Distribution Algorithm Based on Neighbourhood Search for Job Shop Scheduling Problems.” International Journal of Production Research 54 (4): 1039–1060. doi: 10.1080/00207543.2015.1041575
   Web of Science ®Google Scholar