An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem

References

• Bagheri, A., M. Zandie, I. Mahdavi, and M. Yazdani. 2010. “An Artificial Immune Algorithm for the Flexible Job-shop Scheduling Problem.” Future Generation Computer Systems 26 (4): 533–541. doi: 10.1016/j.future.2009.10.004
   Web of Science ®Google Scholar
• Chan, F. T. S., S. H. Chung, and P. Chan. 2005. “An Adaptive Genetic Algorithm with Dominated Genes for Distributed Scheduling Problems.” Expert Systems with Applications 29 (2): 364–371. doi: 10.1016/j.eswa.2005.04.009
   Web of Science ®Google Scholar
• Chan, F. T. S., S. Chung, L. Chan, G. Finke, and M. Tiwari. 2006. “Solving Distributed FMS Scheduling Problems Subject to Maintenance: Genetic Algorithms Approach.” Robotics and Computer-Integrated Manufacturing 22 (5): 493–504. doi: 10.1016/j.rcim.2005.11.005
   Web of Science ®Google Scholar
• Chang, Y. C., V. C. Li, and C. J. Chiang. 2013. “An Ant Colony Optimization Heuristic for an Integrated Production and Distribution Scheduling Problem.” Engineering Optimization, doi: 10.1080/0305215X.2013.786062.
   Web of Science ®Google Scholar
• Chiang, T. C., H. C. Cheng, and L. C. Fu. 2011. “NNMA: An Effective Memetic Algorithm for Solving Multiobjective Permutation Flow Shop Scheduling Problems.” Expert Systems with Applications 38 (5): 5986–5999. doi: 10.1016/j.eswa.2010.11.022
   Web of Science ®Google Scholar
• Chun, J. S., M. K. Kim, H. K. Jung, and S. K. Hong. 1997. “Shape Optimization of Electromagnetic Devices Using Immune Algorithm.” IEEE Transactions on Magnetics 33 (2): 1876–1879. doi: 10.1109/20.582650
   Web of Science ®Google Scholar
• Coello, C. A. C., and N. C. Cortés. 2004. “Hybridizing a Genetic Algorithm with an Artificial Immune System for Global Optimization.” Engineering Optimization 36 (5): 607–634. doi: 10.1080/03052150410001704845
   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
   Web of Science ®Google Scholar
• Fan, S. K. 2010. “Quality Improvement of Chemical–Mechanical Wafer Planarization Process in Semiconductor Manufacturing Using a Combined Generalized Linear Modelling–Non-linear Programming Approach.” International Journal of Production Research 38 (13): 3011–3029. doi: 10.1080/00207540050117413
   Web of Science ®Google Scholar
• Fan, S. K., and Y. Lin. 2007. “Multiple-input Dual-output Adjustment Scheme for Semiconductor Manufacturing Processes Using a Dynamic Dual-response Approach.” European Journal of Operational Research 180 (2): 868–884. doi: 10.1016/j.ejor.2006.05.003
   Web of Science ®Google Scholar
• Framinan, J. M., J. N. D. Gupta, and R. Leisten. 2004. “A Review and Classification of Heuristics for Permutation Flow-shop Scheduling with Makespan Objective.” Journal of the Operational Research Society 55 (12): 1243–1255. doi: 10.1057/palgrave.jors.2601784
   Web of Science ®Google Scholar
• Gao, J., R. Chen, and W. Deng. 2013. “An Efficient Tabu Search Algorithm for the Distributed Permutation Flowshop Scheduling Problem.” International Journal of Production Research 51 (3): 641–651. doi: 10.1080/00207543.2011.644819
   Web of Science ®Google Scholar
• Gao, J., L. Fang, and J. Wang. 2010. “A Weight-based Multiobjective Immune Algorithm: WBMOIA.” Engineering Optimization 42 (8): 719–745. doi: 10.1080/03052150903406563
   Web of Science ®Google Scholar
• Garey, M. R., D. S. Johnson, and R. Sethi. 1976. “The Complexity of Flowshop and Jobshop Scheduling.” Mathematics of Operations Research 1 (2): 117–129. doi: 10.1287/moor.1.2.117
   Google Scholar
• Hejazi, S. R., and S. Saghafian. 2005. “Flowshop-scheduling Problems with Makespan Criterion: A Review.” International Journal of Production Research 43 (14): 2895–2929. doi: 10.1080/0020754050056417
   Web of Science ®Google Scholar
• Ishibuchi, H., S. Misaki, and H. Tanaka. 1995. “Modified Simulated Annealing Algorithms for the Flow Shop Sequencing Problem.” European Journal of Operational Research 81 (2): 388–398. doi: 10.1016/0377-2217(93)E0235-P
   Web of Science ®Google Scholar
• Jia, H., J. Fuh, A. Nee, and Y. Zhang. 2002. “Web-based Multi-functional Scheduling System for a Distributed Manufacturing Environment.” Concurrent Engineering 10 (1): 27–39. doi: 10.1177/1063293X02010001054
   Web of Science ®Google Scholar
• Jia, H., J. Fuh, A. Nee, and Y. Zhang. 2007. “Integration of Genetic Algorithm and Gantt Chart for Job Shop Scheduling in Distributed Manufacturing Systems.” Computers & Industrial Engineering 53 (2): 313–320. doi: 10.1016/j.cie.2007.06.024
   Web of Science ®Google Scholar
• Jia, H., A. Nee, J. Fuh, and Y. Zhang. 2003. “A Modified Genetic Algorithm for Distributed Scheduling Problems.” Journal of Intelligent Manufacturing 14 (3): 351–362. doi: 10.1023/A:1024653810491
   Web of Science ®Google Scholar
• Johnson, S. M. 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
• Kahn, K. B., G. Castellion, and A. Griffin. 2004. The PDMA Handbook of New Product Development. New York: John Wiley & Sons.
   Google Scholar
• Li, B. B. and L. Wang. 2007. “A Hybrid Quantum-inspired Genetic Algorithm for Multiobjective Flow Shop Scheduling.” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 37 (3): 576–591.
   Google Scholar
• Lian, Z., X. S. Gu, and B. Jiao. 2008. “A Novel Particle Swarm Optimization Algorithm for Permutation Flow-shop Scheduling to Minimize Makespan.” Chaos, Solitons & Fractals 35 (5): 851–861. doi: 10.1016/j.chaos.2006.05.082
   Web of Science ®Google Scholar
• Liu, Y. C., K. T. Fang, and B. M. T. Lin. 2013. “A Branch-and-bound Algorithm for Makespan Minimization in Differentiation Flow Shops.” Engineering Optimization doi: 10.1080/0305215X.2012.737783.
   Web of Science ®Google Scholar
• Luh, G. C., and C. H. Chueh. 2009. “A Multi-modal Immune Algorithm for the Job-shop Scheduling Problem.” Information Sciences 179 (10): 1516–1532. doi: 10.1016/j.ins.2008.11.029
   Web of Science ®Google Scholar
• Luh, G. C., C. H. Chueh, and W. W. Liu. 2003. “MOIA: Multi-Objective Immune Algorithm.” Engineering Optimization 35 (2): 143–164. doi: 10.1080/0305215031000091578
   Web of Science ®Google Scholar
• Montgomery, D. C. 2008. Design and Analysis of Experiments. New York: John Wiley & Sons.
   Google Scholar
• Moon, C., J. Kim, and S. Hur. 2002. “Integrated Process Planning and Scheduling with Minimizing Total Tardiness in Multi-plants Supply Chain.” Computers & Industrial Engineering 43 (1): 331–349. doi: 10.1016/S0360-8352(02)00078-5
   Web of Science ®Google Scholar
• Naderi, B., and R. Ruiz. 2010. “The Distributed Permutation Flowshop Scheduling Problem.” Computers & Operations Research 37 (4): 754–768. doi: 10.1016/j.cor.2009.06.019
   Web of Science ®Google Scholar
• Nowicki, E. 1999. “The Permutation Flow Shop with Buffers: A Tabu Search Approach.” European Journal of Operational Research 116 (1): 205–219. doi: 10.1016/S0377-2217(98)00017-4
   Web of Science ®Google Scholar
• Nowicki, E., and C. Smutnicki. 1996. “A Fast Tabu Search Algorithm for the Permutation Flow-shop Problem.” European Journal of Operational Research 91 (1): 160–175. doi: 10.1016/0377-2217(95)00037-2
   Web of Science ®Google Scholar
• Osman, I., and C. Potts. 1989. “Simulated Annealing for Permutation Flow-shop Scheduling.” Omega 17 (6): 551–557. doi: 10.1016/0305-0483(89)90059-5
   Web of Science ®Google Scholar
• Petrovic, S., and X. Song. 2006. “A New Approach to Two-machine Flow Shop Problem with Uncertain Processing Times.” Optimization and Engineering 7 (3): 329–342. doi: 10.1007/s11081-006-9975-6
   Web of Science ®Google Scholar
• Rahimi-Vahed, A. R., B. Javadi, M. Rabbani, and R. Tavakkoli-Moghaddam. 2008. “A Multi-objective Scatter Search for a Bi-criteria No-wait Flow Shop Scheduling Problem.” Engineering Optimization 40 (4): 331–346. doi: 10.1080/03052150701732509
   Web of Science ®Google Scholar
• Ravetti, M. G., C. Riveros, A. Mendes, M. G. C. Resende, and P. M. Pardalos. 2012. “Parallel Hybrid Heuristics for the Permutation Flow Shop Problem.” Annals of Operations Research 199 (1): 269–284. doi: 10.1007/s10479-011-1056-3
   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
• Tavakkoli-Moghaddam, R., A. R. Rahimi-Vahed, and A. H. Mirzaei. 2008. “Solving a Multi-objective No-wait Flow Shop Scheduling Problem with an Immune Algorithm.” International Journal of Advanced Manufacturing Technology 36 (9): 969–981. doi: 10.1007/s00170-006-0906-7
   Web of Science ®Google Scholar
• Tokola, H., L. Ahlroth, and E. Niemi. 2013. “A Comparison of Rescheduling Policies for Online Flow Shops to Minimize Tardiness.” Engineering Optimization, doi: 10.1080/0305215X.2012.753438.
   Web of Science ®Google Scholar
• Tseng, L. Y., and Y. T. Lin. 2010. “A Genetic Local Search Algorithm for Minimizing Total Flowtime in the Permutation Flowshop Scheduling Problem.” International Journal of Production Economics 127 (1): 121–128. doi: 10.1016/j.ijpe.2010.05.003
   Web of Science ®Google Scholar
• Wang, X., L. Gao, C. Zhang, and X. Shao. 2010. “A Multi-objective Genetic Algorithm based on Immune and Entropy Principle for Flexible Job-shop Scheduling Problem.” International Journal of Advanced Manufacturing Technology 51 (5): 757–767. doi: 10.1007/s00170-010-2642-2
   Web of Science ®Google Scholar
• Wang, L., and W. Shen. 2007. Process Planning and Scheduling for Distributed Manufacturing. London: Springer.
   Google Scholar
• Wang, L., and D. Z. Zheng. 2003. “An Effective Hybrid Heuristic for Flow Shop Scheduling.” International Journal of Advanced Manufacturing Technology 21 (1): 38–44. doi: 10.1007/s001700300005
   Web of Science ®Google Scholar
• Watson, J. P., L. Barbulescu, L. D. Whitley, and A. E. Howe. 2002. “Contrasting Structured and Random Permutation Flow-shop Scheduling Problems: Search-space Topology and Algorithm Performance.” INFORMS Journal on Computing 14 (2): 98–123. doi: 10.1287/ijoc.14.2.98.120
   Web of Science ®Google Scholar
• Wu, S. S., H. D. Wan, K. S. Shukla, and B. Li. 2011. “Chaos-based Improved Immune Algorithm (CBIIA) for Resource-constrained Project Scheduling Problems.” Expert Systems with Applications 38 (4): 3387–3395. doi: 10.1016/j.eswa.2010.08.124
   Web of Science ®Google Scholar
• Xu, Y., L. Wang, S. Y. Wang, and M. Liu. 2013. “An Effective Shuffled Frog-leaping Algorithm for Solving the Hybrid Flow-shop Scheduling Problem with Identical Parallel Machines.” Engineering Optimization, doi: 10.1080/0305215X.2012.737784
   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