Guanghua Wu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Guanghua Wu has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Hongli Zhu
School of Business Administration, Shandong Technology and Business University, Yantai, China
2 shared publications - Congcong Liu
School of Electrical Engineering, Shandong University, Jinan 250061, China
1 shared publication - Wenzhen Qu
School of Mathematics and Statistics, Qingdao University, Qingdao 266071, PR China
1 shared publication - Yanjun Gao
School of Foreign Languages, Shandong Technology and Business University, Shangdong Province, China
1 shared publication Ziqiang Bai
School of Automation, Qingdao University, Qingdao, 266071, China
1 shared publication
Latest Publications
- Open Access
- 24 November 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (23) , 3678
Single-Machine Rescheduling with Rejection and an Operator No-Availability Period
In this paper, we investigate a rescheduling problem with rejection and an operator non-availability period on a single machine. An optimal original schedule with the objective of minimizing the total weighted completion time has been made in a deterministic production scheduling system without an unavailable interval. However, prior to the start of formal job processing, a time interval becomes unavailable due to the operator. No jobs can start or complete in the interval; nonetheless, a job that begins prior to this interval and finishes afterward is possible (if there is such a job, we call it a crossover job). In order to deal with the operator non-availability period, job rejection is allowed. Each job is either accepted for processing or rejected by paying a rejection cost. The planned original schedule is required to be rescheduled. The objective is to minimize the total weighted completion time of the accepted jobs plus the total penalty of the rejected jobs plus the weighted maximum tardiness penalty between the original schedule and the new reschedule. We present a pseudo-polynomial time dynamic programming exact algorithm and subsequently develop it into a fully polynomial time approximation scheme.
- 24 November 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (23) , 3678
Open AccessSingle-Machine Rescheduling with Rejection and an Operator No-Availability Period
In this paper, we investigate a rescheduling problem with rejection and an operator non-availability period on a single machine. An optimal original schedule with the objective of minimizing the total weighted completion time has been made in a deterministic production scheduling system without an unavailable interval. However, prior to the start of formal job processing, a time interval becomes unavailable due to the operator. No jobs can start or complete in the interval; nonetheless, a job that begins prior to this interval and finishes afterward is possible (if there is such a job, we call it a crossover job). In order to deal with the operator non-availability period, job rejection is allowed. Each job is either accepted for processing or rejected by paying a rejection cost. The planned original schedule is required to be rescheduled. The objective is to minimize the total weighted completion time of the accepted jobs plus the total penalty of the rejected jobs plus the weighted maximum tardiness penalty between the original schedule and the new reschedule. We present a pseudo-polynomial time dynamic programming exact algorithm and subsequently develop it into a fully polynomial time approximation scheme.
- Open Access
- 1 January 2024
- Published by Tech Science Press in Computer Modeling in Engineering & Sciences
- Vol. 138 (3) , 2955-2972
An Effective Meshless Approach for Inverse Cauchy Problems in 2D and 3D Electroelastic Piezoelectric Structures
In the past decade, notable progress has been achieved in the development of the generalized finite difference method (GFDM). The underlying principle of GFDM involves dividing the domain into multiple sub-domains. Within each sub-domain, explicit formulas for the necessary partial derivatives of the partial differential equations (PDEs) can be obtained through the application of Taylor series expansion and moving-least square approximation methods. Consequently, the method generates a sparse coefficient matrix, exhibiting a banded structure, making it highly advantageous for large-scale engineering computations. In this study, we present the application of the GFDM to numerically solve inverse Cauchy problems in two- and three-dimensional piezoelectric structures. Through our preliminary numerical experiments, we demonstrate that the proposed GFDM approach shows great promise for accurately simulating coupled electroelastic equations in inverse problems, even with 3% errors added to the input data.
- 1 January 2024
- Published by Tech Science Press in Computer Modeling in Engineering & Sciences
- Vol. 138 (3) , 2955-2972
Open AccessAn Effective Meshless Approach for Inverse Cauchy Problems in 2D and 3D Electroelastic Piezoelectric Structures
In the past decade, notable progress has been achieved in the development of the generalized finite difference method (GFDM). The underlying principle of GFDM involves dividing the domain into multiple sub-domains. Within each sub-domain, explicit formulas for the necessary partial derivatives of the partial differential equations (PDEs) can be obtained through the application of Taylor series expansion and moving-least square approximation methods. Consequently, the method generates a sparse coefficient matrix, exhibiting a banded structure, making it highly advantageous for large-scale engineering computations. In this study, we present the application of the GFDM to numerically solve inverse Cauchy problems in two- and three-dimensional piezoelectric structures. Through our preliminary numerical experiments, we demonstrate that the proposed GFDM approach shows great promise for accurately simulating coupled electroelastic equations in inverse problems, even with 3% errors added to the input data.
- Open Access
- 25 June 2023
- Published by MDPI AG in Sustainability
- Vol. 15 (13) , 10021
Cold Chain Logistics Network Design for Fresh Agricultural Products with Government Subsidy
This paper investigates the cold chain logistics network design in the first mile for fresh agricultural products with government subsidy, involving the capacity, location of cold storage facilities, and transportation from production areas to cold storage facilities after harvest. A bi-level programming model is formulated considering the quality degradation of fresh agricultural products. Based on the proposition and KKT conditions, a solution method is designed for reformulating the bi-level model into a single-level programming model. Numerical experiments are conducted to verify the proposed model. Experimental results show that the solution method efficiently solves the problem of the cold chain logistics network design for fresh agricultural products with subsidy, and sensitivity analysis provides managerial insights for decision-makers.
- 25 June 2023
- Published by MDPI AG in Sustainability
- Vol. 15 (13) , 10021
Open AccessCold Chain Logistics Network Design for Fresh Agricultural Products with Government Subsidy
This paper investigates the cold chain logistics network design in the first mile for fresh agricultural products with government subsidy, involving the capacity, location of cold storage facilities, and transportation from production areas to cold storage facilities after harvest. A bi-level programming model is formulated considering the quality degradation of fresh agricultural products. Based on the proposition and KKT conditions, a solution method is designed for reformulating the bi-level model into a single-level programming model. Numerical experiments are conducted to verify the proposed model. Experimental results show that the solution method efficiently solves the problem of the cold chain logistics network design for fresh agricultural products with subsidy, and sensitivity analysis provides managerial insights for decision-makers.