Jie Gao

ORCID: 0009-0004-1763-9449
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Optimization and Search Problems
  • Scheduling and Optimization Algorithms
  • Advanced Manufacturing and Logistics Optimization
  • Mathematical and Theoretical Epidemiology and Ecology Models
  • Ecosystem dynamics and resilience
  • Evolution and Genetic Dynamics
  • Supply Chain and Inventory Management

Northeastern University
2024

Qufu Normal University
2022

In this paper, two prey–predator models with distributed delays are presented based on the growth and loss rates of predator, which much smaller than that prey, leading to a singular perturbation problem. It is obtained Hopf bifurcation can occur, where coexistence equilibrium becomes unstable stable limit cycle. Subsequently, considering parameter [Formula: see text], fact solution crossing transcritical point converges discussed for model Holling type I using linear chain criterion,...

10.1142/s0218127424500317 article EN International Journal of Bifurcation and Chaos 2024-03-06

We consider parallel identical machines scheduling problems with deteriorating maintenance activities and the option of job rejection. Each machine has at most one activity. The length each activity increases linearly its starting time. location on needs to be determined. goal is find sequence jobs minimize cost; we further model by allowing A either accepted processed machines, or rejected. determine cost plus total rejection penalty rejected jobs. When makespan, design a pseudo-polynomial...

10.1142/s0217595922400139 article EN Asia Pacific Journal of Operational Research 2022-04-18

In this paper, we study the single-machine scheduling problems with DeJong’s learning effect and deteriorating maintenance activity, where is a special position-based duration of activity linear increasing function its starting time. Our goal to determine job sequence all jobs position minimize some performance measures. When measures are makespan total completion time, show that both them can be solved in polynomial measure weighted develop pseudo-polynomial time dynamic programming...

10.1142/s0129054122460030 article EN International Journal of Foundations of Computer Science 2022-12-31
Coming Soon ...