Coronavirus Optimization Algorithms for Minimizing Earliness, Tardiness, and Anticipation of Due Dates in Permutation Flow Shop Scheduling

[1]  Hélio Yochihiro Fuchigami,et al.  An efficiency and robustness analysis of warm-start mathematical models for idle and waiting times optimization in the flow shop , 2022, Computers & Industrial Engineering.

[2]  Bruno de Athayde Prata,et al.  A differential evolution algorithm for the customer order scheduling problem with sequence-dependent setup times , 2021, Expert Syst. Appl..

[3]  Zhenxing Xu,et al.  Artificial intelligence for COVID-19: battling the pandemic with computational intelligence , 2021, Intelligent Medicine.

[4]  Feng-Chang R. Chang,et al.  Research on adaptive transmission and controls of COVID-19 on the basis of a complex network , 2021, Computers & Industrial Engineering.

[5]  Bahram Alidaee,et al.  Integer Programming Formulations in Sequencing with Total Earliness and Tardiness Penalties, Arbitrary Due Dates, and No Idle Time: A Concise Review and Extension , 2021 .

[6]  Athanasios Rentizelas,et al.  Supporting Brazilian smallholder farmers decision making in supplying institutional markets , 2021, Eur. J. Oper. Res..

[7]  Marcelo Seido Nagano,et al.  Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review , 2020, Comput. Ind. Eng..

[8]  J. Hussain,et al.  Applications of machine learning and artificial intelligence for Covid-19 (SARS-CoV-2) pandemic: A review. , 2020, Chaos, solitons, and fractals.

[9]  Vincent Jost,et al.  Iterative beam search algorithms for the permutation flowshop , 2020, Eur. J. Oper. Res..

[10]  T. B. Alakus,et al.  Comparison of deep learning approaches to predict COVID-19 infection , 2020, Chaos, Solitons & Fractals.

[11]  K. Parmar,et al.  Study of ARIMA and least square support vector machine (LS-SVM) models for the prediction of SARS-CoV-2 confirmed cases in the most affected countries , 2020, Chaos, Solitons & Fractals.

[12]  Mohamed El Mohadab,et al.  Bibliometric method for mapping the state of the art of scientific production in Covid-19 , 2020, Chaos, Solitons & Fractals.

[13]  A. Behnood,et al.  Determinants of the infection rate of the COVID-19 in the U.S. using ANFIS and virus optimization algorithm (VOA) , 2020, Chaos, Solitons & Fractals.

[14]  Sümeyye Çakan.  Dynamic analysis of a mathematical model with health care capacity for COVID-19 pandemic , 2020, Chaos, Solitons & Fractals.

[15]  K. N. Nabi,et al.  Forecasting COVID-19 pandemic: A data-driven analysis , 2020, Chaos, Solitons & Fractals.

[16]  Mohammed A. Awadallah,et al.  Coronavirus herd immunity optimizer (CHIO) , 2020, Neural Computing and Applications.

[17]  Livio Fenga,et al.  CoViD19 Meta heuristic optimization based forecast method on time dependent bootstrapped data , 2020, medRxiv.

[18]  Hong Fan,et al.  Optimization Method for Forecasting Confirmed Cases of COVID-19 in China , 2020, Journal of clinical medicine.

[19]  Ruhul A. Sarker,et al.  Near-Optimal Heuristics for Just-In-Time Jobs Maximization in Flow Shop Scheduling , 2018, Algorithms.

[20]  Chin-Chia Wu,et al.  Single-machine scheduling and common due date assignment with potential machine disruption , 2018, Int. J. Prod. Res..

[21]  Hamed Samarghandi,et al.  On the exact solution of the no-wait flow shop problem with due date constraints , 2017, Comput. Oper. Res..

[22]  Victor Fernandez-Viagas,et al.  A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation , 2017, Eur. J. Oper. Res..

[23]  Liang Gao,et al.  An effective multi-objective discrete virus optimization algorithm for flexible job-shop scheduling problem with controllable processing times , 2017, Comput. Ind. Eng..

[24]  Hassan Khotanlou,et al.  Virulence Optimization Algorithm , 2016, Appl. Soft Comput..

[25]  Hui Zhao,et al.  A novel nature-inspired algorithm for optimization: Virus colony search , 2016, Adv. Eng. Softw..

[26]  Jose M. Framinan,et al.  Assessing scheduling policies in a permutation flowshop with common due dates , 2015 .

[27]  Adam Janiak,et al.  A survey on scheduling problems with due windows , 2015, Eur. J. Oper. Res..

[28]  Hamed Samarghandi,et al.  A particle swarm optimisation for the no-wait flow shop problem with due date constraints , 2015 .

[29]  Jose M. Framiñan,et al.  New hard benchmark for flowshop scheduling problems minimising makespan , 2015, Eur. J. Oper. Res..

[30]  Rym M'Hallah,et al.  Minimizing total earliness and tardiness on a permutation flow shop using VNS and MIP , 2014, Comput. Ind. Eng..

[31]  Quan-Ke Pan,et al.  An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem , 2014 .

[32]  Yun-Chia Liang,et al.  A self-adaptive virus optimization algorithm for continuous optimization problems , 2013, Soft Computing.

[33]  Enric Crespo,et al.  Minimizing weighted earliness–tardiness on a single machine with a common due date using quadratic models , 2012 .

[34]  Quan-Ke Pan,et al.  Local search methods for the flowshop scheduling problem with flowtime minimization , 2012, Eur. J. Oper. Res..

[35]  Jose M. Framiñan,et al.  Setting a common due date in a constrained flowshop: A variable neighbourhood search approach , 2010, Comput. Oper. Res..

[36]  Zu-Hsu Lee,et al.  Effective on-line algorithms for reliable due date quotation and large-scale scheduling , 2008, J. Sched..

[37]  Rubén Ruiz,et al.  Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics , 2008, Comput. Oper. Res..

[38]  Daniel Oron,et al.  Due-date assignment and maintenance activity scheduling problem , 2006, Math. Comput. Model..

[39]  Frank Werner,et al.  Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey , 2004, Math. Comput. Model..

[40]  Jatinder N. D. Gupta,et al.  An empirical analysis of integer programming formulations for the permutation flowshop , 2004 .

[41]  Pankaj Chandra,et al.  Permutation flow shop scheduling with earliness and tardiness penalties , 2004 .

[42]  Chengbin Chu,et al.  Due date assignment and scheduling: Slk, TWK and other due date assignment models , 2002 .

[43]  Fan T. Tseng,et al.  Two MILP models for the N × M SDST flowshop sequencing problem , 2001 .

[44]  Christos Koulamas,et al.  The Total Tardiness Problem: Review and Extensions , 1994, Oper. Res..

[45]  Ching-Jong Liao,et al.  An Improved Formulation for the Job-Shop Scheduling Problem , 1992 .

[46]  P. De,et al.  Optimal due-date assignment and sequencing , 1992 .

[47]  Suresh P. Sethi,et al.  Earliness-Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date , 1991, Oper. Res..

[48]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[49]  John M. Wilson,et al.  Alternative Formulations of a Flow-shop Scheduling Problem , 1989 .

[50]  T.C.E. Cheng,et al.  Survey of scheduling research involving due date determination decisions , 1989 .

[51]  Edward F. Stafford,et al.  On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem , 1988 .

[52]  M. Quaddus.  A Generalized Model of Optimal Due-Date Assignment by Linear Programming , 1987 .

[53]  Gary L. Ragatz,et al.  A framework for the study of due date management in job shops , 1984 .

[54]  Alan S. Manne,et al.  On the Job-Shop Scheduling Problem , 1960 .

[55]  Harvey M. Wagner,et al.  An integer linear‐programming model for machine scheduling , 1959 .

[56]  Yasmin A. Rios-Solis,et al.  Just-in-time systems , 2012 .

[57]  Chao-Hsien Pan,et al.  A study of integer programming formulations for scheduling problems , 1997, Int. J. Syst. Sci..

[58]  Tapan Sen,et al.  A state-of-art survey of static scheduling research involving due dates , 1984 .