| Publication | Date of Publication | Type |
|---|
Inertial self-adaptive algorithms for solving non-smooth convex optimization problems
Numerical Algorithms | 2025-01-10 | Paper |
Distributed fast F-T control for UAV formation in the presence of unknown input disturbances
International Journal of Robust and Nonlinear Control | 2024-08-21 | Paper |
Online early work scheduling on parallel machines
European Journal of Operational Research | 2024-08-13 | Paper |
Dynamic pyroelectric properties of a ferroelectric bilayer film
Chinese Journal of Physics (Taipei) | 2024-05-08 | Paper |
Exact approaches to late work scheduling on unrelated machines
International Journal of Applied Mathematics and Computer Science | 2023-09-07 | Paper |
Two-machine flow-shop scheduling to minimize total late work: revisited
Engineering Optimization | 2022-12-23 | Paper |
Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work
Engineering Optimization | 2022-12-23 | Paper |
A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\)
Journal of Combinatorial Optimization | 2022-10-18 | Paper |
Two-machine flow shop scheduling with a common due date to maximize total early work
European Journal of Operational Research | 2022-03-18 | Paper |
A note on multimachine scheduling with weighted early/late work criteria and common due date
Mathematical Problems in Engineering | 2022-01-24 | Paper |
Design of standoff cooperative target-tracking guidance laws for autonomous unmanned aerial vehicles
Mathematical Problems in Engineering | 2022-01-24 | Paper |
Mirror scheduling problems with early work and late work criteria
Journal of Scheduling | 2022-01-14 | Paper |
Semi-online scheduling on two identical machines with a common due date to maximize total early work
Discrete Applied Mathematics | 2021-01-13 | Paper |
Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
European Journal of Operational Research | 2020-02-25 | Paper |
Scheduling on parallel identical machines with late work criterion: offline and online cases
Journal of Scheduling | 2018-02-28 | Paper |
Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited
Theoretical Computer Science | 2017-03-16 | Paper |
Complexity of problem \(TF2|v=1,c=2|C_{\max}\)
Information Processing Letters | 2015-11-05 | Paper |
Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
International Journal of Computer Mathematics | 2015-04-27 | Paper |
Online minimum makespan scheduling with a buffer
International Journal of Foundations of Computer Science | 2014-11-14 | Paper |
Semi-online hierarchical scheduling problems with buffer or rearrangements
Information Processing Letters | 2013-03-20 | Paper |
Online scheduling with one rearrangement at the end: revisited
Information Processing Letters | 2012-10-23 | Paper |
Ant colony optimization algorithm based on visual feedback and behavioral memory
Journal of Software | 2012-10-05 | Paper |
Online minimum makespan scheduling with a buffer
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
Optimal algorithms for online scheduling with bounded rearrangement at the end
Theoretical Computer Science | 2012-01-09 | Paper |
