Mathematical models and a hunting search algorithm for the no-wait flowshop scheduling with parallel machines

References

• Aldowaisan, T., and A. Allahverdi. 2004. “New Heuristics for m-Machine No-wait Flowshop to Minimize Total Completion Time.” Omega 32 (5): 345–352.
   Web of Science ®Google Scholar
• Araujo, D. C., and M. S. Nagano. 2010. “An Effective Heuristic for the No-wait Flowshop with Sequence-dependent Setup times Problem.” Lecture Notes in Computer Science 6437: 187–196.
   Google Scholar
• Araujo, D. C., and M. S. Nagano. 2011. “A New Effective Heuristic Method for the No-wait Flowshop with Sequence-dependent Setup times Problem.” International Journal of Industrial Engineering Computations 2 (1): 155–166.
   Google Scholar
• Aydilek, H., and A. Allahverdi. 2012. “Heuristics for No-wait Flowshops with Makespan Subject to Mean Completion Time.” Applied Mathematics and Computation 219: 351–359.
   Web of Science ®Google Scholar
• Bonney, M. C., and S. W. Gundry. 1976. “Solutions to Constrained Flowshop Sequencing Problem.” Operational Research Quarterly 27: 869–883.
   Google Scholar
• Campbell, H. G., R. A. Dudek, and M. L. Smith. 1970. “A Heuristic Algorithm for the n Job, m Machine Sequencing Problem.” Management Science 16: 630–637.
   Web of Science ®Google Scholar
• Davendra, D., I. Zelink, M. B. Davendra, R. Senkerik, and R. Jasek. 2013. “Discrete Self-organising Migrating Algorithm for Flow-shop Scheduling with No-wait Makespan.” Mathematical and Computer Modelling 57: 100–110.
   Web of Science ®Google Scholar
• Filho, G. R., M. S. Nagano, and L. A. N. Lorena. 2007. “Hybrid Evolutionary Algorithm for Flow time minimisation in No-wait Flowshop Scheduling.” Lecture Notes in Computer Science 4827: 1099–1109.
   Google Scholar
• Fink, A., and S. Voß. 2003. “Solving the Continuous Flow-shop Scheduling Problem by Metaheuristics.” European Journal of Operational Research 151: 400–414.
   Web of Science ®Google Scholar
• Framinan, J. M., and M. S. Nagano. 2008. “Evaluating the Performance for Makespan Minimisation in No-wait Flowshop Sequencing.” Journal of Materials Processing Technology 197: 1–9.
   Web of Science ®Google Scholar
• Framinan, J. M., M. S. Nagano, and J. V. Moccellin. 2010. “An Efficient Heuristic for Total Flowtimeminimisation in No-wait Flowshops.” The, International Journal of Advanced Manufacturing Technology 46: 1049–1057.
   Web of Science ®Google Scholar
• Goyal, S. K., and C. Sriskandarajah. 1998. “No-wait Shop Scheduling: Computational Complexity and Approximate Algorithms.” Operations Research 25: 220–244.
   Google Scholar
• Grabowski, J., and J. Pempera. 2000. “Sequencing of Jobs in Some Production System.” European Journal of Operational Research 125: 535–550.
   Web of Science ®Google Scholar
• Grabowski, J., and J. Pempera. 2005. “Some Local Search Algorithms for No-wait Flow-shop Problem with makespan Criterion.” Computers and Operations Research 32: 2197–2212.
   Web of Science ®Google Scholar
• Gupta, J. N. D. 1976. “Optimal Flowshop Schedules with No Intermediate Storage Space.” Naval Research Logistics 23: 235–243.
   Web of Science ®Google Scholar
• Hall, N. C., and C. A. Sriskandarajah. 1996. “Survey of Machine Scheduling Problems with Blocking and No-wait in Process.” Operations Research 44: 510–525.
   Web of Science ®Google Scholar
• King, J. R., and A. S. Spachis. 1980. “Heuristics for Flowshop Scheduling.” International Journal of Production Research 18: 345–357.
   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.
   Web of Science ®Google Scholar
• Li, X., Q. Wang, and C. Wu. 2008. “Heuristic for No-wait Flow Shops with Makespan Minimization.” International Journal of Production Research 46 (9): 2519–2530.
   Web of Science ®Google Scholar
• Liesegan, G., and M. Ruger. 1972. “Flowshop Sequencing Problem with No Wait in Process.” Operational Research Quarterly 23: 591–598.
   Google Scholar
• Liu, G., S. Song, and C. Wu. 2013. “Some Heuristics for No-wait Flowshops with Total Tardiness Criterion.” Computers and Operations Research 40: 521–525.
   Web of Science ®Google Scholar
• Naderi, B., R. Ruiz, and M. Zandieh. 2010. “Algorithms for a Realistic Variant of Flowshop Scheduling.” Computers and Operations Research 37: 236–246.
   Web of Science ®Google Scholar
• Nagano, M. S., A. A. Silva, and L. A. N. Lorena. 2012. “A New Evolutionary Clustering Search for a No-wait Flow Shop Problem with Set-up times.” Engineering Applications of Artificial Intelligence 25 (6): 1114–1120.
   Web of Science ®Google Scholar
• Nawaz, M., E. E. Enscore Jr, and I. Ham. 1983. “A Heuristic Algorithm for the m-Machine, n-Job Flowshop Sequencing Problem.” Omega – International Journal of Management Science 11 (1): 91–95.
   Web of Science ®Google Scholar
• Oftadeh, R., M. J. Mahjoob, and M. Shariatpanahi. 2010. “A Novel Meta-heuristic Optimization Algorithm Inspired by Group Hunting of Animals: Hunting Search.” Computers and Mathematics with Applications 60: 2087–2098.
   Web of Science ®Google Scholar
• Palmer, D. S. 1965. “Sequencing Jobs through a Multi-stage Process in the Minimal Total Time – A Quick Method of Obtaining a near Optimum.” Operations Research Quarterly 16: 101–107.
   Google Scholar
• Pan, C. H. 1997. “A Study of Integer Programming Formulations for Scheduling Problems.” International Journal of Systems Sciences 28 (1): 33–41.
   Web of Science ®Google Scholar
• Pan, Q. K., M. F. Tasgetiren, and Y. C. Liang. 2008. “A Discrete Particle Swarm Optimization Algorithm for the No-wait Flowshop Scheduling Problem.” Computers and Operations Research 35: 2807–2839.
   Web of Science ®Google Scholar
• Pinedo, M. L. 2008. Scheduling: Theory, Algorithms, and Systems. 3rd ed. New York: Springer Science + Business Media.
   Google Scholar
• Raaymakers, W. H. M., and J. A. Hoogeveen. 2000. “Scheduling Multipurpose Batch Process Industries with No-wait Restrictions by Simulated Annealing.” European Journal of Operational Research 126: 131–151.
   Web of Science ®Google Scholar
• Rajendran, C., and D. Chaudhuri. 1990. “Heuristic Algorithms for Continuous Flowshop Problem.” Naval Research Logistics 37: 695–705.
   Web of Science ®Google Scholar
• Rajendran, C., and H. Ziegler. 2004. “Ant-colony Algorithms for Permutation Flowshop Scheduling to Minimize Makespan/Total Flowtime of Jobs.” European Journal of Operational Research 155: 426–438.
   Web of Science ®Google Scholar
• Röck, H. 1984. “Some New Results in Flow Shop Scheduling.” Mathematical Methods of Operations Research 28: 1–16.
   Google Scholar
• Schuster, C. J., and J. M. Framinan. 2003. “Approximate Procedure for No-wait Job Shop Scheduling.” Operations Research Letters 31: 308–318.
   Web of Science ®Google Scholar
• Shyu, S. J., B. M. T. Lin, and P. Y. Yin. 2004. “Application of Ant Colony Optimization for No-wait Flowshop Scheduling Problem to Minimize the Total Completion Time.” Computers and Industrial Engineering 47: 181–193.
   Web of Science ®Google Scholar
• Tavakkoli-Moghaddam, R., A. R. Vahed, and A. HosseinMirzaei. 2007. “A Hybrid Multi-objective Immune Algorithm for a Flow Shop Scheduling Problem with Bi-objectives: Weighted Mean Completion Time and Weighted Mean Tardiness.” Information Sciences 177: 5072–5090.
   Web of Science ®Google Scholar
• Wagner, H. M. 1959. “An Integer Linear-programming Model for Machine Scheduling.” Naval Research Logistics Quarterly 6 (2): 131–140.
   Google Scholar
• Wang, S., and M. Liu. 2013. “A Genetic Algorithm for Two-stage No-wait Hybrid Flow Shop Scheduling Problem.” Computers and Operations Research40 (4): 1064–1075..
   Web of Science ®Google Scholar
• Wismer, D. A. 1972. “Solution of Flowshop-scheduling Problem with No Intermediate Queues.” Operations Research 20: 689–697.
   Web of Science ®Google Scholar