Xin Han

From MaRDI portal
Person:388091

Available identifiers

zbMath Open han.xinMaRDI QIDQ388091

List of research outcomes

PublicationDate of PublicationType
An improved approximation algorithm for a scheduling problem with transporter coordination2024-04-02Paper
A modified inverse-free dynamical system for absolute value equations2024-01-15Paper
Flow shop scheduling problems with transportation constraints revisited2024-01-08Paper
Flow shop scheduling problems with transportation constraints revisited2023-08-10Paper
https://portal.mardi4nfdi.de/entity/Q58755902023-02-03Paper
A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\)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 constraint2022-04-13Paper
Approximation algorithms for two-stage flexible flow shop scheduling2020-02-03Paper
https://portal.mardi4nfdi.de/entity/Q51956702019-10-02Paper
Unit cost buyback problem2019-09-05Paper
Online knapsack problem under concave functions2019-08-20Paper
Proportional cost buyback problem with weight bounds2019-06-25Paper
Online Knapsack Problem Under Concave Functions2019-04-26Paper
https://portal.mardi4nfdi.de/entity/Q46236312019-02-22Paper
https://portal.mardi4nfdi.de/entity/Q46136732019-01-24Paper
A general bin packing game: interest taken into account2018-05-18Paper
Online buffer management for transmitting packets with processing cycles2018-04-04Paper
Scheduling on parallel identical machines with late work criterion: offline and online cases2018-02-28Paper
https://portal.mardi4nfdi.de/entity/Q31322262018-01-29Paper
Dynamic bin packing with unit fraction items revisited2017-11-03Paper
Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited2017-03-16Paper
Online bin packing problem with buffer and bounded size revisited2017-02-22Paper
Approximate strip packing: revisited2016-07-07Paper
Black and White Bin Packing Revisited2016-02-05Paper
Proportional Cost Buyback Problem with Weight Bounds2016-02-05Paper
Modified dispersion relations and (A)dS Schwarzschild black holes2016-01-12Paper
Online minimization knapsack problem2015-12-08Paper
Complexity of problem \(TF2|v=1,c=2|C_{\max}\)2015-11-05Paper
Bin Packing Game with an Interest Matrix2015-10-29Paper
Online bin packing with \((1,1)\) and \((2,R)\) bins2015-07-28Paper
Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs2015-04-27Paper
Online unweighted knapsack problem with removal cost2015-01-19Paper
https://portal.mardi4nfdi.de/entity/Q29347152014-12-18Paper
Randomized algorithms for online knapsack problems2014-12-02Paper
ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER2014-11-14Paper
Online algorithms for 1-space bounded 2-dimensional bin packing and square packing2014-10-06Paper
A new upper bound 2.5545 on 2D Online Bin Packing2014-09-09Paper
Online removable knapsack problem under convex function2014-06-06Paper
Randomized Algorithms for Removable Online Knapsack Problems2014-04-03Paper
Unit Cost Buyback Problem2014-01-14Paper
The Train Delivery Problem Revisited2014-01-14Paper
Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)2014-01-13Paper
2D knapsack: packing squares2013-12-19Paper
Online Bin Packing with (1,1) and (2,R) Bins2013-12-10Paper
A note on a selfish bin packing problem2013-08-07Paper
Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing2013-08-02Paper
A Harmonic Algorithm for the 3D Strip Packing Problem2013-07-24Paper
Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing and Square Packing2013-06-11Paper
Semi-online hierarchical scheduling problems with buffer or rearrangements2013-03-20Paper
Online scheduling with one rearrangement at the end: revisited2012-10-23Paper
Online Knapsack Problem with Removal Cost2012-09-25Paper
Online Minimum Makespan Scheduling with a Buffer2012-07-16Paper
Online removable knapsack with limited cuts2012-04-03Paper
Online call control in cellular networks revisited2012-03-09Paper
Optimal algorithms for online scheduling with bounded rearrangement at the end2012-01-09Paper
2D Knapsack: Packing Squares2011-06-03Paper
Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing2011-06-03Paper
Online scheduling with rearrangement on two related machines2011-02-21Paper
Online multiple-strip packing2011-01-28Paper
Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing2010-12-09Paper
Deadline scheduling and power management for speed bounded processors2010-10-11Paper
Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks2010-09-07Paper
Deterministic on-line call control in cellular networks2010-07-07Paper
A note on on-line broadcast scheduling with deadlines2010-06-16Paper
Online Minimization Knapsack Problem2010-05-11Paper
Online Knapsack Problems with Limited Cuts2009-12-17Paper
A note on online strip packing2009-07-10Paper
On-Line Multiple-Strip Packing2009-07-07Paper
Modified (A)dS Schwarzschild black holes in rainbow spacetime2009-04-21Paper
A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection2009-03-03Paper
Online removable square packing2008-06-06Paper
A fast asymptotic approximation scheme for bin packing with rejection2008-04-15Paper
Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs2008-01-04Paper
Strip Packing vs. Bin Packing2008-01-04Paper
Approximation and Online Algorithms2007-02-12Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Xin Han