Juan Zou

ORCID: 0000-0003-0079-101X
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Scheduling and Optimization Algorithms
  • Optimization and Search Problems
  • Advanced Manufacturing and Logistics Optimization
  • Optimization and Packing Problems
  • Soil Carbon and Nitrogen Dynamics
  • Complexity and Algorithms in Graphs
  • Hydrocarbon exploration and reservoir analysis
  • Metaheuristic Optimization Algorithms Research
  • Assembly Line Balancing Optimization
  • Facility Location and Emergency Management
  • Vehicle Routing Optimization Methods
  • Geological Studies and Exploration
  • Catalysis and Hydrodesulfurization Studies
  • Cryptography and Data Security
  • Material Properties and Processing
  • NMR spectroscopy and applications
  • Mesoporous Materials and Catalysis
  • Atmospheric and Environmental Gas Dynamics
  • Methane Hydrates and Related Phenomena
  • Advanced Control Systems Design
  • Biomedical and Engineering Education
  • Advanced DC-DC Converters
  • Metal-Organic Frameworks: Synthesis and Applications
  • Fuzzy and Soft Set Theory
  • Advanced Multi-Objective Optimization Algorithms

China Institute of Atomic Energy
2024

Qufu Normal University
2007-2023

Hubei Academy of Agricultural Sciences
2021

China University of Geosciences
2017-2018

PetroChina Southwest Oil and Gas Field Company (China)
2016

West China Second University Hospital of Sichuan University
2016

Southwest Petroleum University
2014

East China Jiaotong University
2012

Xiangtan University
2011

Institute of Information Engineering
2011

The resource potential, "fractured" reservoir, reservoir type and stimulation technology of Jurassic tight oil in central Sichuan basin were investigated. Based on the evaluation method resource, amount resources five layers estimated at 1.6 billion tons, showing that potential Basin is huge. Integrated analysis static dynamic data including core-description, thin section examination, well test exploration show reservoirs are fracture-pore with ultra-low porosity, super-low permeability,...

10.1016/s1876-3804(16)30113-6 article EN cc-by-nc-nd Petroleum Exploration and Development 2016-12-01

In this paper, a connectedness in stratified L-generalized convergence spaces, is defined and discussed. This different from Jäger's connectedness, particular, it for L-subsets however crisp subsets. Thus give partly answer to question 2016: define lattice-valued spaces. Then the basic properties of are

10.2989/16073606.2018.1441920 article EN Quaestiones Mathematicae 2018-03-16

Taking the B bed of second submember member Triassic Jialingjiang Formation in Moxi gas field as an example, basic characteristics and controlling factors “Khali” powder dolomite reservoir is analyzed systematically, genesis forming mechanism crystal are examined. Logging core analysis show that has intercrystalline pores dissolved main storage space, mainly lamellar throats, good configuration between medium porosity low permeability, representing typical porous-type reservoir....

10.1016/s1876-3804(14)60066-5 article EN cc-by-nc-nd Petroleum Exploration and Development 2014-08-01

In this paper, we consider the parallel-machine scheduling with step-deteriorating jobs. The actual processing time of each job deteriorates as a step function if its starting is beyond given deteriorating date. We focus on case common For minimization problem total completion time, first show that NP-hard in strong sense. Then propose one property any optimal schedule. Furthermore, prove two special cases normal or penalty are polynomially solvable. weighted analyze NP-hardness and present...

10.1142/s0217595922400115 article EN Asia Pacific Journal of Operational Research 2022-02-14

10.1016/j.tcs.2020.05.038 article EN publisher-specific-oa Theoretical Computer Science 2020-06-01

10.1007/s40305-013-0014-y article EN Journal of the Operations Research Society of China 2013-05-23

We consider the problems of scheduling deteriorating jobs with release dates on a single machine (parallel machines) and can be rejected by paying penalties. The processing time job is simple linear increasing function its starting time. For model, objective to minimize maximum lateness accepted plus total penalty jobs. show that problem NP-hard in strong sense presents fully polynomial approximation scheme solve it when all have agreeable due dates. parallel-machine delivery completion When...

10.1155/2014/170475 article EN cc-by Mathematical Problems in Engineering 2014-01-01

High-spin states of $^{94}\mathrm{Nb}$ have been studied by in-beam $\ensuremath{\gamma}$-ray spectroscopic methods using the $^{82}\mathrm{Se}(^{18}\mathrm{O},p5n)^{94}\mathrm{Nb}$ reaction at beam energies 82 and 88 MeV. Particle-$\ensuremath{\gamma}\text{\ensuremath{-}}\ensuremath{\gamma}$ coincidence measurements CsI high-purity germanium arrays are employed to gain selectivity Nb isotopic products. The level scheme has extended up excitation energy...

10.1103/physrevc.110.054309 article EN Physical review. C 2024-11-12

We consider the unbounded parallel batch scheduling with deterioration, release dates, and rejection. Each job is either accepted processed on a single batching machine, or rejected by paying penalties. The processing time of simple linear increasing function its starting time. objective to minimize sum makespan jobs total penalty jobs. First, we show that problem NP-hard in ordinary sense. Then, present two pseudopolynomial algorithms fully polynomial-time approximation scheme solve this...

10.1155/2014/270942 article EN cc-by The Scientific World JOURNAL 2014-01-01

Original scientific

10.17559/tv-20150312154507 article EN cc-by Tehnicki vjesnik - Technical Gazette 2015-01-01

We consider several single machine scheduling problems in which the processing time of a job is simple linear increasing function its starting and each has delivery time. The objectives are to minimize functions about completion times. For former three problems, we propose polynomial-time algorithms solve them. last problem, prove that it NP-hard when all jobs have release dates.

10.11648/j.acm.20140303.13 article EN Applied and Computational Mathematics 2014-01-01

Many practical problems emphasize the importance of not only knowing whether an element is selected but also deciding to what extent it selected, which imposes a challenge on submodule optimization. In this study, we consider monotone, nondecreasing, and non-submodular maximization integer lattice with cardinality constraint. We first design two-pass streaming algorithm by refining estimation interval optimal value. For each element, decides save gives number reservations. Then, introduce...

10.26599/tst.2022.9010031 article EN Tsinghua Science & Technology 2023-05-19

Biochar application to soils is currently considered as a means of mitigating climate change by sequestering C, which withdraws CO2 from the atmosphere and consequently influences trend global change. However, only few studies have been done on surface albedo variations farmland, it might be true that biochar soil could induce radiative forcing changing albedo. Based this background, study aiming at characterization seasonal changes in farmland both with plants without plants, its effect...

10.13227/j.hjkx.201609149 article EN PubMed 2017-04-08

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

A facile method has been developed to prepare highly dispersed <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M2"><mml:mrow><mml:mi>α</mml:mi><mml:msub><mml:mrow><mml:mtext>-MoC</mml:mtext></mml:mrow><mml:mrow><mml:mtext>1</mml:mtext><mml:mo>-</mml:mo><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math> in porous silica. By utilizing C atoms methyl modified silica supports,...

10.1155/2013/725970 article EN cc-by Journal of Catalysts 2013-10-24

This paper mainly discusses machine scheduling problems with job rejection and DeJong's learning effect. The goal is to determine the sequence of accepted jobs so as minimize cost plus total penalty rejected jobs. costs are makespan completion time. For single-machine setting, we show that both objectives can be optimally solved in polynomial parallel-machine minimizing time still polynomially solvable, whereas other problem $ NP $-hard, for which provide a fully polynomial-time...

10.3934/mfc.2022024 article EN Mathematical Foundations of Computing 2022-07-13
Coming Soon ...