Xin Han

From MaRDI portal
Person:388091



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Open shop scheduling problem with a flexible maintenance period: revisited
Theoretical Computer Science
2026-03-30Paper
Curved detonation equations with analysis and its applications
Journal of Fluid Mechanics
2024-12-04Paper
Three-stage assembly flow shop scheduling problem with a fixed maintenance period
Asia-Pacific Journal of Operational Research
2024-05-23Paper
An improved approximation algorithm for a scheduling problem with transporter coordination
Journal of Scheduling
2024-04-02Paper
A modified inverse-free dynamical system for absolute value equations
Journal of Nonlinear and Variational Analysis
2024-01-15Paper
Flow shop scheduling problems with transportation constraints revisited
Theoretical Computer Science
2024-01-08Paper
Flow shop scheduling problems with transportation constraints revisited
Lecture Notes in Computer Science
2023-08-10Paper
scientific article; zbMATH DE number 7650261 (Why is no real title available?)
(available as arXiv preprint)
2023-02-03Paper
A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\)
Journal of Combinatorial Optimization
2022-10-18Paper
Open shop scheduling problem with a non-resumable flexible maintenance period2022-06-29Paper
A PTAS for non-resumable open shop scheduling with an availability constraint
Journal of Combinatorial Optimization
2022-04-13Paper
Approximation algorithms for two-stage flexible flow shop scheduling
Journal of Combinatorial Optimization
2020-02-03Paper
Dynamic positioning adaptive controller design based on orthogonal neural network2019-10-02Paper
Unit cost buyback problem
Theory of Computing Systems
2019-09-05Paper
Online knapsack problem under concave functions
Theoretical Computer Science
2019-08-20Paper
Proportional cost buyback problem with weight bounds
Theoretical Computer Science
2019-06-25Paper
Online Knapsack Problem Under Concave Functions
Frontiers in Algorithmics
2019-04-26Paper
Approximation algorithm on two stage flexible flow-shop scheduling with parallel machines2019-02-22Paper
A new hybrid conjugate gradient algorithm for unconstrained optimization2019-01-24Paper
A general bin packing game: interest taken into account
Algorithmica
2018-05-18Paper
Online buffer management for transmitting packets with processing cycles
Theoretical Computer Science
2018-04-04Paper
Scheduling on parallel identical machines with late work criterion: offline and online cases
Journal of Scheduling
2018-02-28Paper
Research on online bin packing model with item size no more than \(\frac{1}{2}\)2018-01-29Paper
Dynamic bin packing with unit fraction items revisited
Information Processing Letters
2017-11-03Paper
Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited
Theoretical Computer Science
2017-03-16Paper
Online bin packing problem with buffer and bounded size revisited
Journal of Combinatorial Optimization
2017-02-22Paper
Approximate strip packing: revisited
Information and Computation
2016-07-07Paper
Proportional Cost Buyback Problem with Weight Bounds
Combinatorial Optimization and Applications
2016-02-05Paper
Black and White Bin Packing Revisited
Combinatorial Optimization and Applications
2016-02-05Paper
Modified dispersion relations and (A)dS Schwarzschild black holes
Physics Letters B
2016-01-12Paper
Online minimization knapsack problem
Theoretical Computer Science
2015-12-08Paper
Complexity of problem \(TF2|v=1,c=2|C_{\max}\)
Information Processing Letters
2015-11-05Paper
Bin packing game with an interest matrix
Lecture Notes in Computer Science
2015-10-29Paper
Online bin packing with \((1,1)\) and \((2,R)\) bins
Journal of Combinatorial Optimization
2015-07-28Paper
Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
International Journal of Computer Mathematics
2015-04-27Paper
Online unweighted knapsack problem with removal cost
Algorithmica
2015-01-19Paper
Harmonic algorithm for \(3\)-dimensional strip packing problem2014-12-18Paper
Randomized algorithms for online knapsack problems
Theoretical Computer Science
2014-12-02Paper
Online minimum makespan scheduling with a buffer
International Journal of Foundations of Computer Science
2014-11-14Paper
Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
Theoretical Computer Science
2014-10-06Paper
A new upper bound 2.5545 on 2D Online Bin Packing
ACM Transactions on Algorithms
2014-09-09Paper
Online removable knapsack problem under convex function
Theoretical Computer Science
2014-06-06Paper
Randomized algorithms for removable online knapsack problems
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management
2014-04-03Paper
The Train Delivery Problem Revisited
Algorithms and Computation
2014-01-14Paper
Unit cost buyback problem
Algorithms and Computation
2014-01-14Paper
Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
Theoretical Computer Science
2014-01-13Paper
2D knapsack: packing squares
Theoretical Computer Science
2013-12-19Paper
Online Bin Packing with (1,1) and (2,R) Bins
Combinatorial Optimization and Applications
2013-12-10Paper
A note on a selfish bin packing problem
Journal of Global Optimization
2013-08-07Paper
Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
Journal of Combinatorial Optimization
2013-08-02Paper
A harmonic algorithm for the 3D strip packing problem
SIAM Journal on Computing
2013-07-24Paper
Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
Lecture Notes in Computer Science
2013-06-11Paper
Semi-online hierarchical scheduling problems with buffer or rearrangements
Information Processing Letters
2013-03-20Paper
Online scheduling with one rearrangement at the end: revisited
Information Processing Letters
2012-10-23Paper
Online knapsack problem with removal cost
Lecture Notes in Computer Science
2012-09-25Paper
Online minimum makespan scheduling with a buffer
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management
2012-07-16Paper
Online removable knapsack with limited cuts
Theoretical Computer Science
2012-04-03Paper
Online call control in cellular networks revisited
Information Processing Letters
2012-03-09Paper
Optimal algorithms for online scheduling with bounded rearrangement at the end
Theoretical Computer Science
2012-01-09Paper
Online algorithm for 1-space bounded multi-dimensional bin packing
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management
2011-06-03Paper
2D knapsack: packing squares
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management
2011-06-03Paper
Online scheduling with rearrangement on two related machines
Theoretical Computer Science
2011-02-21Paper
Online multiple-strip packing
Theoretical Computer Science
2011-01-28Paper
Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
Algorithms and Computation
2010-12-09Paper
Deadline scheduling and power management for speed bounded processors
Theoretical Computer Science
2010-10-11Paper
Deterministic online call control in cellular networks and triangle-free cellular networks
Frontiers in Algorithmics
2010-09-07Paper
Deterministic on-line call control in cellular networks
Theoretical Computer Science
2010-07-07Paper
A note on on-line broadcast scheduling with deadlines
Information Processing Letters
2010-06-16Paper
Online minimization knapsack problem
Approximation and Online Algorithms
2010-05-11Paper
Online Knapsack Problems with Limited Cuts
Algorithms and Computation
2009-12-17Paper
A note on online strip packing
Journal of Combinatorial Optimization
2009-07-10Paper
On-Line Multiple-Strip Packing
Combinatorial Optimization and Applications
2009-07-07Paper
Modified (A)dS Schwarzschild black holes in rainbow spacetime
Classical and Quantum Gravity
2009-04-21Paper
A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
2009-03-03Paper
Online removable square packing
Theory of Computing Systems
2008-06-06Paper
A fast asymptotic approximation scheme for bin packing with rejection
Theoretical Computer Science
2008-04-15Paper
Strip Packing vs. Bin Packing
Algorithmic Aspects in Information and Management
2008-01-04Paper
Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs
Algorithmic Aspects in Information and Management
2008-01-04Paper
Approximation and Online Algorithms
Lecture Notes in Computer Science
2007-02-12Paper


Research outcomes over time


This page was built for person: Xin Han