A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness

References

• Aldowaisan, Tariq, and Ali Allahverdi. 2012. “Minimizing Total Tardiness in No-Wait Flowshops.” Foundations of Computing and Decision Sciences 37 (3): 149–162.
   Google Scholar
• Aldowaisan, Tariq, and Ali Allahverdi. 2015. “No-Wait Flowshops to Minimize Total Tardiness with Setup Times.” Intelligent Control and Automation 6 (1): 38–44. doi:10.4236/ica.2015.61005
   Google Scholar
• Allahverdi, Ali. 2016. “A Survey of Scheduling Problems with No-Wait in Process.” European Journal of Operational Research 255 (3): 665–686.
   Web of Science ®Google Scholar
• Allahverdi, Ali, Harun Aydilek, and Asiye Aydilek. 2020. “No-Wait Flowshop Scheduling Problem with Separate Setup Times to Minimize Total Tardiness Subject to Makespan.” Applied Mathematics and Computation 365: Article ID 124688. doi:10.1016/j.amc.2019.124688
   Web of Science ®Google Scholar
• Costa, Maria Raquel C., Jorge Valente, and Jeffrey E. Schaller. 2020. “Efficient Procedures for the Weighted Squared Tardiness Permutation Flowshop Scheduling Problem.” Flexible Services and Manufacturing Journal 32 (3): 487–522.
   Web of Science ®Google Scholar
• Della Croce, Federico, Andrea Grosso, and Fabio Salassa. 2021. “Minimizing Total Completion Time in the Two-Machine No-Idle No-Wait Flow Shop Problem.” Journal of Heuristics 27 (1): 159–173.
   Web of Science ®Google Scholar
• Ding, Jian-Ya, Shiji Song, Jatinder N. D. Gupta, Rui Zhang, Raymond Chiong, and Cheng Wu. 2015. “An Improved Iterated Greedy Algorithm with a Tabu-Based Reconstruction Strategy for the No-Wait Flowshop Scheduling Problem.” Applied Soft Computing 30: 604–613.
   Web of Science ®Google Scholar
• Ding, Jianya, Shiji Song, Rui Zhang, Jatinder N. D. Gupta, and Cheng Wu. 2015. “Accelerated Methods for Total Tardiness Minimisation in No-Wait Flowshops.” International Journal of Production Research 53 (4): 1002–1018.
   Web of Science ®Google Scholar
• Fernandez-Viagas, Victor, and Jose M. Framinan. 2015. “NEH-Based Heuristics for the Permutation Flowshop Scheduling Problem to Minimise Total Tardiness.” Computers & Operations Research 60: 27–36. doi:10.1016/j.cor.2015.02.002.
   Web of Science ®Google Scholar
• Framinan, Jose Manuel, and Rainer Leisten. 2008. “Total Tardiness Minimization in Permutation Flow Shops: A Simple Approach Based on a Variable Greedy Algorithm.” International Journal of Production Research 46 (22): 6479–6498.
   Web of Science ®Google Scholar
• Gonçalves, Tomás C., Jorge M. S. Valente, and Jeffrey E. Schaller. 2016. “Metaheuristics for the Single Machine Weighted Quadratic Tardiness Scheduling Problem.” Computers & Operations Research 70: 115–126.
   Web of Science ®Google Scholar
• Hansen, Pierre, and Nenad Mladenović. 2001. “Variable Neighbourhood Search: Principles and Applications.” European Journal of Operational Research 130 (3): 449–467.
   Web of Science ®Google Scholar
• Hoitomt, Debra J., Peter B. Luh, Eric Max, and Krishna R. Pattipati. 1990. “Scheduling Jobs with Simple Precedence Constraints on Parallel Machines.” IEEE Control Systems Magazine 10 (2): 34–40.
   Web of Science ®Google Scholar
• Jackson, James R. 1955. Scheduling a Production Line to Minimize Maximum Tardiness. Technical Report. Management Science Research Project, Numerical Analysis Research Document. National Technical Information Service Issue Number 198024. California University Los Angeles. https://ntrl.ntis.gov/NTRL/dashboard/searchResults/titleDetail/AD152722.xhtml.
   Google Scholar
• Karabulut, Korhan. 2016. “A Hybrid Iterated Greedy Algorithm for Total Tardiness Minimization in Permutation Flowshops.” Computers & Industrial Engineering 98: 300–307.
   Web of Science ®Google Scholar
• Lin, Shih-Wei, Chung-Cheng Lu, and Kuo-Ching Ying. 2018. “Minimizing the Sum of Makespan and Total Weighted Tardiness in a No-Wait Flowshop.” IEEE Access 6: 78666–78677.
   Web of Science ®Google Scholar
• Lubin, Miles, and Iain Dunning. 2015. “Computing in Operations Research Using Julia.” INFORMS Journal on Computing 27 (2): 238–248.
   Web of Science ®Google Scholar
• Luh, Peter B., and Debra J. Hoitomt. 1993. “Scheduling of Manufacturing Systems Using the Lagrangian Relaxation Technique.” IEEE Transactions on Automatic Control 38 (7): 1066–1079.
   Web of Science ®Google Scholar
• Miyata, Hugo Hissashi, Marcelo Seido Nagano, and Jatinder N. D. Gupta. 2019. “Integrating Preventive Maintenance Activities to the No-Wait Flow Shop Scheduling Problem with Dependent-Sequence Setup Times and Makespan Minimization.” Computers & Industrial Engineering 135: 79–104.
   Web of Science ®Google Scholar
• Mladenović, Nenad, and Pierre Hansen. 1997. “Variable Neighbourhood Search.” Computers & Operations Research 24 (11): 1097–1100.
   Web of Science ®Google Scholar
• Moccellin, Joao Vitor, Marcelo Seido Nagano, Anselmo Ramalho Pitombeira Neto, and Bruno de Athayde Prata. 2018. “Heuristic Algorithms for Scheduling Hybrid Flow Shops with Machine Blocking and Setup Times.” Journal of the Brazilian Society of Mechanical Sciences and Engineering 40 (2): 1–11.
   Web of Science ®Google Scholar
• Muller, Laurent Flindt, Simon Spoorendonk, and David Pisinger. 2012. “A Hybrid Adaptive Large Neighbourhood Search Heuristic for Lot-Sizing with Setup Times.” European Journal of Operational Research 218 (3): 614–623.
   Web of Science ®Google Scholar
• Nagano, Marcelo Seido, Fernando Siqueira de Almeida, and Hugo Hissashi Miyata. 2021. “An Iterated Greedy Algorithm for the No-Wait Flowshop Scheduling Problem to Minimize Makespan Subject to Total Completion Time.” Engineering Optimization 53 (8): 1431–1449.
   Web of Science ®Google Scholar
• Nawaz, Muhammad, E. Emory Enscore Jr, and Inyong Ham. 1983. “A Heuristic Algorithm for the m-Machine, n-Job Flow-Shop Sequencing Problem.” Omega 11 (1): 91–95.
   Web of Science ®Google Scholar
• Pitombeira-Neto, Anselmo Ramalho, and Bruno de Athayde Prata. 2020. “A Matheuristic Algorithm for the One-Dimensional Cutting Stock and Scheduling Problem with Heterogeneous Orders.” Top 28: 178–192. doi:10.1007/s11750-019-00531-3.
   Web of Science ®Google Scholar
• Ruiz, Rubén, and Ali Allahverdi. 2007. “No-Wait Flowshop with Separate Setup Times to Minimize Maximum Lateness.” The International Journal of Advanced Manufacturing Technology 35 (5): 551–565.
   Web of Science ®Google Scholar
• Ruiz, Rubén, and Ali Allahverdi. 2009. “New Heuristics for No-Wait Flow Shops with a Linear Combination of Makespan and Maximum Lateness.” International Journal of Production Research 47 (20): 5717–5738. doi:10.1080/00207540802070942
   Web of Science ®Google Scholar
• Ruiz, Rubén, and Thomas Stützle. 2007. “A Simple and Effective Iterated Greedy Algorithm for the Permutation Flowshop Scheduling Problem.” European Journal of Operational Research 177 (3): 2033–2049.
   Web of Science ®Google Scholar
• Sakuraba, Celso S., Débora P. Ronconi, Ernesto G. Birgin, and Mutsunori Yagiura. 2015. “Metaheuristics for Large-Scale Instances of the Linear Ordering Problem.” Expert Systems with Applications 42 (9): 4432–4442.
   Web of Science ®Google Scholar
• Sakuraba, Celso S., and Mutsunori Yagiura. 2010. “Efficient Local Search Algorithms for the Linear Ordering Problem.” International Transactions in Operational Research 17 (6): 711–737.
   Web of Science ®Google Scholar
• Schaller, Jeffrey, and Jorge M. S. Valente. 2012. “Minimizing the Weighted Sum of Squared Tardiness on a Single Machine.” Computers & Operations Research 39 (5): 919–928.
   Web of Science ®Google Scholar
• Schaller, Jeffrey, and Jorge M. S. Valente. 2018. “Efficient Heuristics for Minimizing Weighted Sum of Squared Tardiness on Identical Parallel Machines.” Computers & Industrial Engineering 119: 146–156.
   Web of Science ®Google Scholar
• Silva, Andreia F., Jorge M. S. Valente, and Jeffrey E. Schaller. 2022. “Metaheuristics for the Permutation Flowshop Problem with a Weighted Quadratic Tardiness Objective.” Computers & Operations Research 140: Article ID 105691. doi:10.1016/j.cor.2021.105691
   Web of Science ®Google Scholar
• Stafford Jr, Edward F., and Fan T. Tseng. 2002. “Two Models for a Family of Flowshop Sequencing Problems.” European Journal of Operational Research 142 (2): 282–293.
   Web of Science ®Google Scholar
• Stafford Jr, E. F., Fan T. Tseng, and Jatinder N. D. Gupta. 2005. “Comparative Evaluation of MILP Flowshop Models.” Journal of the Operational Research Society 56 (1): 88–101. doi:10.1057/palgrave.jors.2601805
   Web of Science ®Google Scholar
• Sun, Xiaoqing, James S. Noble, and Cerry M. Klein. 1999. “Single-Machine Scheduling with Sequence Dependent Setup to Minimize Total Weighted Squared Tardiness.” IIE Transactions 31 (2): 113–124.
   Web of Science ®Google Scholar
• Thomalla, Christoph S. 2001. “Job Shop Scheduling with Alternative Process Plans.” International Journal of Production Economics 74 (1-3): 125–134.
   Web of Science ®Google Scholar
• Valente, Jorge M. S., and Jeffrey E. Schaller. 2012. “Dispatching Heuristics for the Single Machine Weighted Quadratic Tardiness Scheduling Problem.” Computers & Operations Research 39 (9): 2223–2231.
   Web of Science ®Google Scholar
• Ye, Honghan, Wei Li, Amin Abedini, and Barrie Nault. 2017. “An Effective and Efficient Heuristic for No-Wait Flow Shop Production to Minimize Total Completion Time.” Computers & Industrial Engineering 108: 57–69.
   Web of Science ®Google Scholar
• Zhao, Fuqing, Huan Liu, Yi Zhang, Weimin Ma, and Chuck Zhang. 2018. “A Discrete Water Wave Optimization Algorithm for No-Wait Flow Shop Scheduling Problem.” Expert Systems with Applications 91: 347–363.
   Web of Science ®Google Scholar
• Zhao, Fuqing, Shuo Qin, Guoqiang Yang, Weimin Ma, Chuck Zhang, and Houbin Song. 2019. “A Factorial Based Particle Swarm Optimization with a Population Adaptation Mechanism for the No-Wait Flow Shop Scheduling Problem with the Makespan Objective.” Expert Systems with Applications 126: 41–53.
   Web of Science ®Google Scholar