A chemotaxis-enhanced bacterial foraging algorithm and its application in job shop scheduling problem

References

• Adibi, M. A., M. Zandieh, and M. Amiri. 2010. “Multi-Objective Scheduling of Dynamic Job Shop Using Variable Neighborhood Search.” Expert Systems with Applications 37 (1): 282–287. http://www.sciencedirect.com/science/article/pii/S0957417409004199
   Web of Science ®Google Scholar
• Alavandar, S., T. Jain, and M. J. Nigam. 2009. “Bacterial Foraging Optimized Hybrid Fuzzy Precompensated PD Control of Two Link Rigid-Flexible Manipulator.” International Journal of Computational Intelligence Systems 2 (1): 51–59. doi:10.1080/18756891.2009.9727639.
   Web of Science ®Google Scholar
• Babu, B. V., and M. M. L. Jehan. 2003. “Differential Evolution for Multi-objective Optimization.” In 2003 Congress on Evolutionary Computation, CEC 2003, December 8–12, 2696–2703. Canberra: IEEE Computer Society.
   Google Scholar
• Balázs, K., Z. Horváth, and L. T. Kóczy. 2012. “Hybrid Bacterial Iterated Greedy Heuristics for the Permutation Flow Shop Problem.” In 2012 IEEE Congress on Evolutionary Computation, CEC 2012, June 10–15, 1–8. Brisbane: IEEE Computer Society.
   Google Scholar
• Banharnsakun, A., B. Sirinaovakul, and T. Achalakul. 2012. “Job Shop Scheduling with the Best-So-Far ABC.” Engineering Applications of Artificial Intelligence 25 (3): 583–593. doi:10.1016/j.engappai.2011.08.003. http://www.sciencedirect.com/science/article/pii/S0952197611001461
   Web of Science ®Google Scholar
• Changzhu, X. 2009. Solving Job Shop Scheduling Problem Based on Natural Computation. Xi’an: Xidian University.
   Google Scholar
• Chu, Y., H. Mi, H. Liao, Z. Ji, and Q. H. Wu. 2008. “A Fast Bacterial Swarming Algorithm for High-dimensional Function Optimization.” In 2008 IEEE Congress on Evolutionary Computation, CEC 2008, June 1–6, 3135–3140. Hong Kong: IEEE Computer Society.
   Google Scholar
• Coello, C. A. C., D. C. Rivera, N. C. Cortes, G. Goos, J. Hartmanis, and J. Van Leeuwen. 2003. “Use of an Artificial Immune System for Job Shop Scheduling.” Artificial Immune Systems 2787: 1–10. doi:10.1007/978-3-540-45192-1_1.
   Google Scholar
• Das, S., A. Abraham, U. K. Chakraborty, and A. Konar. 2009. “Differential Evolution Using a Neighborhood-Based Mutation Operator.” IEEE Transactions on Evolutionary Computation 13 (3): 526–553. doi:10.1109/TEVC.2008.2009457.
   Web of Science ®Google Scholar
• Das, S., and P. N. Suganthan. 2011. “Differential Evolution: A Survey of the State-of-the-Art.” IEEE Transactions on Evolutionary Computation 15 (1): 4–31. doi:10.1109/TEVC.2010.2059031.
   Web of Science ®Google Scholar
• Dasgupta, S., S. Das, A. Abraham, and A. Biswas. 2009. “Adaptive Computational Chemotaxis in Bacterial Foraging Optimization: An Analysis.” IEEE Transactions on Evolutionary Computation 13 (4): 919–941. doi:10.1109/TEVC.2009.2021982.
   Web of Science ®Google Scholar
• De Giovanni, L., and F. Pezzella. 2010. “An Improved Genetic Algorithm for the Distributed and Flexible Job-Shop Scheduling Problem.” European Journal of Operational Research 200 (2): 395–408. doi:10.1016/j.ejor.2009.01.008. http://www.sciencedirect.com/science/article/pii/S0377221709000113
   Web of Science ®Google Scholar
• Gao, W., and Z. Yin. 2011. Modern Intelligent Bionics Algorithm and Its Applications. Beijing: Science Press.
   Google Scholar
• Gary, M. R., and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of Np-Completeness. New York: WH Freeman and Company.
   Google Scholar
• Hwang, H. C., and B. K. Choi. 2007. “Workflow-Based Dynamic Scheduling of Job Shop Operations.” International Journal of Computer Integrated Manufacturing 20 (6): 557–566. doi:10.1080/09511920601024179.
   Web of Science ®Google Scholar
• Kachitvichyanukul, V., and S. Sitthitham. 2011. “A Two-Stage Genetic Algorithm for Multi-Objective Job Shop Scheduling Problems.” Journal of Intelligent Manufacturing 22 (3): 355–365. doi:10.1007/s10845-009-0294-6.
   Web of Science ®Google Scholar
• Lei, D. 2010. “Fuzzy Job Shop Scheduling Problem with Availability Constraints.” Computers & Industrial Engineering 58 (4): 610–617. doi:10.1016/j.cie.2010.01.002. http://www.sciencedirect.com/science/article/pii/S0360835210000045
   Web of Science ®Google Scholar
• Lin, T.-L., S.-J. Horng, T.-W. Kao, Y.-H. Chen, R.-S. Run, R.-J. Chen, J.-L. Lai, and I. H. Kuo. 2010. “An Efficient Job-Shop Scheduling Algorithm Based on Particle Swarm Optimization.” Expert Systems with Applications 37 (3): 2629–2636. doi:10.1016/j.eswa.2009.08.015. http://www.sciencedirect.com/science/article/pii/S0957417409007696
   Web of Science ®Google Scholar
• Liu, M., Z.-J. Sun, J.-W. Yan, and J.-S. Kang. 2011. “An Adaptive Annealing Genetic Algorithm for the Job-Shop Planning and Scheduling Problem.” Expert Systems with Applications 38 (8): 9248–9255. doi:10.1016/j.eswa.2011.01.136. http://www.sciencedirect.com/science/article/pii/S0957417411001564
   Web of Science ®Google Scholar
• Narendhar, S., and T. Amudha, 2012. “A Hybrid Bacterial Foraging Algorithm for Solving Job Shop Scheduling Problems.” International Journal of Programming Languages and Applications (IJPLA) 2 (4): 1–11.
   Google Scholar
• Passino, K. M. 2002. “Biomimicry of Bacterial Foraging for Distributed Optimization and Control.” IEEE Control Systems Magazine 22 (3): 52–67. doi:10.1109/MCS.2002.1004010.
   Web of Science ®Google Scholar
• Pezzella, F., and E. Merelli. 2000. “A Tabu Search Method Guided by Shifting Bottleneck for the Job Shop Scheduling Problem.” European Journal of Operational Research 120 (2): 297–310. doi:10.1016/S0377-2217(99)00158-7.
   Web of Science ®Google Scholar
• Qian, B., L. Wang, D.-X. Huang, W.-L. Wang, and X. Wang. 2009. “An Effective Hybrid DE-Based Algorithm for Multi-Objective Flow Shop Scheduling with Limited Buffers.” Computers & Operations Research 36 (1): 209–233. doi:10.1016/j.cor.2007.08.007.
   Web of Science ®Google Scholar
• Rajni, I., Chana. 2013. “Bacterial Foraging Based Hyper-Heuristic for Resource Scheduling in Grid Computing.” Future Generation Computer Systems 29 (3): 751–762. doi:10.1016/j.future.2012.09.005. http://www.sciencedirect.com/science/article/pii/S0167739X12001781
   Web of Science ®Google Scholar
• Renna, P. 2010. “Job Shop Scheduling by Pheromone Approach in a Dynamic Environment.” International Journal of Computer Integrated Manufacturing 23 (5): 412–424. doi:10.1080/09511921003642170.
   Web of Science ®Google Scholar
• Sabuncuoglu, I., and M. Bayiz. 1999. “Job Shop Scheduling with Beam Search.” European Journal of Operational Research 118 (2): 390–412. doi:10.1016/S0377-2217(98)00319-1.
   Web of Science ®Google Scholar
• Sakthivel, V. P., R. Bhuvaneswari, and S. Subramanian. 2010. “Bacterial Foraging Technique Based Parameter Estimation of Induction Motor from Manufacturer Data.” Electric Power Components and Systems 38 (6): 657–674. doi:10.1080/15325000903489660.
   Web of Science ®Google Scholar
• Salido, M. A., J. Escamilla, F. Barber, A. Giret, D. Tang, and M. Dai. 2013. “Energy-Aware Parameters in Job-Shop Scheduling Problems.” GREEN-COPLAS 2013: IJCAI 2013 Workshop on Constraint Reasoning, Planning and Scheduling Problems for a Sustainable Future, Beijing, August 3–5, 44–53.
   Google Scholar
• Seo, M., and D. Kim. 2010. “Ant Colony Optimisation with Parameterised Search Space for the Job Shop Scheduling Problem.” International Journal of Production Research 48 (4): 1143–1154. doi:10.1080/00207540802538021.
   Web of Science ®Google Scholar
• Sha, D., and C.-Y. Hsu. 2006. “A Hybrid Particle Swarm Optimization for Job Shop Scheduling Problem.” Computers & Industrial Engineering 51 (4): 791–808. doi:10.1016/j.cie.2006.09.002.
   Web of Science ®Google Scholar
• Sha, D. Y., and H.-H. Lin. 2010. “A Multi-Objective PSO for Job-Shop Scheduling Problems.” Expert Systems with Applications 37 (2): 1065–1070. doi:10.1016/j.eswa.2009.06.041. http://www.sciencedirect.com/science/article/pii/S0957417409006265
   Web of Science ®Google Scholar
• Shivakumar, B., and T. Amudha. 2012. “A Hybrid Bacterial Swarming Methodology for Job Shop Scheduling Environment.” Global Journal of Computer Science and Technology 12 (10–A): 7–16.
   Google Scholar
• Storn, R., and K. Price. 1995. “Differential Evolution – A Simple and Efficient Adaptive Scheme for Global Optimization over Continuous Spaces.” Technical Report, International Computer Science Institute 8: 22–25.
   Google Scholar
• Storn, R., and K. Price. 1997. “Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces.” Journal of Global Optimization 11 (4): 341–359. doi:10.1023/A:1008202821328.
   Web of Science ®Google Scholar
• Tavakkoli-Moghaddam, R., M. Azarkish, and A. Sadeghnejad-Barkousaraie. 2011. “A New Hybrid Multi-Objective Pareto Archive PSO Algorithm for A Bi-Objective Job Shop Scheduling Problem.” Expert Systems with Applications 38 (9): 10812–10821. doi:10.1016/j.eswa.2011.02.050. http://www.sciencedirect.com/science/article/pii/S0957417411002569
   Web of Science ®Google Scholar
• Thürer, M., M. Godinho Filho, and M. Stevenson. 2013. “Coping with Finite Storage Space in Job Shops through Order Release Control: An Assessment by Simulation.” International Journal of Computer Integrated Manufacturing 26 (9): 830–838. doi:10.1080/0951192X.2013.799779.
   Web of Science ®Google Scholar
• Wang, L. 2003. Shop Scheduling with Genetic Algorithms. Beijing: Tsinghua University & Springer Press.
   Google Scholar
• Wang, L., and D.-B. Tang. 2011. “An Improved Adaptive Genetic Algorithm Based on Hormone Modulation Mechanism for Job-Shop Scheduling Problem.” Expert Systems with Applications 38 (6): 7243–7250. http://www.sciencedirect.com/science/article/pii/S0957417411015971
   Web of Science ®Google Scholar
• Wang, W.-L., and Y. Jing. 2013. “A Hybrid Differential Evolution Algorithm for Job Shop Scheduling Problem to Minimize the Total Weighted Tardiness.” In 2013 20th International Conference on Management Science and Engineering, ICMSE 2013, July 17–19, 294–300. Harbin: IEEE Computer Society.
   Google Scholar
• Wong, L.-P., C. Y. Puan, M. Y. H. Low, Y. W. Wong, and C. S. Chong. 2010. “Bee Colony Optimisation Algorithm with Big Valley Landscape Exploitation for Job Shop Scheduling Problems.” International Journal of Bio-Inspired Computation 2 (2): 85–99. doi:10.1504/IJBIC.2010.032125.
   Web of Science ®Google Scholar
• Xing, L.-N., Y.-W. Chen, P. Wang, Q.-S. Zhao, and J. Xiong. 2010. “A Knowledge-Based Ant Colony Optimization for Flexible Job Shop Scheduling Problems.” Applied Soft Computing 10 (3): 888–896. doi:10.1016/j.asoc.2009.10.006. http://www.sciencedirect.com/science/article/pii/S156849460900194X
   Web of Science ®Google Scholar
• Yi, J., and T. Li. 2012. “Bacterial Foraging Optimization Algorithm Based on Variable Neighborhood for Job-Shop Scheduling Problem.” Jixie Gongcheng Xuebao (Chinese Journal of Mechanical Engineering) 48 (12): 178–183. doi:10.3901/JME.2012.12.178.
   Google Scholar
• Zhang, Q., H. Manier, and M.-A. Manier. 2013. “A Modified Shifting Bottleneck Heuristic and Disjunctive Graph for Job Shop Scheduling Problems with Transportation Constraints.” International Journal of Production Research 1–18. doi:10.1080/00207543.2013.828164.
   Web of Science ®Google Scholar
• Zhang, R., and C. Wu. 2010. “A Hybrid Immune Simulated Annealing Algorithm for the Job Shop Scheduling Problem.” Applied Soft Computing 10 (1): 79–89. doi:10.1016/j.asoc.2009.06.008. http://www.sciencedirect.com/science/article/pii/S1568494609000751
   Web of Science ®Google Scholar