Frank Werner mostly deals with Mathematical optimization, Flow shop scheduling, Job shop scheduling, Scheduling and Algorithm. Mathematical optimization is closely attributed to Nurse scheduling problem in his study. The concepts of his Flow shop scheduling study are interwoven with issues in Stability and Maximum flow problem.
His research in Job shop scheduling intersects with topics in Schedule, Optimization problem, Scheduling and Dynamic priority scheduling. His Scheduling research incorporates themes from Time complexity and Penalty method. His studies in Algorithm integrate themes in fields like Genetic algorithm and Neighbourhood graph.
Frank Werner mainly investigates Mathematical optimization, Scheduling, Job shop scheduling, Flow shop scheduling and Algorithm. His work in Mathematical optimization addresses issues such as Single-machine scheduling, which are connected to fields such as Preemption. Frank Werner works mostly in the field of Scheduling, limiting it down to topics relating to Simulated annealing and, in certain cases, Tabu search.
As a part of the same scientific study, Frank Werner usually deals with the Job shop scheduling, concentrating on Dynamic priority scheduling and frequently concerns with Distributed computing. His work carried out in the field of Flow shop scheduling brings together such families of science as Beam search, Operations research, Discrete mathematics and Fair-share scheduling. He interconnects Single server and Combinatorics in the investigation of issues within Algorithm.
Mathematical optimization, Scheduling, Job shop scheduling, Scheduling and Tardiness are his primary areas of study. Frank Werner combines subjects such as Schedule, Single-machine scheduling and Job shop with his study of Mathematical optimization. He has included themes like Upper and lower bounds and Inverse problem in his Scheduling study.
The Job shop scheduling study combines topics in areas such as Time complexity, Heuristics, Metaheuristic and Operations research. His Scheduling research is multidisciplinary, incorporating elements of Projection, Algorithm, Optimization problem and Optimal control. His work deals with themes such as Simulated annealing and Open problem, which intersect with Tardiness.
His primary scientific interests are in Job shop scheduling, Mathematical optimization, Scheduling, Scheduling and Industrial engineering. His Job shop scheduling research is multidisciplinary, incorporating perspectives in Dynamic priority scheduling, Metaheuristic and Operations research. His Mathematical optimization research includes themes of Fair-share scheduling, Schedule, Tardiness and Job shop.
His Scheduling study combines topics from a wide range of disciplines, such as Optimization algorithm, Digital manufacturing, Flow shop scheduling and Optimal control. His Scheduling research is multidisciplinary, relying on both Uncertain data and Distributed computing. His biological study spans a wide range of topics, including Tabu search and Job shop scheduling problem.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
A dynamic model and an algorithm for short-term supply chain scheduling in the smart factory industry 4.0
Dmitry Ivanov;Alexandre Dolgui;Boris Sokolov;Frank Werner.
(2016)
Blockchain-oriented dynamic modelling of smart contract design and execution in the supply chain
Alexandre Dolgui;Dmitry A. Ivanov;Semyon A. Potryasaev;Boris V. Sokolov.
(2020)
A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
Jitti Jungwattanakit;Manop Reodecha;Paveena Chaovalitwongse;Frank Werner.
(2009)
Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey
V. Lauff;F. Werner.
(2004)
Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
Jitti Jungwattanakit;Manop Reodecha;Paveena Chaovalitwongse;Frank Werner.
(2008)
Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
J. Bank;F. Werner.
(2001)
Heuristics for hybrid flow shops with controllable processing times and assignable due dates
Jatinder N. D. Gupta;Karin Krüger;Volker Lauff;Frank Werner.
(2002)
Parallel machine scheduling problems with a single server
S. A. Kravchenko;F. Werner.
(1997)
Insertion techniques for the heuristic solution of the job shop problem
Frank Werner;Andreas Winkler.
(1995)
Improving local search heuristics for some scheduling problems. Part II
Peter Brucker;Johann Hurink;Frank Werner.
Discrete Applied Mathematics (1996)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
IMT Atlantique
National University of La Plata
Radboud University Nijmegen
University of Buenos Aires
University of Erlangen-Nuremberg
Microsoft (United States)
University of Seville
University of Chicago
Georgia Institute of Technology
Sofia University
Northwestern Polytechnical University
Max Planck Society
Columbia University
University of California, San Diego
University of New South Wales
Fudan University
Brigham Young University
National Autonomous University of Mexico
François Rabelais University
University of Houston