| Publication | Date of Publication | Type |
|---|
| Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems | 2024-04-03 | Paper |
| A multi-objective sustainable planning for a real hazardous waste production problem | 2022-07-03 | Paper |
| Home health care planning with considering flexible starting/ending points and service features | 2022-05-02 | Paper |
| A metric approach for scheduling problems with minimizing the maximum penalty | 2021-11-15 | Paper |
| Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine | 2021-01-14 | Paper |
| Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines | 2020-01-27 | Paper |
| Minimizing the makespan on two identical parallel machines with mold constraints | 2019-02-19 | Paper |
| A Permutation-Based Neighborhood for the Blocking Job-Shop Problem with Total Tardiness Minimization | 2018-10-09 | Paper |
| Approaches to modeling train scheduling problems as job-shop problems with blocking constraints | 2018-04-13 | Paper |
| Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan | 2017-06-29 | Paper |
| A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of threshold graphs | 2017-01-23 | Paper |
| A new effective dynamic program for an investment optimization problem | 2017-01-20 | Paper |
| Graphs with maximal induced matchings of the same size | 2016-11-24 | Paper |
| Block models for scheduling jobs on two parallel machines with a single server | 2016-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2809765 | 2016-05-30 | Paper |
| A graphical approach to solve an investment optimization problem | 2014-12-16 | Paper |
| Approximability results for the resource-constrained project scheduling problem with a single type of resources | 2014-09-26 | Paper |
| Erratum to: ``Minimizing total tardiness on parallel machines with preemptions | 2014-08-18 | Paper |
| Minimizing total weighted completion time approximately for the parallel machine problem with a single server | 2014-05-05 | Paper |
| Parallel machine problems with equal processing times: a survey | 2014-02-05 | Paper |
| Minimizing total tardiness on parallel machines with preemptions | 2014-02-05 | Paper |
| Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time | 2014-01-10 | Paper |
| Single machine total tardiness maximization problems: complexity and algorithms | 2013-09-16 | Paper |
| Measures of problem uncertainty for scheduling with interval processing times | 2013-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2837376 | 2013-07-10 | Paper |
| A note on the paper `Single machine scheduling problems with financial resource constraints: some complexity results and properties' by E.R. Gafarov et al. | 2013-05-10 | Paper |
| Soft due window assignment and scheduling of unit-time jobs on parallel machines | 2013-02-18 | Paper |
| Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one | 2012-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2913097 | 2012-09-26 | Paper |
| A note on a single machine scheduling problem with generalized total tardiness objective function | 2012-03-09 | Paper |
| The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times | 2012-01-18 | Paper |
| The complexity of dissociation set problems in graphs | 2011-08-10 | Paper |
| Single machine scheduling problems with financial resource constraints: some complexity results and properties | 2011-08-04 | Paper |
| Foreword to the thematical issue devoted to the seventieth anniversary of Academician V. S. Tanaev | 2011-01-03 | Paper |
| Minimizing total weighted completion time with uncertain data: a stability approach | 2011-01-03 | Paper |
| Algorithms for some maximization scheduling problems on a single machine | 2011-01-03 | Paper |
| Scheduling with multiple servers | 2011-01-03 | Paper |
| A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems | 2010-06-28 | Paper |
| Parallel machine scheduling problems with a single server | 2010-05-06 | Paper |
| Minimizing the number of machines for scheduling jobs with equal processing times | 2009-12-07 | Paper |
| Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem | 2009-10-12 | Paper |
| Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop | 2009-07-19 | Paper |
| On a parallel machine scheduling problem with equal processing times | 2009-06-30 | Paper |
| Preemptive scheduling on uniform machines to minimize mean flow time | 2009-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3621130 | 2009-04-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3617553 | 2009-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3598878 | 2009-02-03 | Paper |
| Hamiltonian properties of triangular grid graphs | 2009-01-28 | Paper |
| A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria | 2008-11-07 | Paper |
| Heuristic constructive algorithms for open shop scheduling to minimize mean flow time | 2008-04-24 | Paper |
| Complexity of shop-scheduling problems with fixed number of jobs: a survey | 2007-11-14 | Paper |
| Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date | 2007-10-10 | Paper |
| A note on the two machine job shop with the weighted late work criterion | 2007-05-15 | Paper |
| Problem \(F2||C_{\max}\) with forbidden jobs in the first or last position is easy | 2006-12-07 | Paper |
| KI 2005: Advances in Artificial Intelligence | 2006-11-13 | Paper |
| Batching work and rework processes with limited deterioration of reworkables | 2006-01-10 | Paper |
| The two-machine flow-shop problem with weighted late work criterion and common due date | 2005-04-21 | Paper |
| Positive half-products and scheduling with controllable processing times | 2005-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4667415 | 2005-04-19 | Paper |
| On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties | 2005-02-23 | Paper |
| Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey | 2005-02-22 | Paper |
| Two-machine flow shop scheduling with nonregular criteria | 2005-01-17 | Paper |
| Mean flow time minimization with given bounds of processing times | 2004-11-22 | Paper |
| Two-machine open shop scheduling with secondary criteria | 2004-08-10 | Paper |
| Open shop scheduling problems with late work criteria. | 2004-01-26 | Paper |
| Complexity results for parallel machine problems with a single server | 2003-02-23 | Paper |
| Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness | 2002-12-15 | Paper |
| Scheduling Problems and Mixed Graph Colorings | 2002-11-28 | Paper |
| A heuristic algorithm for minimizing mean flow time with unit setups | 2002-07-14 | Paper |
| Heuristics for hybrid flow shops with controllable processing times and assignable due dates | 2002-07-11 | Paper |
| Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals | 2002-06-16 | Paper |
| A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size | 2002-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2784175 | 2002-04-17 | Paper |
| Local search heuristics for two-stage flow shop problems with secondary criterion | 2002-02-13 | Paper |
| Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties | 2001-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712366 | 2001-07-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712360 | 2001-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712365 | 2001-05-06 | Paper |
| On the application of insertion techniques for job shop problems with setup times | 2000-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247059 | 2000-05-25 | Paper |
| Complexity of mixed shop scheduling problems: A survey | 2000-03-19 | Paper |
| Shop-scheduling problems with fixed and non-fixed machine orders of the jobs | 2000-01-11 | Paper |
| Heuristics for generalized shop scheduling problems based on decomposition | 1999-09-09 | Paper |
| Batch scheduling with deadlines on parallel machines | 1999-03-07 | Paper |
| On the calculation of the stability radius of an optimal or an approximate schedule | 1998-12-06 | Paper |
| Optimal makespan scheduling with given bounds of processing times | 1998-09-07 | Paper |
| A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\) | 1998-07-06 | Paper |
| Single machine scheduling with deadlines, release and due dates | 1998-02-05 | Paper |
| On the solution of determinantal systems of linear inequalities | 1997-08-27 | Paper |
| Stability of a schedule minimizing mean flow time | 1997-08-03 | Paper |
| Improving local search heuristics for some scheduling problems. II | 1997-04-21 | Paper |
| Adaptive scheduling algorithm based on mixed graph model | 1996-11-25 | Paper |
| Heuristics for permutation flow shop scheduling with batch setup times | 1996-10-31 | Paper |
| single Machine Preemptive Scheduling With Special Cost Functions1 | 1996-10-30 | Paper |
| Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times | 1996-07-24 | Paper |
| Improving local search heuristics for some scheduling problems. I | 1996-07-07 | Paper |
| A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs | 1996-04-29 | Paper |
| A strongly polynomial algorithm for a new class of linear inequalities1 | 1995-06-21 | Paper |
| Optimal schedules with infinitely large stability radius∗ | 1995-06-21 | Paper |
| A polynomial algorithm for an open shop problem with unit processing times and tree constraints | 1995-05-17 | Paper |
| Insertion techniques for the heuristic solution of the job shop problem | 1995-05-17 | Paper |
| A branch and bound algorithm for minimizing weighted completion times with deadlines | 1995-04-20 | Paper |
| Constructive heuristic algorithms for the open shop problem | 1994-09-26 | Paper |
| On the heuristic solution of the permutation flow shop problem by path algorithms | 1994-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4293021 | 1994-05-18 | Paper |
| A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}\) open shop problem] | 1994-04-12 | Paper |
| Scheduling unit time open shops to minimize the weighted number of late jobs | 1994-04-06 | Paper |
| On the combinatorial structure of the permutation flow shop problem | 1992-06-25 | Paper |
| Some relations between neighbourhood graphs for a permutation problem | 1992-06-25 | Paper |
| A locally optimal insertion heuristic for a one-machine scheduling problem | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3484616 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3496140 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3778531 | 1988-01-01 | Paper |
| Zu einigen Nachbarschaftsstrukturen fiir Iterationsverfahren zur naherangsweisen Lösung spezieller Reihenfolgeprohleme | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3763883 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3780027 | 1987-01-01 | Paper |
| On the method of interchanging networks for permutation problems | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3747217 | 1986-01-01 | Paper |
