| Publication | Date of Publication | Type |
|---|
| Preemptive scheduling of parallel jobs of two sizes with controllable processing times | 2024-05-30 | Paper |
| Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques | 2024-03-15 | Paper |
| An FPTAS for scheduling with resource constraints | 2023-09-12 | Paper |
| A historical note on the complexity of scheduling problems | 2023-06-27 | Paper |
| Preemptive and non-preemptive scheduling on two unrelated parallel machines | 2022-11-04 | Paper |
| Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches | 2022-06-22 | Paper |
| Minmax scheduling and due-window assignment with position-dependent processing times and job rejection | 2021-05-20 | Paper |
| Parametric analysis of the quality of single preemption schedules on three uniform parallel machines | 2021-05-05 | Paper |
| Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects | 2020-12-11 | Paper |
| Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints | 2020-11-09 | Paper |
| Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost | 2020-04-21 | Paper |
| Models and algorithms for energy-efficient scheduling with immediate start of jobs | 2019-08-08 | Paper |
| Schedules with a single preemption on uniform parallel machines | 2019-05-17 | Paper |
| Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow | 2019-05-02 | Paper |
| Two-machine flow shop and open shop scheduling problems with a single maintenance window | 2018-07-25 | Paper |
| Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints | 2018-07-12 | Paper |
| Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches | 2018-05-30 | Paper |
| Single machine scheduling with a generalized job-dependent cumulative effect | 2018-02-28 | Paper |
| Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization | 2018-02-13 | Paper |
| The block retrieval problem | 2017-11-23 | Paper |
| Power of Preemption on Uniform Parallel Machines | 2017-03-22 | Paper |
| Scheduling with time-changing effects and rate-modifying activities | 2017-03-02 | Paper |
| Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines | 2017-01-27 | Paper |
| Approximability issues for unconstrained and constrained maximization of half-product related functions | 2016-12-23 | Paper |
| Differential approximation schemes for half-product related functions and their scheduling applications | 2016-12-22 | Paper |
| Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications | 2016-07-22 | Paper |
| Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines | 2016-05-19 | Paper |
| Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product | 2016-03-15 | Paper |
| Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times | 2015-10-19 | Paper |
| Single parameter analysis of power of preemption on two and three uniform machines | 2015-04-09 | Paper |
| Parallel Machine Scheduling: Impact of Adding Extra Machines | 2014-06-26 | Paper |
| Scheduling with due date assignment under special conditions on job processing | 2014-02-05 | Paper |
| Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance | 2014-02-05 | Paper |
| Schedules with precedence restrictions and position-dependent servicing durations | 2013-07-10 | Paper |
| A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines | 2013-06-27 | Paper |
| Preemptive scheduling on two identical parallel machines with a single transporter | 2013-03-25 | Paper |
| The symmetric quadratic knapsack problem: approximation and scheduling applications | 2013-02-06 | Paper |
| Simple matching vs linear assignment in scheduling models with positional effects: a critical review | 2012-12-29 | Paper |
| Single machine scheduling with precedence constraints and positionally dependent processing times | 2012-11-15 | Paper |
| Scheduling batches with sequential job processing for two-machine flow and open shops | 2012-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3109947 | 2012-01-26 | Paper |
| Hamiltonian properties of locally connected graphs with bounded vertex degree | 2011-10-27 | Paper |
| Scheduling parallel dedicated machines with the speeding‐up resource | 2011-04-15 | Paper |
| On Single Machine Scheduling and Due DateAssignment with Positionally Dependent Processing Times | 2011-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3076093 | 2011-02-17 | Paper |
| Transporting Jobs through a Processing Center with Two Parallel Machines | 2011-01-08 | Paper |
| Creative heritage of Vyacheslav Sergeevich Tanaev: seventieth anniversary | 2011-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3161362 | 2010-10-14 | Paper |
| MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK | 2010-06-18 | Paper |
| Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications | 2010-05-28 | Paper |
| Scheduling incompatible tasks on two machines | 2009-12-14 | Paper |
| Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval | 2009-12-07 | Paper |
| Operator non-availability periods | 2009-12-02 | Paper |
| Fifty years of scheduling: a survey of milestones | 2009-08-28 | Paper |
| Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation | 2009-08-28 | Paper |
| Planning Machine Maintenance in Two-Machine Shop Scheduling | 2009-08-13 | Paper |
| Single machine scheduling and due date assignment with positionally dependent processing times | 2009-06-30 | Paper |
| SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION | 2009-06-23 | Paper |
| Transporting jobs through a two‐machine open shop | 2009-04-22 | Paper |
| Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach | 2008-11-25 | Paper |
| Approximation results for flow shop scheduling problems with machine availability constraints | 2008-11-07 | Paper |
| Preemptive scheduling on uniform parallel machines with controllable job processing times | 2008-07-01 | Paper |
| On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints | 2008-06-05 | Paper |
| Three is easy, two is hard: Open shop sum-batch scheduling problem refined | 2008-01-15 | Paper |
| AN IMPROVED APPROXIMATION ALGORITHM FOR THE TWO-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH AN INTERSTAGE TRANSPORTER | 2007-06-05 | Paper |
| Pre-emptive scheduling problems with controllable processing times | 2007-05-15 | Paper |
| Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints | 2007-02-20 | Paper |
| A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date | 2007-01-09 | Paper |
| Single machine scheduling with controllable release and processing parameters | 2006-10-30 | Paper |
| Two-machine flow shop no-wait scheduling with machine maintenance | 2006-10-11 | Paper |
| Single machine scheduling and due date assignment under series-parallel precedence constraints | 2006-06-12 | Paper |
| Two-machine shop scheduling: Compromise between flexibility and makespan value | 2005-09-28 | Paper |
| Two-machine flow shop scheduling problems with no-wait jobs | 2005-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4667087 | 2005-04-19 | Paper |
| Three-machine shop scheduling with partially ordered processing routes | 2005-03-14 | Paper |
| Two-machine open shop scheduling with special transportation times | 2005-01-13 | Paper |
| Batching decisions for assembly production systems | 2005-01-12 | Paper |
| Two-machine flow shop no-wait scheduling with a nonavailability interval | 2005-01-11 | Paper |
| Scheduling three-operation jobs in a two-machine flow shop to minimize makespan | 2004-08-10 | Paper |
| Scheduling problems for parallel dedicated machines under multiple resource constraints. | 2004-01-05 | Paper |
| Non-preemptive two-machine open shop scheduling with non-availability constraints | 2003-06-26 | Paper |
| Scheduling parallel dedicated machines under a single non-shared resource | 2003-04-28 | Paper |
| Scheduling batches with simultaneous job processing for two-machine shop problems | 2002-02-27 | Paper |
| Two-machine open shop scheduling with an availability constraint | 2001-12-05 | Paper |
| Heuristics for the two-stage job shop scheduling problem with a bottleneck machine | 2001-09-03 | Paper |
| Two-stage open shop scheduling with a bottleneck machine | 2001-01-25 | Paper |
| Group technology approach to the open shop scheduling problem with batch setup times | 2000-11-22 | Paper |
| A heuristic for the two-machine open-shop scheduling problem with transportation times | 2000-08-07 | Paper |
| Scheduling for parallel dedicated machines with a single server | 2000-07-09 | Paper |
| Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment | 2000-05-11 | Paper |
| Heuristics for short route job shop scheduling problems | 2000-01-18 | Paper |
| A polynomial algorithm for the three-machine open shop with a bottleneck machine | 2000-01-11 | Paper |
| A 3/2 algorithm for two-machine open shop with route-dependent processing times | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246540 | 1999-08-03 | Paper |
| A heuristic algorithm for two-machine re-entrant shop scheduling | 1999-06-10 | Paper |
| Approximation algorithms for two-machine flow shop scheduling with batch setup times | 1999-06-03 | Paper |
| A greedy open shop heuristic with job priorities | 1998-12-06 | Paper |
| Two-stage no-wait scheduling models with setup and removal times separated | 1998-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4336213 | 1998-04-22 | Paper |
| Shop scheduling problems under precedence constraints | 1998-02-05 | Paper |
| An open shop scheduling problem with a non-bottleneck machine | 1997-11-06 | Paper |
| A New Heuristic for Three-Machine Flow Shop Scheduling | 1997-08-03 | Paper |
| The Two-Stage Assembly Scheduling Problem: Complexity and Approximation | 1995-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4841579 | 1995-08-08 | Paper |
| Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds | 1995-05-17 | Paper |
| On non-permutation solutions to some two machine flow shop scheduling problems | 1994-08-15 | Paper |
| Optimal job-shop scheduling with two jobs in systems with unrestricted paths | 1994-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4288832 | 1994-04-20 | Paper |
| Approximation Algorithms for Three-Machine Open Shop Scheduling | 1994-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138270 | 1993-12-20 | Paper |
| Worst-case analysis of heuristics for open shops with parallel machines | 1993-12-20 | Paper |
| Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function | 1993-12-20 | Paper |
| Two machine open shop scheduling problem with setup, processing and removal times separated | 1993-08-10 | Paper |
| Optimal choice of machine speeds for two-stage non-homogeneous systems | 1992-09-27 | Paper |
| Inhomogeneous deterministic two-stage queueing systems | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4012344 | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4012345 | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3994687 | 1992-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3973086 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3980709 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3973085 | 1992-06-26 | Paper |
| Two-Machine Super-Shop Scheduling Problem | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3033546 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3824094 | 1989-01-01 | Paper |
| Two-stage queueing systems with resource constraints and without prescribed flow paths | 1989-01-01 | Paper |
| Approximation scheduling algorithms: a survey | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4207776 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3751360 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3738903 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3745606 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4742539 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3939584 | 1981-01-01 | Paper |
