A5027216962- Optimization and Search Problems
- Scheduling and Optimization Algorithms
- Optimization and Packing Problems
- Advanced Manufacturing and Logistics Optimization
- Complexity and Algorithms in Graphs
- Auction Theory and Applications
- graph theory and CDMA systems
- Computational Geometry and Mesh Generation
- Game Theory and Applications
- Game Theory and Voting Systems
- Distributed and Parallel Computing Systems
- Advanced Graph Theory Research
- Transportation and Mobility Innovations
- Food composition and properties
- Smart Parking Systems Research
- Sharing Economy and Platforms
- Graph Labeling and Dimension Problems
- Vehicle Routing Optimization Methods
- Interconnection Networks and Systems
- Manufacturing Process and Optimization
- Advanced Bandit Algorithms Research
- Caching and Content Delivery
- Economic theories and models
- Advanced Wireless Network Optimization
- Rough Sets and Fuzzy Logic
Zhejiang University
2015-2024
Huzhou University
2024
Zhejiang University of Science and Technology
2011-2021
Henan University
2017
Hangzhou Dianzi University
2010-2016
The University of Texas at Dallas
2015
Zhejiang A & F University
2014
University of Warwick
2013
University of Freiburg
2004
University of Fribourg
2004
Abstract We deal with the problem of minimizing makespan on a single batch processing machine. In this problem, each job has both time and size (capacity requirement). The machine can process number jobs simultaneously as long total these being processed does not exceed capacity. is just longest in batch. An approximation algorithm worst‐case ratio 3/2 given for version where times large (with sizes greater than 1/2) are less those small 1/2). This result best possible unless P = NP . For...
Abstract We consider problem of scheduling jobs on‐line on batch processing machines with dynamic job arrivals to minimize makespan. A machine can handle up B simultaneously. The that are processed together from a batch, and all in start complete at the same time. time is given by longest any batch. Each becomes available its arrival time, which unknown advance, known upon arrival. In first part this paper, we address single problem. First deal two variants: unbounded model where...
The effect of aluminum and chromium on two barley genotypes differing in Al tolerance was studied a hydroponic experiment. stress decreased plant growth, biomass production, chlorophyll content photosynthetic efficiency determined as variable to maximum fluorescence ratio (Fv/Fm), net rate (PN), intercellular CO2 concentration (ci), stomatal conductance (gs) transpiration (E) less an Al-tolerant genotype Gebeina than Al-sensitive Shang 70-119. Cr also caused marked reduction growth traits...
We consider the following rectangle packing problem: Given a set of rectangles, each which is associated with profit, we are requested to pack subset rectangles into bigger maximize total profit packed. The may not overlap and or be rotated. This problem strongly NP-hard even for squares identical profits. A simple (3 + e)-approximation algorithm presented. further improve by showing worst-case ratio at most 5/2 e. Finally devise (2 algorithm. number restricted cases also considered.
Abstract Vast agricultural areas are affected by flooding, causing up to 80% yield reduction and resulting in multibillion dollar losses. Up now, the focus of plant breeders was predominantly on detrimental effects anoxia, while other (potentially equally important) traits were essentially neglected; one these is soil elemental toxicity. Excess water triggers a progressive decrease redox potential, thus increasing concentration Mn 2+ that can be toxic plants if above specific threshold. This...
We study the problem of guaranteeing connectivity a given graph by protecting or strengthening edges. Herein, protected edge is assumed to be robust and will not fail, which features non-uniform failure model. introduce $(p,q)$-Steiner-Connectivity Preservation where we protect minimum-cost set edges such that underlying maintains $p$-edge-connectivity between terminal pairs against failures, assuming at most $q$ unprotected can fail. design polynomial-time exact algorithms for cases $p$ are...
The 2D Online Bin Packing is a fundamental problem in Computer Science and the determination of its asymptotic competitive ratio has research attention. In long series papers, lower bound this been improved from 1.808, 1.856 to 1.907 upper reduced 3.25, 3.0625, 2.8596, 2.7834 2.66013. article, we rewrite record 2.5545. Our idea for improvement as follows. 2002, Seiden van Stee [Seiden 2003] proposed an elegant algorithm called H ⊗ C , comprised Harmonic Improved two-dimensional online bin...
We consider the Partition problem and propose a deterministic FPTAS (Fully Polynomial-Time Approximation Scheme) that runs in $\widetilde{O}(n + 1/\varepsilon)$-time. This is best possible (up to polylogarithmic factor) assuming Strong Exponential Time Hypothesis~[Abboud, Bringmann, Hermelin, Shabtay'22]. Prior our work, only randomized algorithm can achieve running time of 1/\varepsilon)$~[Chen, Lian, Mao Zhang '24], while $\widetilde{O}(n+1/\varepsilon^{5/4})$ time~[Deng, Jin '23] [Wu Chen '22].
We consider the problem of scheduling jobs on-line on parallel batch processing machines with dynamic job arrivals to minimize makespan. are given m identical machines, each which can handle up B (the capacity a machine) simultaneously. The that processed together form batch, and all in start complete at same time. time is constant, independent number identity jobs. Each becomes available its arrival time, unknown advance. First we deal unbounded case where infinite, derive an optimal...