Остановите войну!
for scientists:
default search action
Frank Werner 0001
- > Home > Persons > Frank Werner 0001
Publications
- 2023
- [i4]Evgeny R. Gafarov, Frank Werner:
Connected and Autonomous Vehicle Scheduling Problems: Some Models and Algorithms. CoRR abs/2304.01806 (2023) - [i3]Abdelhak Elidrissi, Rachid Benmansour, Keramat Hasani, Frank Werner:
Scheduling on parallel machines with a common server in charge of loading and unloading operations. CoRR abs/2306.16669 (2023) - 2022
- [j86]Alexander N. Pavlov, Dmitry A. Ivanov, Frank Werner, Alexandre Dolgui, Boris V. Sokolov:
Integrated detection of disruption scenarios, the ripple effect dispersal and recovery paths in supply chains. Ann. Oper. Res. 319(1): 609-631 (2022) - [i2]Nodari Vakhania, Frank Werner, Alejandro Reynoso:
Scheduling a single machine with compressible jobs to minimize maximum lateness. CoRR abs/2203.09800 (2022) - 2021
- [j82]Dmitry A. Ivanov, Boris V. Sokolov, Weiwei Chen, Alexandre Dolgui, Frank Werner, Semyon A. Potryasaev:
A control approach to scheduling flexibly configurable jobs with dynamic structural-logical constraints. IISE Trans. 53(1): 21-38 (2021) - 2020
- [j81]Evgeny R. Gafarov, Alexander A. Lazarev, Frank Werner:
Minimizing Total Weighted Tardiness for Scheduling Equal-Length Jobs on a Single Machine. Autom. Remote. Control. 81(5): 853-868 (2020) - [j80]Frank Werner, Larysa Burtseva, Yuri N. Sotskov:
Special Issue on Exact and Heuristic Scheduling Algorithms. Algorithms 13(1): 9 (2020) - [j79]Alexandre Dolgui, Dmitry A. Ivanov, Semyon A. Potryasaev, Boris V. Sokolov, Marina Ivanova, Frank Werner:
Blockchain-oriented dynamic modelling of smart contract design and execution in the supply chain. Int. J. Prod. Res. 58(7): 2184-2199 (2020) - 2019
- [j78]Omid Gholami, Yuri N. Sotskov, Frank Werner, A. S. Zatsiupo:
Heuristic Algorithms to Maximize Revenue and the Number of Jobs Processed on Parallel Machines. Autom. Remote. Control. 80(2): 297-316 (2019) - [j76]Tsui-Ping Chung, Jatinder N. D. Gupta, Haidan Zhao, Frank Werner:
Minimizing the makespan on two identical parallel machines with mold constraints. Comput. Oper. Res. 105: 141-155 (2019) - 2018
- [j73]Frank Werner, Larysa Burtseva, Yuri N. Sotskov:
Special Issue on Algorithms for Scheduling Problems. Algorithms 11(6): 87 (2018) - [j72]Vidblain Amaro-Ortega, Arnoldo Díaz-Ramírez, Brenda Leticia Flores Ríos, Félix Fernando González-Navarro, Frank Werner, Larysa Burtseva:
A scheduling extension scheme of the earliest deadline first policy for hard real-time uniprocessor systems integrated on POSIX threads based on Linux. Comput. Syst. Sci. Eng. 33(1) (2018) - [j71]Ali Allahverdi, Erwin Pesch, Michael L. Pinedo, Frank Werner:
Scheduling in manufacturing systems: new trends and perspectives. Int. J. Prod. Res. 56(19): 6333-6335 (2018) - [j70]Tsung-Chyan Lai, Yuri N. Sotskov, Natalja G. Egorova, Frank Werner:
The optimality box in uncertain data for minimising the sum of the weighted job completion times. Int. J. Prod. Res. 56(19): 6336-6362 (2018) - 2017
- [j66]Philippe Baptiste, Mikhail Y. Kovalyov, Yury L. Orlovich, Frank Werner, Igor E. Zverovich:
Graphs with maximal induced matchings of the same size. Discret. Appl. Math. 216: 15-28 (2017) - [j65]Yury Metelsky, Kseniya Schemeleva, Frank Werner:
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 37(1): 13-28 (2017) - [j64]Alexander A. Lazarev, Dmitry I. Arkhipov, Frank Werner:
Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan. Optim. Lett. 11(1): 165-177 (2017) - 2016
- [j63]Evgeny R. Gafarov, Alexandre Dolgui, Alexander A. Lazarev, Frank Werner:
A new effective dynamic program for an investment optimization problem. Autom. Remote. Control. 77(9): 1633-1648 (2016) - 2014
- [j62]Evgeny R. Gafarov, Alexander A. Lazarev, Frank Werner:
Approximability results for the resource-constrained project scheduling problem with a single type of resources. Ann. Oper. Res. 213(1): 115-130 (2014) - [j61]Keramat Hasani, Svetlana A. Kravchenko, Frank Werner:
Block models for scheduling jobs on two parallel machines with a single server. Comput. Oper. Res. 41: 94-97 (2014) - [j60]Keramat Hasani, Svetlana A. Kravchenko, Frank Werner:
Minimizing total weighted completion time approximately for the parallel machine problem with a single server. Inf. Process. Lett. 114(9): 500-503 (2014) - [j59]Evgeny R. Gafarov, Alexandre Dolgui, Alexander A. Lazarev, Frank Werner:
A Graphical Approach to Solve an Investment Optimization Problem. J. Math. Model. Algorithms Oper. Res. 13(4): 597-614 (2014) - 2013
- [j58]Evgeny R. Gafarov, Alexander A. Lazarev, Frank Werner:
Single machine total tardiness maximization problems: complexity and algorithms. Ann. Oper. Res. 207(1): 121-136 (2013) - [j57]Evgeny R. Gafarov, Alexander A. Lazarev, Frank Werner:
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. 65(3): 232 (2013) - [j56]Yuri N. Sotskov, Tsung-Chyan Lai, Frank Werner:
Measures of problem uncertainty for scheduling with interval processing times. OR Spectr. 35(3): 659-689 (2013) - [j55]Svetlana A. Kravchenko, Frank Werner:
Erratum to: Minimizing total tardiness on parallel machines with preemptions. J. Sched. 16(4): 439-441 (2013) - [j54]Nodari Vakhania, Frank Werner:
Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time. Theor. Comput. Sci. 501: 72-81 (2013) - [c8]Evgeny R. Gafarov, Alexandre Dolgui, Alexander A. Lazarev, Frank Werner:
A Graphical Approach for Solving Single Machine Scheduling Problems Approximately. MIM 2013: 1340-1345 - [c7]Yuri N. Sotskov, Omid Gholami, Frank Werner:
Solving a Job-Shop Scheduling Problem by an Adaptive Algorithm Based on Learning. MIM 2013: 1352-1357 - [c6]Keramat Hasani, Svetalana Kravchenko, Frank Werner:
Makespan Minimization for a Two-Machine Scheduling Problem with a Single Server. MIM 2013: 1364-1369 - 2012
- [j53]Adam Janiak, Wladyslaw A. Janiak, Mikhail Y. Kovalyov, Frank Werner:
Soft due window assignment and scheduling of unit-time jobs on parallel machines. 4OR 10(4): 347-360 (2012) - [j52]Evgeny R. Gafarov, Alexander A. Lazarev, Frank Werner:
Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one. Ann. Oper. Res. 196(1): 247-261 (2012) - [j51]Alexander A. Lazarev, Vincent T'kindt, Frank Werner:
Guest Editorial. Comput. Oper. Res. 39(6): 1195-1196 (2012) - [j50]Evgeny R. Gafarov, Alexander A. Lazarev, Frank Werner:
A note on a single machine scheduling problem with generalized total tardiness objective function. Inf. Process. Lett. 112(3): 72-76 (2012) - [j49]Svetlana A. Kravchenko, Frank Werner:
Minimizing total tardiness on parallel machines with preemptions. J. Sched. 15(2): 193-200 (2012) - [c5]Omid Gholami, Yuri N. Sotskov, Frank Werner:
Job-shop Problems with Objectives Appropriate for Train Scheduling in a Single-track Railway. SIMULTECH 2012: 425-430 - 2011
- [j48]Yury L. Orlovich, Alexandre Dolgui, Gerd Finke, Valery S. Gordon, Frank Werner:
The complexity of dissociation set problems in graphs. Discret. Appl. Math. 159(13): 1352-1366 (2011) - [j47]Evgeny R. Gafarov, Alexander A. Lazarev, Frank Werner:
Single machine scheduling problems with financial resource constraints: Some complexity results and properties. Math. Soc. Sci. 62(1): 7-13 (2011) - [j46]Svetlana A. Kravchenko, Frank Werner:
Parallel machine problems with equal processing times: a survey. J. Sched. 14(5): 435-444 (2011) - [c4]Yuri N. Sotskov, Natalja G. Egorova, Tsung-Chyan Lai, Frank Werner:
The Stability Box in Interval Data for Minimizing the Sum of Weighted Completion Times. SIMULTECH 2011: 14-23 - [c3]Yuri N. Sotskov, Tsung-Chyan Lai, Frank Werner:
The Stability Box for Minimizing Total Weighted Flow Time under Uncertain Data. SIMULTECH (Selected Papers) 2011: 39-55 - 2009
- [j45]Alexander A. Lazarev, Frank Werner:
A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems. Comput. Math. Appl. 58(4): 619-631 (2009) - [j44]Gerd Finke, Vitaly A. Strusevich, Frank Werner:
Guest Editorial. Comput. Oper. Res. 36(2): 299-300 (2009) - [j42]Svetlana A. Kravchenko, Frank Werner:
Preemptive scheduling on uniform machines to minimize mean flow time. Comput. Oper. Res. 36(10): 2816-2821 (2009) - [j41]Svetlana A. Kravchenko, Frank Werner:
On a parallel machine scheduling problem with equal processing times. Discret. Appl. Math. 157(4): 848-852 (2009) - [j40]Svetlana A. Kravchenko, Frank Werner:
Minimizing the number of machines for scheduling jobs with equal processing times. Eur. J. Oper. Res. 199(2): 595-600 (2009) - [j39]Alexander A. Lazarev, Frank Werner:
Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem. Math. Comput. Model. 49(9-10): 2061-2072 (2009) - 2008
- [j38]Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date. Comput. Oper. Res. 35(2): 574-599 (2008) - [j37]Valery S. Gordon, Yury L. Orlovich, Frank Werner:
Hamiltonian properties of triangular grid graphs. Discret. Math. 308(24): 6166-6188 (2008) - [j36]Heidemarie Bräsel, André Herms, Marc Mörig, Thomas Tautenhahn, Jan Tusch, Frank Werner:
Heuristic constructive algorithms for open shop scheduling to minimize mean flow time. Eur. J. Oper. Res. 189(3): 856-870 (2008) - [j35]Michael Andresen, Heidemarie Bräsel, Marc Mörig, Jan Tusch, Frank Werner, Per Willenius:
Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop. Math. Comput. Model. 48(7-8): 1279-1293 (2008) - 2007
- [j34]Mikhail Y. Kovalyov, Frank Werner:
Problem F2∥Cmax with forbidden jobs in the first or last position is easy. Eur. J. Oper. Res. 177(2): 1310-1311 (2007) - [j33]Peter Brucker, Yuri N. Sotskov, Frank Werner:
Complexity of shop-scheduling problems with fixed number of jobs: a survey. Math. Methods Oper. Res. 65(3): 461-481 (2007) - [j32]Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
A note on the two machine job shop with the weighted late work criterion. J. Sched. 10(2): 87-95 (2007) - 2006
- [j31]Karl Inderfurth, Adam Janiak, Mikhail Y. Kovalyov, Frank Werner:
Batching work and rework processes with limited deterioration of reworkables. Comput. Oper. Res. 33: 1595-1605 (2006) - 2005
- [j28]Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
A comparison of solution procedures for two-machine flow shop scheduling with late work criterion. Comput. Ind. Eng. 49(4): 611-624 (2005) - [j27]Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
The two-machine flow-shop problem with weighted late work criterion and common due date. Eur. J. Oper. Res. 165(2): 408-415 (2005) - [j26]Adam Janiak, Mikhail Y. Kovalyov, Wieslaw Kubiak, Frank Werner:
Positive half-products and scheduling with controllable processing times. Eur. J. Oper. Res. 165(2): 416-422 (2005) - [c2]Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
Metaheuristics for Late Work Minimization in Two-Machine Flow Shop with Common Due Date. KI 2005: 222-234 - 2004
- [j25]Volker Lauff, Frank Werner:
On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties. Comput. Oper. Res. 31(3): 317-345 (2004) - [j24]Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
Open shop scheduling problems with late work criteria. Discret. Appl. Math. 134(1-3): 1-24 (2004) - [j23]Tsung-Chyan Lai, Yuri N. Sotskov, Nadezhda Sotskova, Frank Werner:
Mean flow time minimization with given bounds of processing times. Eur. J. Oper. Res. 159(3): 558-573 (2004) - [j22]Jatinder N. D. Gupta, Volker Lauff, Frank Werner:
Two-Machine Flow Shop Scheduling with Nonregular Criteria. J. Math. Model. Algorithms 3(2): 123-151 (2004) - [j21]Volker Lauff, Frank Werner:
Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey. Math. Comput. Model. 40(5-6): 637-655 (2004) - [c1]Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
Flow Shop Scheduling with Late Work Criterion - Choosing the Best Solution Strategy. AACC 2004: 68-75 - 2002
- [j20]Jatinder N. D. Gupta, Karsten Hennig, Frank Werner:
Local search heuristics for two-stage flow shop problems with secondary criterion. Comput. Oper. Res. 29(2): 123-149 (2002) - [j19]Jatinder N. D. Gupta, Karin Krüger, Volker Lauff, Frank Werner, Yuri N. Sotskov:
Heuristics for hybrid flow shops with controllable processing times and assignable due dates. Comput. Oper. Res. 29(10): 1417-1439 (2002) - [j18]Mikhail Y. Kovalyov, Frank Werner:
Approximation Schemes for Scheduling Jobs with Common Due Date on Parallel Machines to Minimize Total Tardiness. J. Heuristics 8(4): 415-428 (2002) - 2001
- [j17]Svetlana A. Kravchenko, Frank Werner:
A heuristic algorithm for minimizing mean flow time with unit setups. Inf. Process. Lett. 79(6): 291-296 (2001) - [j16]Valery S. Gordon, Frank Werner, O. A. Yanushkevich:
Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals. RAIRO Oper. Res. 35(1): 71-83 (2001) - 2000
- [j15]Natalia V. Shakhlevich, Yuri N. Sotskov, Frank Werner:
Complexity of mixed shop scheduling problems: A survey. Eur. J. Oper. Res. 120(2): 343-351 (2000) - 1999
- [j14]Natalia V. Shakhlevich, Yuri N. Sotskov, Frank Werner:
Shop‐scheduling problems with fixed and non‐fixedmachine orders of the jobs. Ann. Oper. Res. 92: 281-304 (1999) - [j13]Yuri N. Sotskov, Thomas Tautenhahn, Frank Werner:
On the application of insertion techniques for job shop problems with setup times. RAIRO Oper. Res. 33(2): 209-245 (1999) - 1998
- [j12]Heidemarie Bräsel, Frank Werner:
Preface. Ann. Oper. Res. 83 (1998) - [j11]Peter Brucker, Mikhail Y. Kovalyov, Yakov M. Shafransky, Frank Werner:
Batch scheduling with deadlines on parallel machines. Ann. Oper. Res. 83: 23-40 (1998) - [j10]Yuri N. Sotskov, Albert P. M. Wagelmans, Frank Werner:
On the calculation of the stability radiusof an optimal or an approximate schedule. Ann. Oper. Res. 83: 213-252 (1998) - 1997
- [j9]Peter Brucker, Johann L. Hurink, Frank Werner:
Improving Local Search Heuristics for some Scheduling Problems. Part II. Discret. Appl. Math. 72(1-2): 47-69 (1997) - [j8]Mikhail Y. Kovalyov, Frank Werner:
A polynomial approximation scheme for problem F2/rj/Cmax. Oper. Res. Lett. 20(2): 75-79 (1997) - 1996
- [j7]Peter Brucker, Johann L. Hurink, Frank Werner:
Improving Local Search Heuristics for Some Scheduling Problems-I. Discret. Appl. Math. 65(1-3): 97-122 (1996) - 1995
- [j5]Heidemarie Bräsel, David Kluge, Frank Werner:
A Polynomial Algorithm for an open Shop Problem with Unit Processing Times and Tree Constraints. Discret. Appl. Math. 59(1): 11-21 (1995) - 1993
- [j4]Heidemarie Bräsel, Thomas Tautenhahn, Frank Werner:
Constructive heuristic algorithms for the open shop problem. Computing 51(2): 95-110 (1993) - [j2]Peter Brucker, Bernd Jurisch, Thomas Tautenhahn, Frank Werner:
Scheduling unit time open shops to minimize the weighted number of late jobs. Oper. Res. Lett. 14(5): 245-250 (1993)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-21 18:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint