Frank Werner
Affiliations: OttovonGuerickeUniversität Magdeburg, Germany
According to our database^{1},
Frank Werner
authored at least 94 papers
between 1989 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on zbmath.org

on orcid.org

on id.loc.gov
On csauthors.net:
Bibliography
2021
A control approach to scheduling flexibly configurable jobs with dynamic structurallogical constraints.
IISE Trans., 2021
Algorithms, 2021
2020
Blockchainoriented dynamic modelling of smart contract design and execution in the supply chain.
Int. J. Prod. Res., 2020
Algorithms, 2020
Minimizing Total Weighted Tardiness for Scheduling EqualLength Jobs on a Single Machine.
Autom. Remote. Control., 2020
2019
J. Intell. Fuzzy Syst., 2019
Operating room scheduling by considering the decisionmaking styles of surgical team members: A comprehensive approach.
Comput. Oper. Res., 2019
Comput. Oper. Res., 2019
On Neighborhood Structures and Repair Techniques for Blocking Job Shop Scheduling Problems.
Algorithms, 2019
Heuristic Algorithms to Maximize Revenue and the Number of Jobs Processed on Parallel Machines.
Autom. Remote. Control., 2019
2018
Approaches to modeling train scheduling problems as jobshop problems with blocking constraints.
J. Sched., 2018
Incorporating supplier selection and order allocation into the vehicle routing and multicrossdock scheduling problem.
Int. J. Prod. Res., 2018
The optimality box in uncertain data for minimising the sum of the weighted job completion times.
Int. J. Prod. Res., 2018
Int. J. Prod. Res., 2018
Int. J. Prod. Res., 2018
A scheduling extension scheme of the earliest deadline first policy for hard realtime uniprocessor systems integrated on POSIX threads based on Linux.
Comput. Syst. Sci. Eng., 2018
Algorithms, 2018
2017
Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan.
Optim. Lett., 2017
A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of thresholds graphs.
Discuss. Math. Graph Theory, 2017
Discret. Appl. Math., 2017
A PermutationBased Neighborhood for the Blocking JobShop Problem with Total Tardiness Minimization.
Proceedings of the Operations Research Proceedings 2017, 2017
2016
Autom. Remote. Control., 2016
2015
Risk Assessment and Security Testing of Large Scale Networked Systems with RACOMAT.
Proceedings of the Risk Assessment and RiskDriven Testing  Third International Workshop, 2015
2014
J. Math. Model. Algorithms Oper. Res., 2014
Minimizing total weighted completion time approximately for the parallel machine problem with a single server.
Inf. Process. Lett., 2014
Comput. Oper. Res., 2014
Approximability results for the resourceconstrained project scheduling problem with a single type of resources.
Ann. Oper. Res., 2014
2013
Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time.
Theor. Comput. Sci., 2013
J. Sched., 2013
OR Spectr., 2013
A note on the paper 'Single machine scheduling problems with financial resource constraints: Some complexity results and properties' by E.R. Gafarov et al.
Math. Soc. Sci., 2013
Ann. Oper. Res., 2013
Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013
Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013
A Graphical Approach for Solving Single Machine Scheduling Problems Approximately.
Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013
2012
J. Sched., 2012
A note on a single machine scheduling problem with generalized total tardiness objective function.
Inf. Process. Lett., 2012
Comput. Oper. Res., 2012
Transforming a pseudopolynomial algorithm for the single machine total tardiness maximization problem into a polynomial one.
Ann. Oper. Res., 2012
4OR, 2012
Jobshop Problems with Objectives Appropriate for Train Scheduling in a Singletrack Railway.
Proceedings of the SIMULTECH 2012  Proceedings of the 2nd International Conference on Simulation and Modeling Methodologies, Technologies and Applications, Rome, Italy, 28, 2012
2011
J. Sched., 2011
Single machine scheduling problems with financial resource constraints: Some complexity results and properties.
Math. Soc. Sci., 2011
Discret. Appl. Math., 2011
Proceedings of the Simulation and Modeling Methodologies, Technologies and Applications, 2011
The Stability Box in Interval Data for Minimizing the Sum of Weighted Completion Times.
Proceedings of the SIMULTECH 2011  Proceedings of 1st International Conference on Simulation and Modeling Methodologies, Technologies and Applications, Noordwijkerhout, The Netherlands, 29, 2011
2009
Algorithms for special cases of the single machine total tardiness problem and an application to the evenodd partition problem.
Math. Comput. Model., 2009
Minimizing the number of machines for scheduling jobs with equal processing times.
Eur. J. Oper. Res., 2009
Discret. Appl. Math., 2009
Comput. Oper. Res., 2009
A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria.
Comput. Oper. Res., 2009
Comput. Oper. Res., 2009
A graphical realization of the dynamic programming method for solving NPhard combinatorial problems.
Comput. Math. Appl., 2009
2008
Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop.
Math. Comput. Model., 2008
Heuristic constructive algorithms for open shop scheduling to minimize mean flow time.
Eur. J. Oper. Res., 2008
Discret. Math., 2008
Metaheuristic approaches for the twomachine flowshop problem with weighted late work criterion and common due date.
Comput. Oper. Res., 2008
2007
J. Sched., 2007
Math. Methods Oper. Res., 2007
Problem F2∥C<sub>max</sub> with forbidden jobs in the first or last position is easy.
Eur. J. Oper. Res., 2007
2006
Book Review: Michael L. Pinedo (2005): ISBN 0387221980, Springer, New York  Planning and Scheduling in Manufacturing and Services.
Math. Methods Oper. Res., 2006
V. T'Kindt and J.C. Billaut, Multicriteria Scheduling. Theory, Models and Algorithms, Springer Verlag (2002) ISBN 3540436170.
Eur. J. Oper. Res., 2006
Comput. Oper. Res., 2006
2005
Eur. J. Oper. Res., 2005
The twomachine flowshop problem with weighted late work criterion and common due date.
Eur. J. Oper. Res., 2005
A comparison of solution procedures for twomachine flow shop scheduling with late work criterion.
Comput. Ind. Eng., 2005
Metaheuristics for Late Work Minimization in TwoMachine Flow Shop with Common Due Date.
Proceedings of the KI 2005: Advances in Artificial Intelligence, 2005
2004
Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey.
Math. Comput. Model., 2004
J. Math. Model. Algorithms, 2004
Eur. J. Oper. Res., 2004
Discret. Appl. Math., 2004
On the complexity and some properties of multistage scheduling problems with earliness and tardiness penalties.
Comput. Oper. Res., 2004
Flow Shop Scheduling with Late Work Criterion  Choosing the Best Solution Strategy.
Proceedings of the Applied Computing, Second Asian Applied Computing Conference, 2004
2002
Approximation Schemes for Scheduling Jobs with Common Due Date on Parallel Machines to Minimize Total Tardiness.
J. Heuristics, 2002
Heuristics for hybrid flow shops with controllable processing times and assignable due dates.
Comput. Oper. Res., 2002
Local search heuristics for twostage flow shop problems with secondary criterion.
Comput. Oper. Res., 2002
2001
Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals.
RAIRO Oper. Res., 2001
Inf. Process. Lett., 2001
2000
Eur. J. Oper. Res., 2000
1999
On the application of insertion techniques for job shop problems with setup times.
RAIRO Oper. Res., 1999
Ann. Oper. Res., 1999
1998
On the calculation of the stability radiusof an optimal or an approximate schedule.
Ann. Oper. Res., 1998
Ann. Oper. Res., 1998
Ann. Oper. Res., 1998
1997
Oper. Res. Lett., 1997
Discret. Appl. Math., 1997
1996
Discret. Appl. Math., 1996
1995
Discret. Appl. Math., 1995
A Polynomial Algorithm for an open Shop Problem with Unit Processing Times and Tree Constraints.
Discret. Appl. Math., 1995
1993
Oper. Res. Lett., 1993
On the heuristic solution of the permutation flow shop problem by path algorithms.
Comput. Oper. Res., 1993
Computing, 1993
1991
ZOR Methods Model. Oper. Res., 1991
1989
Zur Struktur und näherungsweisen Lösung ausgewählter kombinatorischer Optimierungsprobleme.
PhD thesis, 1989