| Publication | Date of Publication | Type |
|---|
| A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty | 2024-04-02 | Paper |
| Fixed interval scheduling with third‐party machines | 2023-12-11 | Paper |
| Min‐sum controllable risk problems with concave risk functions of the same value range | 2023-12-11 | Paper |
| Integer knapsack problems with profit functions of the same value range | 2023-10-24 | Paper |
| Maximizing total early work in a distributed two‐machine flow‐shop | 2023-10-24 | Paper |
| Single machine scheduling with assignable due dates to minimize maximum and total late work | 2023-07-10 | Paper |
| Cost minimizing planning of container inspection and repair in multiple facilities | 2023-06-26 | Paper |
| Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint | 2023-06-07 | Paper |
| A Computational Analysis Of Balanced Jit Optimization Algorithms | 2023-04-24 | Paper |
| Selecting a subset of diverse points based on the squared Euclidean distance | 2022-08-11 | Paper |
| Fleet and charging infrastructure decisions for fast-charging city electric bus service | 2022-03-09 | Paper |
| No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines | 2022-03-07 | Paper |
| Min-max controllable risk problems | 2021-07-14 | Paper |
| Provision-after-wait with preferences ordered by difference: tighter complexity and better approximation | 2021-06-03 | Paper |
| Maximum diversity problem with squared Euclidean distance | 2020-05-19 | Paper |
| Lot-size scheduling of a single product on unrelated parallel machines | 2020-04-27 | Paper |
| Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity | 2020-01-22 | Paper |
| Bi-criteria path problem with minimum length and maximum survival probability | 2020-01-15 | Paper |
| Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\) | 2019-10-07 | Paper |
| Comments on ``Proportionate flowshops with general position dependent processing times and ``Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection | 2019-05-10 | Paper |
| Multiproduct batching and scheduling with buffered rework: The case of a car paint shop | 2019-05-02 | Paper |
| A parallel machine schedule updating game with compensations and clients averse to uncertain loss | 2018-12-17 | Paper |
| Minimizing the number of workers in a paced mixed-model assembly line | 2018-10-30 | Paper |
| An overview of revenue management and dynamic pricing models in hotel business | 2018-08-10 | Paper |
| Simple paths with exact and forbidden lengths | 2018-06-06 | Paper |
| A note on scheduling container storage operations of two non‐passing stacking cranes | 2018-04-27 | Paper |
| Optimal workforce assignment to operations of a paced assembly line | 2018-02-01 | Paper |
| Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity | 2018-01-12 | Paper |
| Knapsack problem with objective value gaps | 2017-06-29 | Paper |
| Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem | 2017-06-13 | Paper |
| Graphs with maximal induced matchings of the same size | 2016-11-24 | Paper |
| Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom | 2016-11-17 | Paper |
| Two faster algorithms for coordination of production and batch delivery: a note | 2016-07-06 | Paper |
| Batch scheduling with deadlines on parallel machines: an NP-hard case | 2016-05-26 | Paper |
| Two-agent scheduling with agent specific batches on an unbounded serial batching machine | 2015-11-12 | Paper |
| On a single machine-scheduling problem with separated position and resource effects | 2015-04-28 | Paper |
| Erratum to: ``Internet shopping with price-sensitive discounts | 2015-02-23 | Paper |
| Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence | 2015-01-22 | Paper |
| Internet shopping with price sensitive discounts | 2014-09-26 | Paper |
| Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs | 2014-08-01 | Paper |
| Mathematical Caricature of Large Waves | 2014-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2861568 | 2013-11-08 | Paper |
| Complexity of buffer capacity allocation problems for production lines with unreliable machines | 2013-09-26 | Paper |
| Strong NP-hardness of scheduling problems with learning or aging effect | 2013-09-03 | Paper |
| Soft due window assignment and scheduling of unit-time jobs on parallel machines | 2013-02-18 | Paper |
| Two-Agent Scheduling on an Unbounded Serial Batching Machine | 2012-11-02 | Paper |
| Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence | 2012-07-12 | Paper |
| Scheduling a single server in a two-machine flow shop | 2012-06-04 | Paper |
| Multi-product lot-sizing and sequencing on a single imperfect machine | 2012-04-12 | Paper |
| Scheduling an unbounded batching machine with job processing time compatibilities | 2012-03-19 | Paper |
| Minimizing the number of late jobs on a single machine under due date uncertainty | 2012-01-16 | Paper |
| Batch Scheduling of Deteriorating Products | 2011-06-28 | Paper |
| An FPTAS for a supply scheduling problem with non-monotone cost functions | 2011-04-28 | Paper |
| The simplified partial digest problem: approximation and a graph-theoretic model | 2011-01-28 | Paper |
| Creative heritage of Vyacheslav Sergeevich Tanaev: seventieth anniversary | 2011-01-03 | Paper |
| A generic approach to proving NP-hardness of partition type problems | 2010-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3161287 | 2010-10-14 | Paper |
| Internet shopping optimization problem | 2010-09-02 | Paper |
| On the approximability of the simplified partial digest problem | 2010-04-28 | Paper |
| Lot-Sizing and Sequencing on a Single Imperfect Machine | 2009-05-13 | Paper |
| Approximate solution of the control problem of supplies with many intervals and concave cost functions | 2009-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5301734 | 2009-01-20 | Paper |
| Scheduling jobs in a contaminated area: a model and heuristic algorithms | 2008-08-14 | Paper |
| A single-item economic lot-sizing problem with a non-uniform resource: Approximation | 2008-04-24 | Paper |
| Batch scheduling of deteriorating reworkables | 2008-04-24 | Paper |
| Optimal testing and repairing a failed series system | 2007-06-21 | Paper |
| Batching deteriorating items with applications in computer communication and reverse logistics | 2007-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3417375 | 2007-01-29 | Paper |
| Problem \(F2||C_{\max}\) with forbidden jobs in the first or last position is easy | 2006-12-07 | Paper |
| Scheduling with controllable release dates and processing times: Makespan minimization | 2006-10-27 | Paper |
| Scheduling with controllable release dates and processing times: total completion time minimization | 2006-10-27 | Paper |
| An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure | 2006-06-14 | Paper |
| Scheduling in a contaminated area: a model and polynomial algorithms | 2006-05-29 | Paper |
| Batching work and rework processes with limited deterioration of reworkables | 2006-01-10 | Paper |
| Batch scheduling with controllable setup and processing times to minimize total completion time | 2005-06-21 | Paper |
| Positive half-products and scheduling with controllable processing times | 2005-04-21 | Paper |
| Single machine group scheduling with resource dependent setup and processing times | 2005-02-09 | Paper |
| Batching decisions for assembly production systems | 2005-01-12 | Paper |
| Maximization problems in single machine scheduling | 2004-08-10 | Paper |
| Scheduling malleable tasks on parallel processors to minimize the makespan | 2004-08-10 | Paper |
| Scheduling jobs with piecewise linear decreasing processing times | 2004-03-15 | Paper |
| Single machine batch scheduling with jointly compressible setup and processing times. | 2004-01-05 | Paper |
| An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note | 2003-04-02 | Paper |
| The complexity of two group scheduling problems | 2003-02-23 | Paper |
| A polynomial algorithm for lot-size scheduling of two type tasks. | 2003-01-21 | Paper |
| Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness | 2002-12-15 | Paper |
| Minimizing the total weighted completion time of deteriorating jobs | 2002-07-14 | Paper |
| Fast fully polynomial approximation schemes for minimizing completion time variance | 2002-06-16 | Paper |
| Single supplier scheduling for multiple deliveries | 2002-06-09 | Paper |
| Parallel machine batching and scheduling with deadlines | 2001-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712370 | 2001-05-06 | Paper |
| A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem | 2001-02-27 | Paper |
| Scheduling with batching: A review | 2001-01-30 | Paper |
| Single machine batch scheduling with resource dependent setup and processing times | 2001-01-01 | Paper |
| Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness | 1999-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246496 | 1999-08-08 | Paper |
| Batch scheduling with deadlines on parallel machines | 1999-03-07 | Paper |
| Single machine scheduling with batch deliveries | 1999-02-22 | Paper |
| Single machine scheduling subject to deadlines and resource dependent processing times | 1999-02-22 | Paper |
| Scheduling a batching machine | 1999-01-11 | Paper |
| A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs | 1999-01-05 | Paper |
| Batch scheduling and common due date assignment problem: An NP-hard case | 1998-08-19 | Paper |
| Uniform machine scheduling of unit-time jobs subject to resource constraints | 1998-07-28 | Paper |
| A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\) | 1998-07-06 | Paper |
| Bicriterion Single Machine Scheduling with Resource Dependent Processing Times | 1998-05-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3123417 | 1997-07-06 | Paper |
| Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties | 1997-06-12 | Paper |
| Batch scheduling and common due-date assignment on a single machine | 1997-01-06 | Paper |
| Single machine batch scheduling with deadlines and resource dependent processing times | 1996-10-20 | Paper |
| Single Machine Group Scheduling with Two Ordered Criteria | 1996-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873242 | 1996-04-16 | Paper |
| Improving the complexities of approximation algorithms for optimization problems | 1996-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4841043 | 1995-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4841760 | 1995-08-27 | Paper |
| Single machine group scheduling with ordered criteria | 1995-08-27 | Paper |
| A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work | 1994-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4293025 | 1994-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246556 | 1993-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4012342 | 1992-09-27 | Paper |
| Minimization of the weighted sum of overdue customers in a single-server system | 1992-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3973085 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3362479 | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3033547 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3477568 | 1990-01-01 | Paper |
| Approximation scheduling algorithms: a survey | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783065 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3801579 | 1988-01-01 | Paper |
| The construction of ε-approximate algorithms for the optimization of functions in successively constructed sets | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3686512 | 1985-01-01 | Paper |
