Publication | Date of Publication | Type |
---|
Asynchronous control for nonlinear switched stochastic delayed systems with weighted mode-dependent average dwell time | 2024-12-03 | Paper |
Scheduling double-track gantry cranes to minimize the overall loading/unloading time | 2024-05-23 | Paper |
Approximating the directed path partition problem | 2024-03-27 | Paper |
Approximation algorithms and a hardness result for the three-machine proportionate mixed shop | 2023-10-16 | Paper |
Approximation algorithms for the directed path partition problems | 2023-08-10 | Paper |
An improved algorithm for parallel machine scheduling under additional resource constraints | 2023-03-24 | Paper |
A 21/16-Approximation for the Minimum 3-Path Partition Problem | 2023-02-03 | Paper |
Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints | 2023-01-04 | Paper |
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles | 2022-12-22 | Paper |
A local search 4/3-approximation algorithm for the minimum 3-path partition problem | 2022-10-31 | Paper |
Approximation algorithms for the maximally balanced connected graph tripartition problem | 2022-10-04 | Paper |
Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints | 2022-06-29 | Paper |
The Berry-Ess\'{e}en Upper Bounds of Vasicek Model Estimators | 2022-05-29 | Paper |
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph | 2022-04-13 | Paper |
Approximation algorithms for maximally balanced connected graph partition | 2022-01-18 | Paper |
The limit of mesoscopic one-way fluxes in a nonequilibrium chemical reaction with complex mechanism | 2021-11-14 | Paper |
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles | 2021-08-11 | Paper |
Improved hardness and approximation results for single allocation hub location | 2021-07-05 | Paper |
An improved algorithm for a two-stage production scheduling problem with an outsourcing option | 2021-06-23 | Paper |
A randomized approximation algorithm for metric triangle packing | 2021-05-11 | Paper |
A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem | 2021-05-03 | Paper |
Improved hardness and approximation results for single allocation hub location problems | 2021-04-08 | Paper |
A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem | 2020-11-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q5128459 | 2020-10-27 | Paper |
Improved approximation algorithms for path vertex covers in regular graphs | 2020-10-12 | Paper |
A randomized approximation algorithm for metric triangle packing | 2020-05-13 | Paper |
Approximation algorithms for maximally balanced connected graph partition | 2020-05-13 | Paper |
Approximation algorithms for the three-machine proportionate mixed shop scheduling | 2019-12-27 | Paper |
Open-shop scheduling for unit jobs under precedence constraints | 2019-12-27 | Paper |
Approximation algorithms for the maximum weight internal spanning tree problem | 2019-10-17 | Paper |
A local search \(4/3\)-approximation algorithm for the minimum 3-path partition problem | 2019-10-11 | Paper |
Open-shop scheduling for unit jobs under precedence constraints | 2019-10-11 | Paper |
Approximation algorithms for vertex happiness | 2019-10-04 | Paper |
Online scheduling with unit processing times and processing set restrictions | 2019-10-04 | Paper |
An improved approximation algorithm for the minimum 3-path partition problem | 2019-06-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q4690459 | 2018-10-22 | Paper |
Approximation algorithms for two-machine flow-shop scheduling with a conflict graph | 2018-10-04 | Paper |
On the NP-hardness of scheduling with time restrictions | 2018-08-17 | Paper |
Approximate the scheduling of quay cranes with non-crossing constraints | 2018-05-25 | Paper |
Combinatorial approximation algorithms for spectrum assignment problem in chain and ring networks | 2018-02-26 | Paper |
Approximation algorithms for the maximum weight internal spanning tree problem | 2017-10-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q5282667 | 2017-07-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q2983631 | 2017-05-17 | Paper |
Better permutations for the single-processor scheduling with time restrictions | 2017-04-20 | Paper |
Scheduling jobs with equal processing times and a single server on parallel identical machines | 2016-09-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q3466910 | 2016-01-25 | Paper |
Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time | 2015-09-24 | Paper |
Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage | 2014-06-30 | Paper |
https://portal.mardi4nfdi.de/entity/Q4980800 | 2014-06-30 | Paper |
Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination | 2013-12-17 | Paper |
A new three-machine shop scheduling: complexity and approximation algorithm | 2013-12-09 | Paper |
Approximation algorithms for parallel open shop scheduling | 2013-03-20 | Paper |
Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance | 2012-07-16 | Paper |
Parallel machines scheduling with machine maintenance for minsum criteria | 2012-05-14 | Paper |
Single machine scheduling with semi-resumable machine availability constraints | 2012-01-27 | Paper |
Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time | 2011-06-03 | Paper |