Frank Werner
According to our database^{1},
Frank Werner
authored at least 81 papers
between 1989 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at zbmath.org

at orcid.org
On csauthors.net:
Bibliography
2018
Approaches to modeling train scheduling problems as jobshop problems with blocking constraints.
J. Scheduling, 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
Special Issue on Algorithms for Scheduling Problems.
Algorithms, 2018
2017
Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan.
Optimization Letters, 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.
Discussiones Mathematicae Graph Theory, 2017
Graphs with maximal induced matchings of the same size.
Discrete Applied Mathematics, 2017
A PermutationBased Neighborhood for the Blocking JobShop Problem with Total Tardiness Minimization.
Proceedings of the Operations Research Proceedings 2017, 2017
2016
A new effective dynamic program for an investment optimization problem.
Automation and 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
A Graphical Approach to Solve an Investment Optimization Problem.
J. Math. Model. Algorithms in OR, 2014
Minimizing total weighted completion time approximately for the parallel machine problem with a single server.
Inf. Process. Lett., 2014
Block models for scheduling jobs on two parallel machines with a single server.
Computers & OR, 2014
Approximability results for the resourceconstrained project scheduling problem with a single type of resources.
Annals OR, 2014
2013
Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time.
Theor. Comput. Sci., 2013
Erratum to: Minimizing total tardiness on parallel machines with preemptions.
J. Scheduling, 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.
Mathematical Social Sciences, 2013
Single machine total tardiness maximization problems: complexity and algorithms.
Annals OR, 2013
Solving a JobShop Scheduling Problem by an Adaptive Algorithm Based on Learning.
Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013
Makespan Minimization for a TwoMachine Scheduling Problem with a Single Server.
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
Minimizing total tardiness on parallel machines with preemptions.
J. Scheduling, 2012
A note on a single machine scheduling problem with generalized total tardiness objective function.
Inf. Process. Lett., 2012
Guest Editorial.
Computers & OR, 2012
Transforming a pseudopolynomial algorithm for the single machine total tardiness maximization problem into a polynomial one.
Annals OR, 2012
Soft due window assignment and scheduling of unittime jobs on parallel machines.
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
Parallel machine problems with equal processing times: a survey.
J. Scheduling, 2011
Single machine scheduling problems with financial resource constraints: Some complexity results and properties.
Mathematical Social Sciences, 2011
The complexity of dissociation set problems in graphs.
Discrete Applied Mathematics, 2011
The Stability Box for Minimizing Total Weighted Flow Time under Uncertain Data.
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
2010
Correctness of Sensor Network Applications by Software Bounded Model Checking.
Proceedings of the Formal Methods for Industrial Critical Systems, 2010
2009
Applied Formal Methods in Wireless Sensor Networks.
PhD thesis, 2009
Algorithms for special cases of the single machine total tardiness problem and an application to the evenodd partition problem.
Mathematical and Computer Modelling, 2009
Minimizing the number of machines for scheduling jobs with equal processing times.
European Journal of Operational Research, 2009
On a parallel machine scheduling problem with equal processing times.
Discrete Applied Mathematics, 2009
Preemptive scheduling on uniform machines to minimize mean flow time.
Computers & OR, 2009
A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria.
Computers & OR, 2009
Guest Editorial.
Computers & OR, 2009
A graphical realization of the dynamic programming method for solving NPhard combinatorial problems.
Computers & Mathematics with Applications, 2009
2008
Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop.
Mathematical and Computer Modelling, 2008
Heuristic constructive algorithms for open shop scheduling to minimize mean flow time.
European Journal of Operational Research, 2008
Hamiltonian properties of triangular grid graphs.
Discrete Mathematics, 2008
Metaheuristic approaches for the twomachine flowshop problem with weighted late work criterion and common due date.
Computers & OR, 2008
2007
A note on the two machine job shop with the weighted late work criterion.
J. Scheduling, 2007
Complexity of shopscheduling problems with fixed number of jobs: a survey.
Math. Meth. of OR, 2007
Problem F2∥C_{max} with forbidden jobs in the first or last position is easy.
European Journal of Operational Research, 2007
2006
Book Review: Michael L. Pinedo (2005): ISBN 0387221980, Springer, New York  Planning and Scheduling in Manufacturing and Services.
Math. Meth. of OR, 2006
V. T'Kindt and J.C. Billaut, Multicriteria Scheduling. Theory, Models and Algorithms, Springer Verlag (2002) ISBN 3540436170.
European Journal of Operational Research, 2006
Batching work and rework processes with limited deterioration of reworkables.
Computers & OR, 2006
2005
Positive halfproducts and scheduling with controllable processing times.
European Journal of Operational Research, 2005
The twomachine flowshop problem with weighted late work criterion and common due date.
European Journal of Operational Research, 2005
A comparison of solution procedures for twomachine flow shop scheduling with late work criterion.
Computers & Industrial Engineering, 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.
Mathematical and Computer Modelling, 2004
TwoMachine Flow Shop Scheduling with Nonregular Criteria.
J. Math. Model. Algorithms, 2004
Mean flow time minimization with given bounds of processing times.
European Journal of Operational Research, 2004
Open shop scheduling problems with late work criteria.
Discrete Applied Mathematics, 2004
On the complexity and some properties of multistage scheduling problems with earliness and tardiness penalties.
Computers & OR, 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.
Computers & OR, 2002
Local search heuristics for twostage flow shop problems with secondary criterion.
Computers & OR, 2002
2001
Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals.
RAIRO  Operations Research, 2001
A heuristic algorithm for minimizing mean flow time with unit setups.
Inf. Process. Lett., 2001
2000
Complexity of mixed shop scheduling problems: A survey.
European Journal of Operational Research, 2000
1999
On the application of insertion techniques for job shop problems with setup times.
RAIRO  Operations Research, 1999
Shop‐scheduling problems with fixed and non‐fixedmachine orders of the jobs.
Annals OR, 1999
1998
On the calculation of the stability radiusof an optimal or an approximate schedule.
Annals OR, 1998
Batch scheduling with deadlines on parallel machines.
Annals OR, 1998
Preface.
Annals OR, 1998
1997
A polynomial approximation scheme for problem F2/r_{j}/C_{max}.
Oper. Res. Lett., 1997
Improving Local Search Heuristics for some Scheduling Problems. Part II.
Discrete Applied Mathematics, 1997
1996
Improving Local Search Heuristics for Some Scheduling ProblemsI.
Discrete Applied Mathematics, 1996
1995
Insertion Techniques for the Heuristic Solution of the Job Shop Problem.
Discrete Applied Mathematics, 1995
A Polynomial Algorithm for an open Shop Problem with Unit Processing Times and Tree Constraints.
Discrete Applied Mathematics, 1995
1993
Scheduling unit time open shops to minimize the weighted number of late jobs.
Oper. Res. Lett., 1993
On the heuristic solution of the permutation flow shop problem by path algorithms.
Computers & OR, 1993
Constructive heuristic algorithms for the open shop problem.
Computing, 1993
1991
On the combinatorial structure of the permutation flow shop problem.
ZOR  Meth. & Mod. of OR, 1991
1989
Zur Struktur und näherungsweisen Lösung ausgewählter kombinatorischer Optimierungsprobleme.
PhD thesis, 1989