Two hybrid tabu search–firefly algorithms for the capacitated job shop scheduling problem with sequence-dependent setup cost

References

• Amaral Armentano, V., and C. RigãoScrich. 2000. “Tabu Search for Minimizing Total Tardiness in a Job Shop.” International Journal of Production Economy 63(2): 131–140.
   Web of Science ®Google Scholar
• Anglani, A., A. Grieco, E. Guerriero, and R. Musmanno. 2005. “Robust Scheduling of Parallel Machines with Sequence-Dependent Set-up Costs.” European Journal of Operational Research 161: 704–720.
   Web of Science ®Google Scholar
• Ardakan, M. A., A. Hakimian, and M. T. Rezvan. 2013. “A Branch-and-Bound Algorithm for Minimising the Number of Tardy Jobs in a Two-Machine Flow-Shop Problem with Release Dates.” International Journal of Computer Integrated Manufacturing (ahead-of-print) 1–10.
   Google Scholar
• Baptiste, P., M. Flamini, and F. Sourd. 2008. “Lagrangian Bounds for Just-in-Time Job-Shop Scheduling.” Computers and Operations Research 35(3): 906–915.
   Web of Science ®Google Scholar
• Barnes, J. W., and J. B. Chambers. 1991 “Solving the Job Shop Scheduling Problem Using Tabu Search.” Technical Report Series Orp 91–06, Graduate Program in Operations Research and Industrial Engineering, Department of Mechanical Engineering, The University of Texas at Austin.
   Google Scholar
• Essafi, I., Y. Mati, and S. Dauzère-Pérès. 2008. “A Genetic Local Search Algorithm for Minimizing Total Weighted Tardiness in the Job-Shop Scheduling Problem.” Computers and Operation Research 35(8): 2599–2616.
   Web of Science ®Google Scholar
• Fandel, G., and C. Stammen-Hegene. 2006. “Simultaneous Lot Sizing and Scheduling for Multi-Product Multi-Level Production.” International Journal of Production Economy 104(2): 308–316.
   Web of Science ®Google Scholar
• Glover, F. 1989. “Tabu Search—Part I.” ORSA Journal on Computing 1(3): 190–206.
   Google Scholar
• González, M. A., C. R. Vela, I. González-Rodríguez, and R. Varela. 2013. “Lateness Minimization with Tabu Search for Job Shop Scheduling Problem with Sequence Dependent Setup Times.” Journal of Intelligent Manufacturing 24(4): 741–754.
   Web of Science ®Google Scholar
• Iravani, S. M. R., and C. P. Teo. 2005. “Asymptotically Optimal Schedules for Single-Server Flow Shop Problem with Setup Costs and Times.” Operations Research Letters 33: 421–430.
   Web of Science ®Google Scholar
• Jamili, A., M. A. Shafia, and R. Tavakkoli-Moghaddam. 2011. “A Hybridization of Simulated Annealing and Electromagnetism-Like Mechanism for a Periodic Job Shop Scheduling Problem.” Expert Systems with Application 38: 5895–5901.
   Web of Science ®Google Scholar
• Jiao, Y., and Y. Chunming. 2013. “Novel Firefly Algorithm for Solving Job Shop Scheduling Problem.” Computer Engineering and Applications 11: 213–215, 247.
   Google Scholar
• Karimi, B., S. M. T. Fatemi Ghomi, and J. M. Wilson. 2003. “The Capacitated Lot Sizing Problem: A Review of Models and Algorithms.” Omega 31: 365–378.
   Web of Science ®Google Scholar
• Khadwilard, A., S. Chansombat, T. Thepphakorn, P. Thapatsuwan, W. Chainate, and P. Pongcharoen. 2012. “Application of Firefly Algorithm and Its Parameter Setting for Job Shop Scheduling.” Journal of Industrial Technology 8(1): 49–58.
   Google Scholar
• Lenstra, J. K., A. H. G. RinnooyKan, and P. Burcker. 1977. “Complexity of Machine Scheduling Problems.” Annals of Discrete Mathematics 1: 343–362.
   Google Scholar
• Liu, M., Z. Sun, J. Yan, and J. Kang. 2011. “An Adaptive Annealing Genetic Algorithm for the Job-Shop Planning and Scheduling Problem.” Expert Systems with Applications 38: 9248–9255.
   Web of Science ®Google Scholar
• Miller, D. M., H. C. Chen, J. Matson, and Q. Liu. 1999. “A Hybrid Genetic Algorithm for the Single Machine Scheduling Problem.” Journal of Heuristics 5: 437–454.
   Web of Science ®Google Scholar
• Nasiri, M. M., and F. Kianfar. 2012. “A GES/TS Algorithm for the Job Shop Scheduling.” Computers and Industrial Engineering 62(4): 946–952.
   Web of Science ®Google Scholar
• Nowicki, E., and C. Smutnicki. 2005. “An Advanced Tabu Search Algorithm for the Job Shop Problem.” Journal of Scheduling 8(2): 145–159.
   Web of Science ®Google Scholar
• Nuijten, W. P. M., and E. H. L. Aarts. 1996. “A Computational Study of Constraint Satisfaction for Multiple Capacitated Job Shop Scheduling.” European Journal of Operational Research 90(2): 269–284.
   Web of Science ®Google Scholar
• Ponsich, A., and C. A. Coello Coello. 2013. “A Hybrid Differential Evolution-Tabu Search Algorithm for the Solution of Job-Shop Scheduling Problems.” Applied Soft Computing Journal 13(1): 462–474.
   Web of Science ®Google Scholar
• Sabuncuoglu, I., and M. Bayiz. 1998. “Job Shop Scheduling with Beam Search.” European Journal of Operational Research 118(2): 390–412.
   Web of Science ®Google Scholar
• Schmidt, G. 2000. “Scheduling with Limited Machine Availability.” European Journal of Operational Research 121: 1–15.
   Web of Science ®Google Scholar
• Singer, M., and M. Pinedo. 1998. “Computational Study of Branch and Bound Techniques for Minimizing the Total Weighted Tardiness in Job Shops.” Iie Transactions 29: 109–119.
   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 Application 38: 10812–10821.
   Web of Science ®Google Scholar
• Tavakkoli-Moghaddam, R., M. Khalili, and B. Naderi. 2009. “A Hybridization of Simulated Annealing and Electromagnetic-Like Mechanism for Job Shop Problems with Machine Availability and Sequence-Dependent Setup Times to Minimize Total Weighted Tardiness.” Soft Computing 13(10): 995–1006.
   Web of Science ®Google Scholar
• Tayebi Araghi, M. E., F. Jolai, and M. Rabiee. 2013. “Incorporating Learning Effect and Deterioration for Solving a SDST Flexible Job-Shop Scheduling Problem with a Hybrid Meta-Heuristic Approach.” International Journal of Computer Integrated Manufacturing (ahead-of-print) 1–14.
   Google Scholar
• Vahedi Nouri, B., P. Fattahi, and R. Ramezanian. 2013a. “Minimizing Total Flow Time for the Non-Permutation Flow Shop Scheduling Problem with Learning Effects and Availability Constraints.” Journal of Manufacturing Systems 32(1): 167–173.
   Web of Science ®Google Scholar
• Vahedi Nouri, B., P. Fattahi, and R. Ramezanian. 2013b. “Hybrid Firefly-Simulated Annealing Algorithm for the Flow Shop Problem with Learning Effects and Flexible Maintenance Activities.” International Journal of Production Research. 51(12): 3501–3515.
   Web of Science ®Google Scholar
• Vahedi Nouri, B., P. Fattahi, M. Rohaninejad, and R. Tavakkoli-Moghaddam. 2013. “Minimizing the Total Completion Time on a Single Machine with the Learning Effect and Multiple Availability Constraints.” Applied Mathematical. Modelling 37(5): 3126–3137.
   Web of Science ®Google Scholar
• Wang, L., and Db. Tang. 2011. “An Improved Adaptive Genetic Algorithm Based on Hormone Modulation Mechanism for Job-Shop Scheduling Problem.” Expert Systems and Applications 38: 7243–7250.
   Web of Science ®Google Scholar
• Wong, T. C., and S. C. Ngan. 2013.  “A Comparison of Hybrid Genetic Algorithm and Hybrid Particle Swarm Optimization to Minimize Makespan for Assembly Job Shop.” Applied Soft Computing Journal. 13(3): 1391–1399.
   Web of Science ®Google Scholar
• Wu, C. F. J., and M. S. Hamada. 2000. Experiments: Planning, Analysis, and Parameter Design Optimization. John Wiley.
   Google Scholar
• Yang, H. A., Q.-F. Sun, C. Saygin, and S.-D. Sun. 2012. “Job Shop Scheduling Based on Earliness and Tardiness Penalties with Due Dates and Deadlines: An Enhanced Genetic Algorithm.” International Journal of Advanced Manufacturing Technology. doi: 10.1007/s00170-011-3746–z.
   Web of Science ®Google Scholar
• Yang, X. S. 2008. Nature-Inspired Metaheuristic Algorithms. Bristol: Luniver Press.
   Google Scholar
• Yang, X.-S. 2009. “Firefly Algorithms for Multimodal Optimization.” In Stochastic Algorithms: Foundations and Applications, Berlin: Springer. Lecture Notes in Computer Sciences, 5792, 169–178.
   Google Scholar
• Yang, X. S. 2010. Nature Inspired Metaheuristic Algorithm. 2nd ed. University of Cambridge.
   Google Scholar
• Zhang, C. Y., P. G. Li, Y. Q. Rao, and Z. L. Guan. 2008. “A Very Fast Ts/Sa Algorithm for the Job Shop Scheduling Problem.” Computers and Operational Research 35: 282–294.
   Web of Science ®Google Scholar
• Zhang, R., S. Song, and C. Wu. 2013. “A Hybrid Artificial Bee Colony Algorithm for the Job Shop Scheduling Problem.” International Journal of Production Economics 141(1): 167–178.
   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 Journal 10(1): 79–89.
   Web of Science ®Google Scholar
• Zhang, R., and C. Wu. 2011. “A Simulated Annealing Algorithm Based on Block Properties for the Job Shop Scheduling Problem with Total Weighted Tardiness Objective.” Computers and Operational Research 38(5): 854–867.
   Web of Science ®Google Scholar
• Zhang, R., and C. Wu. 2012. “Bottleneck Machine Identification Method Based on Constraint Transformation for Job Shop Scheduling with Genetic Algorithm.” Information Sciences 188: 236–252.
   Web of Science ®Google Scholar
• Zhang, X. D., and H.-S. Yan. 2005. “Integrated Optimization of Production Planning and Scheduling for a Kind of Job-Shop.” The International Journal Advanced Manufacturing Technology 26(7–8): 876–886.
   Web of Science ®Google Scholar
• Zhou, H., W. Cheung, and L. C. Leung. 2009. “Minimizing Weighted Tardiness of Job-Shop Scheduling Using a Hybrid Genetic Algorithm.” European Journal of Operational Research 194(3): 637–649.
   Web of Science ®Google Scholar