Prof. Dr. Frank Werner
Otto von Guericke Universitat Magdeburg
Professor, Mathematics
Germany
My co-authors include
PhD. Larysa Burtseva
Alexandre Dolgui
Professor Michael Pinedo
My Publications
A dynamic model and an algorithm for short-term supply chain scheduling in the smart fa...
International Journal of Production Research
January 2015
A dynamic model and an algorithm for short-term supply chain scheduling are given, where both the machine structure selection and the job assignments are considered simultaneously. The scheduling a...
Parallel machine problems with equal processing times: a survey
Journal of Scheduling
March 2011
This paper gives an extensive survey on parallel machine scheduling problems with equal processing times. It discusses approaches and algorithms in this area.
Complexity results for parallel machine problems with a single server
Journal of Scheduling
January 2002
This paper presents a lot of new complexity results for the problem of scheduling a set of jobs on parallel machines with a single server.
Improving local search heuristics for some scheduling problems—I
Discrete Applied Mathematics
March 1996
For some scheduling problems, an approach is given which allows to perform a local search on the set of locally optimal solutions with respect to some primary neighborhood. Connectivity properties ...
The complexity of dissociation set problems in graphs
Discrete Applied Mathematics
August 2011
A subset of vertices in a graph is called a dissociation set if it induces a subgraph with a vertex degree of at most 1. The maximum dissociation set problem, i.e., the problem of finding a dissoci...
A comparison of scheduling algorithms for flexible flow shop problems with unrelated pa...
Computers & Operations Research
February 2009
This paper compares different constructive and iterative heuristic algorithms for the flexible flow shop problem. Machines at the stages can be unrelated, setup times may occur, and the objective i...
Batching for work and rework processes on dedicated facilities to minimize the makespan
Omega
December 2010
We study a planning problem of an imperfect production of a single product. The product is assumed to be continuously divisible. There are two facilities: a main facility dedicated to the original ...
Complexity of mixed shop scheduling problems: A survey
European Journal of Operational Research
January 2000
This paper presents an overview on existing results for the complexity of so-called mixed shop scheduling problems, where e.g. some jobs have a fixed technological route and others not.
The vehicle routing and scheduling problem with cross-docking for perishable products u...
Applied Mathematical Modelling
February 2019
This paper presents a bi-objective MILP model for the vehicle routing and scheduling problem with cross-docking for perishable products. It is demonstrated that considering merely one objective sac...
Cost minimizing scheduling of work and rework processes on a single facility under dete...
International Journal of Production Economics
February 2007
The problem of scheduling the production of new and recovering defective items of the same product manufactured on the same facility is considered. The items are produced in batches. The processing...
Operating room scheduling by considering the decision-making styles of surgical team me...
Computers & Operations Research
April 2019
Two-Machine Job-Shop Scheduling with Equal Processing Times on Each Machine
Mathematics
March 2019
Correction: Ungson, Y. et al. Filling of Irregular Channels with Round Cross-Section: M...
Materials
March 2019
Minimizing the Makespan on Two Identical Parallel Machines with Mold Constraints
Computers & Operations Research
January 2019
ЭВРИСТИЧЕСКИЕ АЛГОРИТМЫ ДЛЯ МАКСИМИЗАЦИИ ДОХОДА И КОЛИЧЕСТВА ТРЕБОВАНИЙ, ОБСЛУЖИВАЕМЫХ ...
Автоматика и телемеханика
January 2019
TIME RESTRICTION ASPECTS IN THE MODELING OF CYBER-PHYSICAL SYSTEMS FOR INDUSTRY 4.0
December 2018
COLLISIONS OF PARTICLES IN LIMITED SPACE ANALYZED BY MOLECULAR DYNAMICS METHODS
December 2018
Filling of Irregular Channels with Round Cross-Section: Modeling Aspects to Study the P...
Materials
October 2018
Editorial of a Special Issue
International Journal of Production Research
October 2018
A genetic algorithm for hybrid job-shop scheduling problems with minimizing the makespa...
Journal of Advanced Manufacturing Systems
July 2018
This is the editorial of an open access special issue with 11 papers in the scheduling ...
Algorithms
June 2018
Incorporating supplier selection and order allocation into the vehicle routing and mult...
International Journal of Production Research
May 2018
A Permutation-Based Neighborhood for the Blocking Job-Shop Problem with Total Tardiness...
January 2018
Optimality box in uncertain data
International Journal of Production Research
November 2017
Flexible job shop scheduling with lot streaming and sublot size optimisation
International Journal of Production Research
July 2017
Material handling tools for a discrete manufacturing system: A comparison of optimizati...
July 2017
Approaches to modeling train scheduling problems as job-shop problems with blocking con...
Journal of Scheduling
April 2017
A finite characterization and recognition of intersection graphs of hypergraphs with ra...
Discussiones Mathematicae Graph Theory
January 2017
A new effective dynamic program for an investment optimization problem
Automation and Remote Control
September 2016
Graphs with maximal induced matchings of the same size
Discrete Applied Mathematics
September 2016
Integrated demand-responsive scheduling of maintenance and transportation operations in...
International Journal of Production Research
May 2016
Scheduling jobs with equal processing times on a single machine: minimizing maximum lat...
Optimization Letters
January 2016
Schedule robustness analysis with the help of attainable sets in continuous flow proble...
International Journal of Production Research
January 2016
Recent advances on modelling of structures of multi-component mixtures using a sphere p...
International Journal of Nanotechnology
January 2016
On a generalized single machine scheduling problem with time-dependent processing times...
IFAC-PapersOnLine
January 2016
Tessellation for modeling
Applied Mechanics and Materials
April 2015
Minimizing the makespan for the two-machine scheduling problem with a single server: Tw...
Engineering Optimization
January 2015
Minimising interference for scheduling two parallel machines with a single server
International Journal of Production Research
September 2014
Minimizing total weighted completion time approximately for the parallel machine proble...
Information Processing Letters
September 2014
Guest Editorial
International Journal of Production Research
June 2014
A new graphical approach for solving single-machine scheduling problems approximately
International Journal of Production Research
May 2014
Scheduling unrelated machines with two types of jobs
International Journal of Production Research
February 2014
A Graphical Approach to Solve an Investment Optimization Problem
Journal of Mathematical Modelling and Algorithms in Operations Research
February 2014
Simulated annealing and genetic algorithms for the two-machine scheduling problem with ...
International Journal of Production Research
January 2014
Block models for scheduling jobs on two parallel machines with a single server
Computers & Operations Research
January 2014
Reducing efficiently the search tree for multiprocessor job-shop scheduling problems
International Journal of Production Research
September 2013
Minimizing maximum lateness of jobs with naturally bounded job data on a single machine...
Theoretical Computer Science
August 2013
A note on the paper ‘Single machine scheduling problems with financial resource constra...
Mathematical Social Sciences
May 2013
Erratum to: Minimizing total tardiness on parallel machines with preemptions
Journal of Scheduling
January 2013
Solving a job-shop scheduling problem by an adaptive algorithm based on learning
IFAC Proceedings Volumes
January 2013
The Stability Box for Minimizing Total Weighted Flow Time under Uncertain Data
January 2013
A Graphical Approach for Solving Single Machine Scheduling Problems Approximately
IFAC Proceedings Volumes
January 2013
Makespan Minimization for a Two-Machine Scheduling Problem with a Single Server
IFAC Proceedings Volumes
January 2013
Single machine total tardiness maximization problems: complexity and algorithms
Annals of Operations Research
December 2012
Measures of problem uncertainty for scheduling with interval processing times
OR Spectrum
September 2012
Guest Editorial
Computers & Operations Research
June 2012
Soft due window assignment and scheduling of unit-time jobs on parallel machines
4OR
May 2012
A Graphical Approach to Solve Combinatorial Problems: Algorithms and Some Computational...
IFAC Proceedings Volumes
May 2012
A polynomially solvable case of a single machine scheduling problem when the maximal jo...
IFAC Proceedings Volumes
May 2012
Calculation of the stability radius of an optimal line balance
IFAC Proceedings Volumes
May 2012
Near to Optimal Size Selection in Combinatorial Circuits
May 2012
Polynomial algorithms for scheduling jobs with two processing times on unrelated machines
IFAC Proceedings Volumes
May 2012
Search on the enumeration tree in the multiprocessor job-shop problem
IFAC Proceedings Volumes
May 2012
Graphs with Maximal Induced Matchings of the Same Size
IFAC Proceedings Volumes
May 2012
Approximability results for the resource-constrained project scheduling problem with a ...
Annals of Operations Research
March 2012
Transforming a pseudo-polynomial algorithm for the single machine total tardiness maxim...
Annals of Operations Research
January 2012
A note on a single machine scheduling problem with generalized total tardiness objectiv...
Information Processing Letters
January 2012
The dominance digraph as a solution to the two-machine flow-shop problem with interval ...
Optimization
December 2011
Single machine scheduling problems with financial resource constraints: Some complexity...
Mathematical Social Sciences
July 2011
Algorithms for some maximization scheduling problems on a single machine
Automation and Remote Control
October 2010
Minimizing total weighted completion time with uncertain data: A stability approach
Automation and Remote Control
October 2010
Scheduling with multiple servers
Automation and Remote Control
October 2010
Foreword to the thematical issue devoted to the seventieth anniversary of Academician V...
Automation and Remote Control
October 2010
Minimizing total tardiness on parallel machines with preemptions
Journal of Scheduling
September 2010
Minimizing the number of machines for scheduling jobs with equal processing times
European Journal of Operational Research
December 2009
Preemptive scheduling on uniform machines to minimize mean flow time
Computers & Operations Research
October 2009
A graphical realization of the dynamic programming method for solving <mml:math altimg=...
Computers & Mathematics with Applications
August 2009
Algorithms for special cases of the single machine total tardiness problem and an appli...
Mathematical and Computer Modelling
May 2009
On a parallel machine scheduling problem with equal processing times
Discrete Applied Mathematics
February 2009
Computers & Operations Research
February 2009
Hierarchical Scheduling of Mobile Robots in Production-Transportation Supply Chains
IFAC Proceedings Volumes
January 2009
On the Complexity of Dissociation Set Problems in Graphs
IFAC Proceedings Volumes
January 2009
Partial job order for solving the two-machine flow-shop minimum-length problem with unc...
IFAC Proceedings Volumes
January 2009
Scheduling Jobs with Equal Processing Times
IFAC Proceedings Volumes
January 2009
Hamiltonian properties of triangular grid graphs
Discrete Mathematics
December 2008
Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
Mathematical and Computer Modelling
October 2008
Heuristic constructive algorithms for open shop scheduling to minimize mean flow time
European Journal of Operational Research
September 2008
Using Simulated Annealing for Open Shop Scheduling with Sum Criteria
September 2008
Metaheuristic approaches for the two-machine flow-shop problem with weighted late work ...
Computers & Operations Research
February 2008
Algorithms for flexible flow shop problems with unrelated parallel machines, setup time...
The International Journal of Advanced Manufacturing Technology
March 2007
Problem F2∥Cmax with forbidden jobs in the first or last position is easy
European Journal of Operational Research
March 2007
Complexity of shop-scheduling problems with fixed number of jobs: a survey
Mathematical Methods of Operations Research
February 2007
A note on the two machine job shop with the weighted late work criterion
Journal of Scheduling
February 2007
Batching work and rework processes with limited deterioration of reworkables
Computers & Operations Research
June 2006
Book Review: Michael L. Pinedo (2005): ISBN 0-387-22198-0, Springer, New York
Mathematical Methods of Operations Research
January 2006
Mathematics of Economics and Business
January 2006
SEQUENCE-DEPENDENT SETUP AND CLEAN-UP TIMES IN A TWO-MACHINE JOB-SHOP WITH MINIMIZING M...
IFAC Proceedings Volumes
January 2006
A COMPARISON OF HEURISTICS FOR MEAN FLOW TIME OPEN SHOP SCHEDULING
IFAC Proceedings Volumes
January 2006
A comparison of solution procedures for two-machine flow shop scheduling with late work...
Computers & Industrial Engineering
December 2005
The two-machine flow-shop problem with weighted late work criterion and common due date
European Journal of Operational Research
September 2005
Positive half-products and scheduling with controllable processing times
European Journal of Operational Research
September 2005
Metaheuristics for Late Work Minimization in Two-Machine Flow Shop with Common Due Date
January 2005
Mean flow time minimization with given bounds of processing times
European Journal of Operational Research
December 2004
Scheduling with common due date, earliness and tardiness penalties for multimachine pro...
Mathematical and Computer Modelling
September 2004
On the complexity and some properties of multi-stage scheduling problems with earliness...
Computers & Operations Research
March 2004
Open shop scheduling problems with late work criteria
Discrete Applied Mathematics
January 2004
Two-Machine Flow Shop Scheduling with Nonregular Criteria
Journal of Mathematical Modelling and Algorithms
January 2004
Flow Shop Scheduling with Late Work Criterion – Choosing the Best Solution Strategy
January 2004
Two-machine open shop scheduling with secondary criteria
International Transactions in Operational Research
May 2003
Heuristics for hybrid flow shops with controllable processing times and assignable due ...
Computers & Operations Research
September 2002
Scheduling Problems and Mixed Graph Colorings
Optimization
May 2002
Local search heuristics for two-stage flow shop problems with secondary criterion
Computers & Operations Research
February 2002
Journal of Heuristics
January 2002
A heuristic algorithm for minimizing mean flow time with unit setups
Information Processing Letters
September 2001
Heuristic algorithms for unrelated parallel machine scheduling with a common due date, ...
Mathematical and Computer Modelling
February 2001
Minimizing total flow time in a two-machine flowshop problem with minimum makespan
International Journal of Production Economics
February 2001
Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with ...
RAIRO - Operations Research
January 2001
On the Solution of 2-Machine Flow Shop Problems With a Common Due Date
January 2000
Scheduling with Deadlines and Nested Processing Intervals for a Single Machine
January 2000
Total Late Work Criteria for Shop Scheduling Problems
January 2000
A comparison of heuristic algorithms for flow shop scheduling problems with setup times...
Mathematical and Computer Modelling
May 1999
On the application of insertion techniques for job shop problems with setup times
RAIRO - Operations Research
April 1999
Annals of Operations Research
January 1999
Heuristics for generalized shop scheduling problems based on decomposition
International Journal of Production Research
November 1998
Annals of Operations Research
January 1998
Annals of Operations Research
January 1998
Stability Radius of an Optimal Schedule: A Survey and Recent Developments
January 1998
Parallel machine scheduling problems with a single server
Mathematical and Computer Modelling
December 1997
Optimal makespan scheduling with given bounds of processing times
Mathematical and Computer Modelling
August 1997
Stability of an optimal schedule in a job shop
Omega
August 1997
A polynomial approximation scheme for problem F2/rj/Cmax
Operations Research Letters
February 1997
Improving local search heuristics for some scheduling problems. Part II
Discrete Applied Mathematics
January 1997
Single machine scheduling with deadlines, release and due dates
Optimization
January 1997
Stability of a schedule minimizing mean flow time
Mathematical and Computer Modelling
November 1996
Heuristics for permutation flow shop scheduling with batch setup times
OR Spectrum
June 1996
Adaptive scheduling algorithm based on mixed graph model
IEE Proceedings - Control Theory and Applications
January 1996
Book reviews
Optimization
January 1996
Polynomial time algorithms for special open shop problems with precedence constraints a...
RAIRO - Operations Research
January 1996
A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs
Journal of the Operational Research Society
December 1995
A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs
Journal of the Operational Research Society
December 1995
A polynomial algorithm for an open shop problem with unit processing times and tree con...
Discrete Applied Mathematics
April 1995
Insertion techniques for the heuristic solution of the job shop problem
Discrete Applied Mathematics
March 1995
On the solution of determinantal systems of linear inequalities
Optimization
January 1995
Optimal schedules with infinitely large stability radius∗
Optimization
January 1995
A strongly polynomial algorithm for a new class of linear inequalities1
Optimization
January 1995
single Machine Preemptive Scheduling With Special Cost Functions1
Optimization
January 1995
Book reviews
Optimization
January 1995
A polynomial algorithm for the [n/m/0, tij = 1, tree/Cmax] open shop problem
European Journal of Operational Research
January 1994
Scheduling unit time open shops to minimize the weighted number of late jobs
Operations Research Letters
December 1993
On the heuristic solution of the permutation flow shop problem by path algorithms
Computers & Operations Research
September 1993
Constructive heuristic algorithms for the open shop problem
Computing
June 1993
A branch and bound algorithm for minimizing weighted completion times with deadlines
Optimization
January 1993
On the combinatorial structure of the permutation flow shop problem
Mathematical Methods of Operations Research
July 1991
Some relations between neighbourhood graphs for a permutation problem
Optimization
January 1991
A locally optimal insertion heuristic for a one-machine scheduling problem
RAIRO - Operations Research
January 1990
Zu einigen Nachbarschaftsstrukturen fiir Iterationsverfahren zur naherangsweisen Lösung...
Optimization
January 1988
On the method of interchanging networks for permutation problems
Optimization
January 1986
The job - shop problem - modelling by latin rectangles, exact and heuristic solution
Stability of Optimal Line Balance with Given Station Set