Publications

• Public

  A note on the paper 'Single machine scheduling problems with financial resource constraints: Some complexity results and properties' by E.R. Gafarov etal.: Mathematical Social Sciences 2013

  DOI: 10.1016/j.mathsocsci.2012.11.004
  http://www.scopus.com/inward/record.url?eid=2-s2.0-84875269245&partnerID=MN8TOARS
  Gafarov, E.R. and Lazarev, A.A. and Werner, F., (2013). "A note on the paper 'Single machine scheduling problems with financial resource constraints: Some complexity results and properties' by E.R. Gafarov etal.", Mathematical Social Sciences, vol. 65, no. 3
• Public

  Erratum to: Minimizing total tardiness on parallel machines with preemptions: Journal of Scheduling 2013

  DOI: 10.1007/s10951-013-0313-5
  http://www.scopus.com/inward/record.url?eid=2-s2.0-84872680819&partnerID=MN8TOARS
  Kravchenko, S.A. and Werner, F., (2013). "Erratum to: Minimizing total tardiness on parallel machines with preemptions", Journal of Scheduling, pp. 1-3
• Public

  A graphical approach to solve combinatorial problems: Algorithms and some computational results: IFAC Proceedings Volumes (IFAC-PapersOnline) 2012

  DOI: 10.3182/20120523-3-RO-2023.00119
  http://www.scopus.com/inward/record.url?eid=2-s2.0-84866116116&partnerID=MN8TOARS
  Gafarov, E.R. and Lazarev, A.A. and Werner, F., (2012). "A graphical approach to solve combinatorial problems: Algorithms and some computational results", IFAC Proceedings Volumes (IFAC-PapersOnline), vol. 14, no. PART 1, pp. 127-132
• Public

  A note on a single machine scheduling problem with generalized total tardiness objective function: Information Processing Letters 2012

  DOI: 10.1016/j.ipl.2011.10.013
  Gafarov, Evgeny R. and Lazarev, Alexander A. and Werner, Frank, (2012). "A note on a single machine scheduling problem with generalized total tardiness objective function", Information Processing Letters, vol. 112, no. 3, pp. 72-76
• Public

  A polynomially solvable case of a single machine scheduling problem when the maximal job processing time is a constant: IFAC Proceedings Volumes (IFAC-PapersOnline) 2012

  DOI: 10.3182/20120523-3-RO-2023.00053
  http://www.scopus.com/inward/record.url?eid=2-s2.0-84866107702&partnerID=MN8TOARS
  Vakhania, N. and Werner, F., (2012). "A polynomially solvable case of a single machine scheduling problem when the maximal job processing time is a constant", IFAC Proceedings Volumes (IFAC-PapersOnline), vol. 14, no. PART 1, pp. 117-122
• Public

  Approximability results for the resource-constrained project scheduling problem with a single type of resources: Annals of Operations Research 2012

  DOI: 10.1007/s10479-012-1106-5
  http://www.scopus.com/inward/record.url?eid=2-s2.0-84857975601&partnerID=MN8TOARS
  Gafarov, E.R. and Lazarev, A.A. and Werner, F., (2012). "Approximability results for the resource-constrained project scheduling problem with a single type of resources", Annals of Operations Research, pp. 1-16
• Public

  Calculation of the stability radius of an optimal line balance: IFAC Proceedings Volumes (IFAC-PapersOnline) 2012

  DOI: 10.3182/20120523-3-RO-2023.00058
  http://www.scopus.com/inward/record.url?eid=2-s2.0-84866125926&partnerID=MN8TOARS
  Sotskov, Y.N. and Werner, F. and Zatsiupa, A., (2012). "Calculation of the stability radius of an optimal line balance", IFAC Proceedings Volumes (IFAC-PapersOnline), vol. 14, no. PART 1, pp. 139-144
• Public

  Graphs with maximal induced matchings of the same size: IFAC Proceedings Volumes (IFAC-PapersOnline) 2012

  DOI: 10.3182/20120523-3-RO-2023.00065
  http://www.scopus.com/inward/record.url?eid=2-s2.0-84866065144&partnerID=MN8TOARS
  Baptiste, P. and Kovalyov, M.Y. and Orlovich, Y.L. and Werner, F. and Zverovich, I.E., (2012). "Graphs with maximal induced matchings of the same size", IFAC Proceedings Volumes (IFAC-PapersOnline), vol. 14, no. PART 1, pp. 57-62
• Public

  Guest editorial: Computers and Operations Research 2012

  DOI: 10.1016/j.cor.2011.09.001
  http://www.scopus.com/inward/record.url?eid=2-s2.0-80053358469&partnerID=MN8TOARS
  Lazarev, A. and Tkindt, V. and Werner, F., (2012). "Guest editorial", Computers and Operations Research, vol. 39, no. 6, pp. 1195-1196
• Public

  Job-shop problems with objectives appropriate for train scheduling in a single-track railway: SIMULTECH 2012 - Proceedings of the 2nd International Conference on Simulation and Modeling Methodologies, Technologies and Applications 2012

  http://www.scopus.com/inward/record.url?eid=2-s2.0-84867717851&partnerID=MN8TOARS
  Gholami, O. and Sotskov, Y.N. and Werner, F., (2012). "Job-shop problems with objectives appropriate for train scheduling in a single-track railway", SIMULTECH 2012 - Proceedings of the 2nd International Conference on Simulation and Modeling Methodologies, Technologies and Applications, pp. 425-430
• Public

  Measures of problem uncertainty for scheduling with interval processing times: OR Spectrum 2012

  DOI: 10.1007/s00291-012-0306-3
  http://www.scopus.com/inward/record.url?eid=2-s2.0-84866170690&partnerID=MN8TOARS
  Sotskov, Y.N. and Lai, T.-C. and Werner, F., (2012). "Measures of problem uncertainty for scheduling with interval processing times", OR Spectrum, pp. 1-31
• Public

  Minimizing total tardiness on parallel machines with preemptions: Journal of Scheduling 2012

  DOI: 10.1007/s10951-010-0198-5
  Kravchenko, Svetlana A. and Werner, Frank, (2012). "Minimizing total tardiness on parallel machines with preemptions", Journal of Scheduling, vol. 15, no. 2, pp. 193-200
• Public

  Near to optimal size selection in combinatorial circuits: IFAC Proceedings Volumes (IFAC-PapersOnline) 2012

  DOI: 10.3182/20120523-3-RO-2023.00060
  http://www.scopus.com/inward/record.url?eid=2-s2.0-84866132457&partnerID=MN8TOARS
  Vakhania, N. and Werner, F., (2012). "Near to optimal size selection in combinatorial circuits", IFAC Proceedings Volumes (IFAC-PapersOnline), vol. 14, no. PART 1, pp. 63-68
• Public

  Polynomial algorithms for scheduling jobs with two processing times on unrelated machines: IFAC Proceedings Volumes (IFAC-PapersOnline) 2012

  DOI: 10.3182/20120523-3-RO-2023.00055
  http://www.scopus.com/inward/record.url?eid=2-s2.0-84866087394&partnerID=MN8TOARS
  Vakhania, N. and Werner, F., (2012). "Polynomial algorithms for scheduling jobs with two processing times on unrelated machines", IFAC Proceedings Volumes (IFAC-PapersOnline), vol. 14, no. PART 1, pp. 93-97
• Public

  Search on the enumeration tree in the multiprocessor job-shop problem: IFAC Proceedings Volumes (IFAC-PapersOnline) 2012

  DOI: 10.3182/20120523-3-RO-2023.00414
  http://www.scopus.com/inward/record.url?eid=2-s2.0-84866071216&partnerID=MN8TOARS
  Carballo, L. and Lazarev, A.A. and Vakhania, N. and Werner, F., (2012). "Search on the enumeration tree in the multiprocessor job-shop problem", IFAC Proceedings Volumes (IFAC-PapersOnline), vol. 14, no. PART 1, pp. 81-86
• Public

  Single machine total tardiness maximization problems: complexity and algorithms: Annals of Operations Research 2012

  DOI: 10.1007/s10479-012-1288-x
  http://www.scopus.com/inward/record.url?eid=2-s2.0-84871480754&partnerID=MN8TOARS
  Gafarov, E.R. and Lazarev, A.A. and Werner, F., (2012). "Single machine total tardiness maximization problems: complexity and algorithms", Annals of Operations Research, pp. 1-16
• Public

  Soft due window assignment and scheduling of unit-time jobs on parallel machines: 4or-a Quarterly Journal of Operations Research 2012

  DOI: 10.1007/s10288-012-0201-4
  Janiak, Adam and Janiak, Wladyslaw and Kovalyov, Mikhail Y. and Werner, Frank, (2012). "Soft due window assignment and scheduling of unit-time jobs on parallel machines", 4or-a Quarterly Journal of Operations Research, vol. 10, no. 4, pp. 347-360
• Public

  Special Issue on Scheduling in Manufacturing Systems: Computers & Operations Research 2012

  DOI: 10.1016/j.cor.2011.09.001
  Lazarev, Alexander and T'kindt, Vincent and Werner, Frank, (2012). "Special Issue on Scheduling in Manufacturing Systems", Computers & Operations Research, vol. 39, no. 6, pp. 1195-1196
• Public

  Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one: Annals of Operations Research 2012

  DOI: 10.1007/s10479-011-1055-4
  Gafarov, Evgeny R. and Lazarev, Alexander A. and Werner, Frank, (2012). "Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one", Annals of Operations Research, vol. 196, no. 1, pp. 247-261
• Public

  IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011: Preface: IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011 2011

  http://www.scopus.com/inward/record.url?eid=2-s2.0-79960607267&partnerID=MN8TOARS
  Abdelkader, Y.H. and Ait-Kadi, D. and Al-Najjar, B. and Allahverdi, A. and Amavasai, B.P. and Henggeler, C. and Bouchaffra, D. and Bose, I. and Brabazon, A. and Brdys, M. and Cacheda, F. and Chan, A.H.-S. and Chan, F.T.S. and Chang, C.-C. and Chaudhuri, P. and Chen, C.-H. and Chen, C.S. and Chen, M.-S. and Chen, Q. and Choy, W. and Chung, T.S. and Clubb, O.L. and Damasio, M.J. and Dang, C. and Djordjevich, A. and Fung, Y.-F. and Ganesan, G. and Leng, R.G.K. and Sing, G.O. and Gracia, A.M. and Gu, Z. and Gulpinar, N. and Heaton-Adegbile, P. and Herrera-Viedma, E. and Herrero, J.R. and Huang, X. and Hwang, C.-K. and Hwang, H.S. and Ishihara, S. and Jia, L. and Kannan, R. and Karatzas, G.P. and Katagiri, H. and Kendall, G. and Kikuta, K. and Kim, H.K. and Kim, S.-I. and Kothari, C. and Krishnamoorthy, M. and Kumamoto, T. and Kwan, R. and Lee, H.W. and Li, L. and Li, X. and Li, Y. and Lin, C.-M. and Liu, B. and Liu, L. and Lopez, E.M.M. and Luk, C. and Maeda, K. and Mahanti, P.K. and Mahmoud, Q.H. and Matsatsinis, N. and Mavrommatis, G. and McGuigan, M. and Melin, P. and Mikhailov, L. and Mineno, H. and Monsuur, H. and Moon, C. and Murua, A. and Musliu, N. and Nakache, D. and Ni, J. and Nolle, L. and Ozalp, A.A. and Pang, W.-K. and Papadopoulos, A.N. and Piramuthu, S. and Premachandra, I.M. and Seng, Q.T. and Sharma, D. and Sheu, J.-B. and Sheu, S.-H. and Resteanu, C.I.G. and Romero, C. and Saito, S. and Sawik, T. and Seva, R.R. and Shakshuki, E. and Singh, V. and Siskos, Y. and Stoyan, Y.G. and Sun, J. and Sun, Z. and Rad, A.B. and Resta, M. and Rodriguez, M.L. and Rojas, R. and Tiwari, M.K. and Tran, D. and Triguero, F.H. and Tseng, L.-Y. and Tsuda, S. and Tzeng, G.-H. and Utkin, L.V. and Vaz, I. and Luis, J.V. and Wang, H.-F. and Wang, L. and Wang, S.-H. and Watanabe, T. and Werner, F. and Wojnicki, I. and Wu, E.X. and Wu, T. and Xie, G. and Xu, L. and Xu, S.H. and Yang, G.-C. and Yang, X.-S. and Yu, K.-M. and Zanni, C. and Zhang, X. and Zhang, Z.G. and Zhao, Y. and Zhao, Y. and Zopounidis, C., (2011). "IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011: Preface", IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011, vol. 2
• Public

  Parallel machine problems with equal processing times: a survey: Journal of Scheduling 2011

  DOI: 10.1007/s10951-011-0231-3
  Kravchenko, Svetlana A. and Werner, Frank, (2011). "Parallel machine problems with equal processing times: a survey", Journal of Scheduling, vol. 14, no. 5, pp. 435-444
• Public

  Single machine scheduling problems with financial resource constraints: Some complexity results and properties: Mathematical Social Sciences 2011

  DOI: 10.1016/j.mathsocsci.2011.04.004
  Gafarov, Evgeny R. and Lazarev, Alexander A. and Werner, Frank, (2011). "Single machine scheduling problems with financial resource constraints: Some complexity results and properties", Mathematical Social Sciences, vol. 62, no. 1, pp. 7-13
• Public

  The complexity of dissociation set problems in graphs: Discrete Applied Mathematics 2011

  DOI: 10.1016/j.dam.2011.04.023
  Orlovich, Yury and Dolgui, Alexandre and Finke, Gerd and Gordon, Valery and Werner, Frank, (2011). "The complexity of dissociation set problems in graphs", Discrete Applied Mathematics, vol. 159, no. 13, pp. 1352-1366
• Public

  The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times: Optimization 2011

  DOI: 10.1080/02331931003657691
  Matsveichuk, N. M. and Sotskov, Y. N. and Werner, F., (2011). "The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times", Optimization, vol. 60, no. 12, pp. 1493-1517
• Public

  The stability box in interval data for minimizing the sum of weighted completion times: SIMULTECH 2011 - Proceedings of 1st International Conference on Simulation and Modeling Methodologies, Technologies and Applications 2011

  http://www.scopus.com/inward/record.url?eid=2-s2.0-80052563364&partnerID=MN8TOARS
  Sotskov, Y.N. and Egorova, N.G. and Lai, T.-C. and Werner, F., (2011). "The stability box in interval data for minimizing the sum of weighted completion times", SIMULTECH 2011 - Proceedings of 1st International Conference on Simulation and Modeling Methodologies, Technologies and Applications, pp. 14-23
• Public

  Algorithms for Some Maximization Scheduling Problems on a Single Machine: Automation and Remote Control 2010

  DOI: 10.1134/S0005117910100061
  Gafarov, E. R. and Lazarev, A. A. and Werner, F., (2010). "Algorithms for Some Maximization Scheduling Problems on a Single Machine", Automation and Remote Control, vol. 71, no. 10, pp. 2070-2084
• Public

  Batching for work and rework processes on dedicated facilities to minimize the makespan: Omega-International Journal of Management Science 2010

  DOI: 10.1016/j.omega.2010.01.002
  Gribkovskaia, Irina V. and Kovaley, Sergey and Werner, Frank, (2010). "Batching for work and rework processes on dedicated facilities to minimize the makespan", Omega-International Journal of Management Science, vol. 38, no. 6, pp. 522-527
• Public

  Foreword to the Thematical Issue Devoted to the Seventieth Anniversary of Academician V.S. Tanaev: Automation and Remote Control 2010

  DOI: 10.1134/S0005117910100012
  Werner, F. and Lazarev, A., (2010). "Foreword to the Thematical Issue Devoted to the Seventieth Anniversary of Academician V.S. Tanaev", Automation and Remote Control, vol. 71, no. 10, pp. 2019-2020
• Public

  Minimizing Total Weighted Completion Time with Uncertain Data: A Stability Approach: Automation and Remote Control 2010

  DOI: 10.1134/S0005117910100048
  Sotskov, Yu. N. and Egorova, N. G. and Werner, F., (2010). "Minimizing Total Weighted Completion Time with Uncertain Data: A Stability Approach", Automation and Remote Control, vol. 71, no. 10, pp. 2038-2057
• Public

  Scheduling with Multiple Servers: Automation and Remote Control 2010

  DOI: 10.1134/S0005117910100103
  Werner, F. and Kravchenko, S. A., (2010). "Scheduling with Multiple Servers", Automation and Remote Control, vol. 71, no. 10, pp. 2109-2121
• Public

  A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria: Computers & Operations Research 2009

  DOI: 10.1016/j.cor.2007.10.004
  Jungwattanakit, Jitti and Reodecha, Manop and Chaovalitwongse, Paveena and Werner, Frank, (2009). "A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria", Computers & Operations Research, vol. 36, no. 2, pp. 358-378
• Public

  A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems: Computers & Mathematics With Applications 2009

  DOI: 10.1016/j.camwa.2009.06.008
  Lazarev, Alexander A. and Werner, Frank, (2009). "A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems", Computers & Mathematics With Applications, vol. 58, no. 4, pp. 619-631
• Public

  Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem: Mathematical and Computer Modelling 2009

  DOI: 10.1016/j.mcm.2009.01.003
  Lazarev, Alexander A. and Werner, Frank, (2009). "Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem", Mathematical and Computer Modelling, vol. 49, no. 9-10, pp. 2061-2072
• Public

  Editorial: Computers and Operations Research 2009

  DOI: 10.1016/j.cor.2007.10.009
  http://www.scopus.com/inward/record.url?eid=2-s2.0-52149095392&partnerID=MN8TOARS
  Finke, G. and Strusevich, V.A. and Werner, F., (2009). "Editorial", Computers and Operations Research, vol. 36, no. 2, pp. 299-300
• Public

  Hierarchical scheduling of mobile robots in production-transportation supply chains: IFAC Proceedings Volumes (IFAC-PapersOnline) 2009

  DOI: 10.3182/20090603-3-RU-2001.0214
  http://www.scopus.com/inward/record.url?eid=2-s2.0-79960909295&partnerID=MN8TOARS
  Levner, E. and Meyzin, L. and Werner, F., (2009). "Hierarchical scheduling of mobile robots in production-transportation supply chains", IFAC Proceedings Volumes (IFAC-PapersOnline), vol. 13, no. PART 1, pp. 786-791
• Public

  Minimizing the number of machines for scheduling jobs with equal processing times: European Journal of Operational Research 2009

  DOI: 10.1016/j.ejor.2008.10.008
  Kravchenko, Svetlana A. and Werner, Frank, (2009). "Minimizing the number of machines for scheduling jobs with equal processing times", European Journal of Operational Research, vol. 199, no. 2, pp. 595-600
• Public

  On a parallel machine scheduling problem with equal processing times: Discrete Applied Mathematics 2009

  DOI: 10.1016/j.dam.2008.09.003
  Kravchenko, Svedana A. and Werner, Frank, (2009). "On a parallel machine scheduling problem with equal processing times", Discrete Applied Mathematics, vol. 157, no. 4, pp. 848-852
• Public

  On the complexity of dissociation set problems in graphs: IFAC Proceedings Volumes (IFAC-PapersOnline) 2009

  DOI: 10.3182/20090603-3-RU-2001.0071
  http://www.scopus.com/inward/record.url?eid=2-s2.0-79960914461&partnerID=MN8TOARS
  Orlovich, Y. and Dolgui, A. and Finke, G. and Gordon, V. and Werner, F., (2009). "On the complexity of dissociation set problems in graphs", IFAC Proceedings Volumes (IFAC-PapersOnline), vol. 13, no. PART 1, pp. 1032-1036
• Public

  Partial job order for solving the two-machine flow-shop minimum-length problem with uncertain processing times: IFAC Proceedings Volumes (IFAC-PapersOnline) 2009

  DOI: 10.3182/20090603-3-RU-2001.0094
  http://www.scopus.com/inward/record.url?eid=2-s2.0-79960911916&partnerID=MN8TOARS
  Matsveichuk, N.M. and Sotskov, Y.N. and Werner, F., (2009). "Partial job order for solving the two-machine flow-shop minimum-length problem with uncertain processing times", IFAC Proceedings Volumes (IFAC-PapersOnline), vol. 13, no. PART 1, pp. 1517-1522
• Public

  Preemptive scheduling on uniform machines to minimize mean flow time: Computers & Operations Research 2009

  DOI: 10.1016/j.cor.2008.12.010
  Kravchenko, Svetlana A. and Werner, Frank, (2009). "Preemptive scheduling on uniform machines to minimize mean flow time", Computers & Operations Research, vol. 36, no. 10, pp. 2816-2821
• Public

  Scheduling for Modern Manufacturing, Logistics, and Supply Chains: Computers & Operations Research 2009

  DOI: 10.1016/j.cor.2007.10.009
  Finke, Gerd and Strusevich, Vitaly A. and Werner, Frank, (2009). "Scheduling for Modern Manufacturing, Logistics, and Supply Chains", Computers & Operations Research, vol. 36, no. 2, pp. 299-300
• Public

  Scheduling jobs with equal processing times: IFAC Proceedings Volumes (IFAC-PapersOnline) 2009

  DOI: 10.3182/20090603-3-RU-2001.0042
  http://www.scopus.com/inward/record.url?eid=2-s2.0-79960910310&partnerID=MN8TOARS
  Kravchenko, S.A. and Werner, F., (2009). "Scheduling jobs with equal processing times", IFAC Proceedings Volumes (IFAC-PapersOnline), vol. 13, no. PART 1, pp. 1262-1267
• Public

  Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria: International Journal of Advanced Manufacturing Technology 2008

  DOI: 10.1007/s00170-007-0977-0
  Jungwattanakit, Jitti and Reodecha, Manop and Chaovalitwongse, Paveena and Werner, Frank, (2008). "Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria", International Journal of Advanced Manufacturing Technology, vol. 37, no. 3-4, pp. 354-370
• Public

  Hamiltonian properties of triangular grid graphs: Discrete Mathematics 2008

  DOI: 10.1016/j.disc.2007.11.040
  Gordon, Valery S. and Orlovich, Yury L. and Werner, Frank, (2008). "Hamiltonian properties of triangular grid graphs", Discrete Mathematics, vol. 308, no. 24, pp. 6166-6188
• Public

  Heuristic constructive algorithms for open shop scheduling to minimize mean flow time: European Journal of Operational Research 2008

  DOI: 10.1016/j.ejor.2007.02.057
  Braesel, Heidemarie and Herms, Andre and Moerig, Marc and Tautenhahn, Thomas and Tusch, Jan and Werner, Frank, (2008). "Heuristic constructive algorithms for open shop scheduling to minimize mean flow time", European Journal of Operational Research, vol. 189, no. 3, pp. 856-870
• Public

  Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date: Computers & Operations Research 2008

  DOI: 10.1016/j.cor.2006.03.021
  Blazewicz, Jacek and Pesch, Erwin and Sterna, Malgorzata and Werner, Frank, (2008). "Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date", Computers & Operations Research, vol. 35, no. 2, pp. 574-599
• Public

  Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop: Mathematical and Computer Modelling 2008

  DOI: 10.1016/j.mcm.2008.01.002
  Andresen, Michael and Braesel, Heidemarie and Moerig, Marc and Tusch, Jan and Werner, Frank and Willenius, Per, (2008). "Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop", Mathematical and Computer Modelling, vol. 48, no. 7-8, pp. 1279-1293
• Public

  A note on the two machine job shop with the weighted late work criterion: Journal of Scheduling 2007

  DOI: 10.1007/s10951-006-0005-5
  Blazewicz, Jacek and Pesch, Erwin and Sterna, Malgorzata and Werner, Frank, (2007). "A note on the two machine job shop with the weighted late work criterion", Journal of Scheduling, vol. 10, no. 2, pp. 87-95
• Public

  Complexity of shop-scheduling problems with fixed number of jobs: a survey: Mathematical Methods of Operations Research 2007

  DOI: 10.1007/s00186-006-0127-8
  Brucker, Peter and Sotskov, Yu N. and Werner, Frank, (2007). "Complexity of shop-scheduling problems with fixed number of jobs: a survey", Mathematical Methods of Operations Research, vol. 65, no. 3, pp. 461-481
• Public

  Cost minimizing scheduling of work and rework processes on a single facility under deterioration of reworkables: International Journal of Production Economics 2007

  DOI: 10.1016/j.ijpe.2004.02.010
  Inderfurth, Karl and Kovalyov, Mikhail Y. and Ng, C. T. and Werner, Frank, (2007). "Cost minimizing scheduling of work and rework processes on a single facility under deterioration of reworkables", International Journal of Production Economics, vol. 105, no. 2, pp. 345-356
• Public

  Problem F2 parallel to C-max with forbidden jobs in the first or last position is easy: European Journal of Operational Research 2007

  DOI: 10.1016/j.ejor.2006.01.018
  Kovalyov, Mikhail Y. and Werner, Frank, (2007). "Problem F2 parallel to C-max with forbidden jobs in the first or last position is easy", European Journal of Operational Research, vol. 177, no. 2, pp. 1310-1311
• Public

  A comparison of heuristics for mean flow time open shop scheduling: IFAC Proceedings Volumes (IFAC-PapersOnline) 2006

  http://www.scopus.com/inward/record.url?eid=2-s2.0-79961177304&partnerID=MN8TOARS
  Bräsel, H. and Herms, A. and Mörig, M. and Tautenhahn, T. and Tusch, J. and Werner, F. and Willenius, P., (2006). "A comparison of heuristics for mean flow time open shop scheduling", IFAC Proceedings Volumes (IFAC-PapersOnline), vol. 12, no. PART 1
• Public

  Batching work and rework processes with limited deterioration of reworkables: Computers & Operations Research 2006

  DOI: 10.1016/j.cor.2004.11.009
  Inderfurth, K and Janiak, A and Kovalyov, MY and Werner, F, (2006). "Batching work and rework processes with limited deterioration of reworkables", Computers & Operations Research, vol. 33, no. 6, pp. 1595-1605
• Public

  Cyclic properties of triangular grid graphs: IFAC Proceedings Volumes (IFAC-PapersOnline) 2006

  http://www.scopus.com/inward/record.url?eid=2-s2.0-79961198736&partnerID=MN8TOARS
  Orlovich, Y. and Gordon, V. and Werner, F., (2006). "Cyclic properties of triangular grid graphs", IFAC Proceedings Volumes (IFAC-PapersOnline), vol. 12, no. PART 1
• Public

  Sequence-dependent setup and clean-up times in a two-machine job-shop with minimizing makespan: IFAC Proceedings Volumes (IFAC-PapersOnline) 2006

  http://www.scopus.com/inward/record.url?eid=2-s2.0-79961190616&partnerID=MN8TOARS
  Sotskov, Y.N. and Werner, F., (2006). "Sequence-dependent setup and clean-up times in a two-machine job-shop with minimizing makespan", IFAC Proceedings Volumes (IFAC-PapersOnline), vol. 12, no. PART 1
• Public

  A comparison of solution procedures for two-machine flow shop scheduling with late work criterion: Computers & Industrial Engineering 2005

  DOI: 10.1016/j.cie.2005.09.001
  Blazewicz, J and Pesch, E and Sterna, M and Werner, F, (2005). "A comparison of solution procedures for two-machine flow shop scheduling with late work criterion", Computers & Industrial Engineering, vol. 49, no. 4, pp. 611-624
• Public

  Metaheuristics for late work minimization in two-machine flow shop with common due date: Ki2005: Advances in Artificial Intelligence, Proceedings 2005

  Blazewicz, J and Pesch, E and Sterna, M and Werner, F and Furbach, U, (2005). "Metaheuristics for late work minimization in two-machine flow shop with common due date", vol. 3698, pp. 222-234
• Public

  Positive half-products and scheduling with controllable processing times: European Journal of Operational Research 2005

  DOI: 10.1016/j.ejor.2004.04.012
  Janiak, A and Kovalyov, MY and Kubiak, W and Werner, F, (2005). "Positive half-products and scheduling with controllable processing times", European Journal of Operational Research, vol. 165, no. 2, pp. 416-422
• Public

  The two-machine flow-shop problem with weighted late work criterion and common due date: European Journal of Operational Research 2005

  DOI: 10.1016/j.ejor.2004.04.011
  Blazewicz, J and Pesch, E and Sterna, M and Werner, F, (2005). "The two-machine flow-shop problem with weighted late work criterion and common due date", European Journal of Operational Research, vol. 165, no. 2, pp. 408-415
• Public

  Flow shop scheduling with late work criterion - Choosing the best solution strategy: Applied Computing, Proceedings 2004

  Blazewicz, J and Pesch, E and Sterna, M and Werner, F and Manandhar, S and Austin, J and Desai, U and Oyanagi, Y and Talukder, A, (2004). "Flow shop scheduling with late work criterion - Choosing the best solution strategy", vol. 3285, pp. 68-75
• Public

  Heuristics for two-machine flow shop problems with earliness and tardiness penalties: International Journal of Operations and Quantitative Management 2004

  http://www.scopus.com/inward/record.url?eid=2-s2.0-84871491615&partnerID=MN8TOARS
  Lauff, V. and Werner, F., (2004). "Heuristics for two-machine flow shop problems with earliness and tardiness penalties", International Journal of Operations and Quantitative Management, vol. 10, no. 2, pp. 125-144
• Public

  Mean flow time minimization with given bounds of processing times: European Journal of Operational Research 2004

  DOI: 10.1016/S0377-2217(03)00424-7
  Lai, TC and Sotskov, YN and Sotskova, N and Werner, F, (2004). "Mean flow time minimization with given bounds of processing times", European Journal of Operational Research, vol. 159, no. 3, pp. 558-573
• Public

  On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties: Computers & Operations Research 2004

  DOI: 10.1016/S0305-0548(02)00194-6
  Lauff, V and Werner, F, (2004). "On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties", Computers & Operations Research, vol. 31, no. 3, pp. 317-345
• Public

  Open shop scheduling problems with late work criteria: Discrete Applied Mathematics 2004

  DOI: 10.1016/S0166-218X(03)00339-1
  Blazewicz, J and Pesch, E and Sterna, M and Werner, F, (2004). "Open shop scheduling problems with late work criteria", Discrete Applied Mathematics, vol. 134, no. 1-3, pp. 1-24
• Public

  Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey: Mathematical and Computer Modelling 2004

  DOI: 10.1016/j.mcm.2003.05.019
  Lauff, V and Werner, F, (2004). "Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey", Mathematical and Computer Modelling, vol. 40, no. 5-6, pp. 637-655
• Public

  Two-machine flow shop scheduling with nonregular criteria: Journal of Mathematical Modelling and Algorithms 2004

  DOI: 10.1023/B:JMMA.0000036573.01968.1b
  http://www.scopus.com/inward/record.url?eid=2-s2.0-18844440456&partnerID=MN8TOARS
  Gupta, J.N.D. and Lauff, V. and Werner, F., (2004). "Two-machine flow shop scheduling with nonregular criteria", Journal of Mathematical Modelling and Algorithms, vol. 3, no. 2, pp. 123-151
• Public

  Approximation schemes for scheduling jobs with common due date on parallel machines to minimize total tardiness: Journal of Heuristics 2002

  DOI: 10.1023/A:1015487829051
  Kovalyov, MY and Werner, F, (2002). "Approximation schemes for scheduling jobs with common due date on parallel machines to minimize total tardiness", Journal of Heuristics, vol. 8, no. 4, pp. 415-428
• Public

  Complexity results for parallel machine problems with a single server: Journal of Scheduling 2002

  DOI: 10.1002/jos.120
  Brucker, P and Dhaenens-Flipo, C and Knust, S and Kravchenko, SA and Werner, F, (2002). "Complexity results for parallel machine problems with a single server", Journal of Scheduling, vol. 5, no. 6, pp. 429-457
• Public

  Heuristics for hybrid flow shops with controllable processing times and assignable due dates: Computers & Operations Research 2002

  DOI: 10.1016/S0305-0548(01)00040-5
  Gupta, JND and Kruger, K and Lauff, V and Werner, F and Sotskov, YN, (2002). "Heuristics for hybrid flow shops with controllable processing times and assignable due dates", Computers & Operations Research, vol. 29, no. 10, pp. 1417-1439
• Public

  Local search heuristics for two-stage flow shop problems with secondary criterion: Computers & Operations Research 2002

  DOI: 10.1016/S0305-0548(00)00061-7
  Gupta, JND and Hennig, K and Werner, F, (2002). "Local search heuristics for two-stage flow shop problems with secondary criterion", Computers & Operations Research, vol. 29, no. 2, pp. 123-149
• Public

  Scheduling problems and mixed graph colorings: Optimization 2002

  DOI: 10.1080/0233193021000004994
  Sotskov, YN and Tanaev, VS and Werner, F, (2002). "Scheduling problems and mixed graph colorings", Optimization, vol. 51, no. 3, pp. 597-624
• Public

  A heuristic algorithm for minimizing mean flow time with unit setups: Information Processing Letters 2001

  DOI: 10.1016/S0020-0190(01)00136-3
  Kravchenko, SA and Werner, F, (2001). "A heuristic algorithm for minimizing mean flow time with unit setups", Information Processing Letters, vol. 79, no. 6, pp. 291-296
• Public

  Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties: Mathematical and Computer Modelling 2001

  DOI: 10.1016/S0895-7177(00)00250-8
  Bank, J and Werner, F, (2001). "Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties", Mathematical and Computer Modelling, vol. 33, no. 4-5, pp. 363-383
• Public

  Minimizing total flow time in a two-machine flowshop problem with minimum makespan: International Journal of Production Economics 2001

  DOI: 10.1016/S0925-5273(00)00039-6
  Gupta, JND and Neppalli, VR and Werner, F, (2001). "Minimizing total flow time in a two-machine flowshop problem with minimum makespan", International Journal of Production Economics, vol. 69, no. 3, pp. 323-338
• Public

  Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals: Rairo-Recherche Operationnelle-Operations Research 2001

  DOI: 10.1051/ro:2001103
  Gordon, VS and Werner, F and Yanushkevich, OA, (2001). "Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals", Rairo-Recherche Operationnelle-Operations Research, vol. 35, no. 1, pp. 71-83
• Public

  Complexity of mixed shop scheduling problems: A survey: European Journal of Operational Research 2000

  DOI: 10.1016/S0377-2217(99)00161-7
  Shakhlevich, NV and Sotskov, YN and Werner, F, (2000). "Complexity of mixed shop scheduling problems: A survey", European Journal of Operational Research, vol. 120, no. 2, pp. 343-351
• Public

  The problem of minimizing weighted number of late jobs to meet strict deadlines and due processing times: Doklady Akademii Nauk Belarusi 2000

  Gordon, VS and Werner, F and Yanushkevich, OA, (2000). "The problem of minimizing weighted number of late jobs to meet strict deadlines and due processing times", Doklady Akademii Nauk Belarusi, vol. 44, no. 1, pp. 39-42
• Public

  A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size: Mathematical and Computer Modelling 1999

  DOI: 10.1016/S0895-7177(99)00085-0
  Danneberg, D and Tautenhahn, T and Werner, F, (1999). "A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size", Mathematical and Computer Modelling, vol. 29, no. 9, pp. 101-126
• Public

  On the application of insertion techniques for job shop problems with setup times: Rairo-Recherche Operationnelle-Operations Research 1999

  DOI: 10.1051/ro:1999110
  Sotskov, YN and Tautenhahn, T and Werner, F, (1999). "On the application of insertion techniques for job shop problems with setup times", Rairo-Recherche Operationnelle-Operations Research, vol. 33, no. 2, pp. 209-245
• Public

  Shop-scheduling problems with fixed and non-fixed machine orders of the jobs: Annals of Operations Research 1999

  DOI: 10.1023/A:1018943016617
  Shakhlevich, NV and Sotskov, YN and Werner, F, (1999). "Shop-scheduling problems with fixed and non-fixed machine orders of the jobs", Annals of Operations Research, vol. 92, pp. 281-304
• Public

  Batch scheduling with deadlines on parallel machines: Annals of Operations Research 1998

  DOI: 10.1023/A:1018912114491
  Brucker, P and Kovalyov, MY and Shafransky, YM and Werner, F, (1998). "Batch scheduling with deadlines on parallel machines", Annals of Operations Research, vol. 83, pp. 23-40
• Public

  Heuristics for generalized shop scheduling problems based on decomposition: International Journal of Production Research 1998

  DOI: 10.1080/002075498192265
  Kruger, K and Sotskov, YN and Werner, F, (1998). "Heuristics for generalized shop scheduling problems based on decomposition", International Journal of Production Research, vol. 36, no. 11, pp. 3013-3033
• Public

  On the calculation of the stability radius of an optimal or an approximate schedule: Annals of Operations Research 1998

  DOI: 10.1023/A:1018960030420
  Sotskov, YN and Wagelmans, APM and Werner, F, (1998). "On the calculation of the stability radius of an optimal or an approximate schedule", Annals of Operations Research, vol. 83, pp. 213-252
• Public

  Second Workshop on Models and Algorithms for Planning and Scheduling Problems - Preface: Annals of Operations Research 1998

  Brasel, H and Werner, F, (1998). "Second Workshop on Models and Algorithms for Planning and Scheduling Problems - Preface", Annals of Operations Research, vol. 83, pp. U11
• Public

  A polynomial approximation scheme for problem F2/r(j)/C-max: Operations Research Letters 1997

  DOI: 10.1016/S0167-6377(96)00049-1
  Kovalyov, MY and Werner, F, (1997). "A polynomial approximation scheme for problem F2/r(j)/C-max", Operations Research Letters, vol. 20, no. 2, pp. 75-79
• Public

  Improving local search heuristics for some scheduling problems .2.: Discrete Applied Mathematics 1997

  DOI: 10.1016/S0166-218X(96)00036-4
  Brucker, P and Hurink, J and Werner, F, (1997). "Improving local search heuristics for some scheduling problems .2.", Discrete Applied Mathematics, vol. 72, no. 1-2, pp. 47-69
• Public

  Optimal makespan scheduling with given bounds of processing times: Mathematical and Computer Modelling 1997

  Lai, TC and Sotskov, YN and Sotskova, NY and Werner, F, (1997). "Optimal makespan scheduling with given bounds of processing times", Mathematical and Computer Modelling, vol. 26, no. 3, pp. 67-86
• Public

  Parallel machine scheduling problems with a single server: Mathematical and Computer Modelling 1997

  DOI: 10.1016/S0895-7177(97)00236-7
  Kravchenko, SA and Werner, F, (1997). "Parallel machine scheduling problems with a single server", Mathematical and Computer Modelling, vol. 26, no. 12, pp. 1-11
• Public

  Single machine scheduling with deadlines, release and due dates: Optimization 1997

  http://www.scopus.com/inward/record.url?eid=2-s2.0-0040747866&partnerID=MN8TOARS
  Gordon, V. and Potapneva, E. and Werner, F., (1997). "Single machine scheduling with deadlines, release and due dates", Optimization, vol. 42, no. 3, pp. 219-244
• Public

  Stability of an optimal schedule in a job shop: Omega-International Journal of Management Science 1997

  DOI: 10.1016/S0305-0483(97)00012-1
  Sotskov, Y and Sotskova, NY and Werner, F, (1997). "Stability of an optimal schedule in a job shop", Omega-International Journal of Management Science, vol. 25, no. 4, pp. 397-414
• Public

  Adaptive scheduling algorithm based on mixed graph model: Iee Proceedings-Control Theory and Applications 1996

  DOI: 10.1049/ip-cta:19960089
  Shakhlevich, NV and Sotskov, YN and Werner, F, (1996). "Adaptive scheduling algorithm based on mixed graph model", Iee Proceedings-Control Theory and Applications, vol. 143, no. 1, pp. 9-16
• Public

  Heuristics for permutation flow shop scheduling with batch setup times: Or Spektrum 1996

  Sotskov, YN and Tautenhahn, T and Werner, F, (1996). "Heuristics for permutation flow shop scheduling with batch setup times", Or Spektrum, vol. 18, no. 2, pp. 67-80
• Public

  Improving local search heuristics for some scheduling problems .1.: Discrete Applied Mathematics 1996

  DOI: 10.1016/0166-218X(95)00030-U
  Brucker, P and Hurink, J and Werner, F, (1996). "Improving local search heuristics for some scheduling problems .1.", Discrete Applied Mathematics, vol. 65, no. 1-3, pp. 97-122
• Public

  Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times: Rairo-Recherche Operationnelle-Operations Research 1996

  Brasel, H and Kluge, D and Werner, F, (1996). "Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times", Rairo-Recherche Operationnelle-Operations Research, vol. 30, no. 1, pp. 65-79
• Public

  Single machine scheduling with deadlines, release and due dates: IEEE Symposium on Emerging Technologies & Factory Automation, ETFA 1996

  http://www.scopus.com/inward/record.url?eid=2-s2.0-0030412278&partnerID=MN8TOARS
  Gordon, Valery and Potapneva, Elena and Werner, Frank, (1996). "Single machine scheduling with deadlines, release and due dates", IEEE Symposium on Emerging Technologies \& Factory Automation, ETFA, vol. 1, pp. 22-26
• Public

  Stability of a schedule minimising mean flow time: Mathematical and Computer Modelling 1996

  DOI: 10.1016/S0895-7177(96)00163-X
  Brasel, H and Sotskov, YN and Werner, F, (1996). "Stability of a schedule minimising mean flow time", Mathematical and Computer Modelling, vol. 24, no. 10, pp. 39-53
• Public

  A HEURISTIC DECOMPOSITION ALGORITHM FOR SCHEDULING PROBLEMS ON MIXED GRAPHS: Journal of the Operational Research Society 1995

  DOI: 10.2307/2584067
  KRUGER, K and SHAKHLEVICH, NV and SOTSKOV, YN and WERNER, F, (1995). "A HEURISTIC DECOMPOSITION ALGORITHM FOR SCHEDULING PROBLEMS ON MIXED GRAPHS", Journal of the Operational Research Society, vol. 46, no. 12, pp. 1481-1497
• Public

  A POLYNOMIAL ALGORITHM FOR AN OPEN SHOP PROBLEM WITH UNIT PROCESSING TIMES AND TREE CONSTRAINTS: Discrete Applied Mathematics 1995

  DOI: 10.1016/0166-218X(93)E0156-S
  BRASEL, H and KLUGE, D and WERNER, F, (1995). "A POLYNOMIAL ALGORITHM FOR AN OPEN SHOP PROBLEM WITH UNIT PROCESSING TIMES AND TREE CONSTRAINTS", Discrete Applied Mathematics, vol. 59, no. 1, pp. 11-21
• Public

  INSERTION TECHNIQUES FOR THE HEURISTIC SOLUTION OF THE JOB-SHOP PROBLEM: Discrete Applied Mathematics 1995

  DOI: 10.1016/0166-218X(93)E0127-K
  WERNER, F and WINKLER, A, (1995). "INSERTION TECHNIQUES FOR THE HEURISTIC SOLUTION OF THE JOB-SHOP PROBLEM", Discrete Applied Mathematics, vol. 58, no. 2, pp. 191-211
• Public

  Parallel scheduling algorithm to minimize maximal cost: IEEE Symposium on Emerging Technologies & Factory Automation 1995

  http://www.scopus.com/inward/record.url?eid=2-s2.0-0029517129&partnerID=MN8TOARS
  Gordon, Valery and Werner, Frank, (1995). "Parallel scheduling algorithm to minimize maximal cost", IEEE Symposium on Emerging Technologies \& Factory Automation, vol. 1, pp. 659-665
• Public

  A POLYNOMIAL ALGORITHM FOR THE [N/M/O, T(IJ) = 1, TREE/CMAX] OPEN SHOP PROBLEM: European Journal of Operational Research 1994

  DOI: 10.1016/0377-2217(94)90335-2
  BRASEL, H and KLUGE, D and WERNER, F, (1994). "A POLYNOMIAL ALGORITHM FOR THE [N/M/O, T(IJ) = 1, TREE/CMAX] OPEN SHOP PROBLEM", European Journal of Operational Research, vol. 72, no. 1, pp. 125-134
• Public

  Constructive heuristic algorithms for the open shop problem: Computing 1993

  DOI: 10.1007/BF02243845
  http://www.scopus.com/inward/record.url?eid=2-s2.0-0003044398&partnerID=MN8TOARS
  Bräsel, H. and Tautenhahn, T. and Werner, F., (1993). "Constructive heuristic algorithms for the open shop problem", Computing, vol. 51, no. 2, pp. 95-110
• Public

  On the heuristic solution of the permutation flow shop problem by path algorithms: Computers and Operations Research 1993

  http://www.scopus.com/inward/record.url?eid=2-s2.0-0027657157&partnerID=MN8TOARS
  Werner, F., (1993). "On the heuristic solution of the permutation flow shop problem by path algorithms", Computers and Operations Research, vol. 20, no. 7, pp. 707-722
• Public

  Scheduling unit time open shops to minimize the weighted number of late jobs: Operations Research Letters 1993

  http://www.scopus.com/inward/record.url?eid=2-s2.0-38248999492&partnerID=MN8TOARS
  Brucker, P. and Jurisch, B. and Tautenhahn, T. and Werner, F., (1993). "Scheduling unit time open shops to minimize the weighted number of late jobs", Operations Research Letters, vol. 14, no. 5, pp. 245-250
• Public

  On the combinatorial structure of the permutation flow shop problem: ZOR Zeitschrift fü Operations Research Methods and Models of Operations Research 1991

  DOI: 10.1007/BF01417515
  http://www.scopus.com/inward/record.url?eid=2-s2.0-34249924604&partnerID=MN8TOARS
  Werner, F., (1991). "On the combinatorial structure of the permutation flow shop problem", ZOR Zeitschrift fü Operations Research Methods and Models of Operations Research, vol. 35, no. 4, pp. 273-289

Grants

Patents