Gerd Finke

Publication Activity (10 Years)

Years Active: 1975-2017
Publications (10 Years): 3

Top Topics

Optimality Conditions

Vapnik Chervonenkis Dimension

Top Venues

J. Comb. Optim.

Eur. J. Oper. Res.

Publications

Nadia Brauner, Gerd Finke, Yakov M. Shafransky
Lawler's minmax cost problem under uncertainty. J. Comb. Optim. 34 (1) (2017)
Ahmed Gara-Ali, Gerd Finke, Marie-Laure Espinouse
Parallel-machine scheduling with maintenance: Praising the assignment problem. Eur. J. Oper. Res. 252 (1) (2016)
Nadia Brauner, Gerd Finke, Yakov M. Shafransky, Dzmitry Sledneu
Lawler's minmax cost algorithm: optimality conditions and uncertainty. J. Sched. 19 (4) (2016)
Vassilissa Lehoux-Lebacque, Nadia Brauner, Gerd Finke
Identical coupled task scheduling: polynomial complexity of the cyclic case. J. Sched. 18 (6) (2015)
Christophe Rapine, Nadia Brauner, Gerd Finke, Vassilissa Lebacque
Single machine scheduling with small operator-non-availability periods. J. Sched. 15 (2) (2012)
Susann Schrenk, Gerd Finke, Van-Dat Cung
Two classical transportation problems revisited: Pure constant fixed charges and the paradox. Math. Comput. Model. 54 (9-10) (2011)
Yury L. Orlovich, Jacek Blazewicz, Alexandre Dolgui, Gerd Finke, Valery S. Gordon
On the complexity of the independent set problem in triangle graphs. Discret. Math. 311 (16) (2011)
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) (2011)
Susann Schrenk, Teodor Gabriel Crainic, Van-Dat Cung, Gerd Finke
Comparaison de différentes formulations de conception de réseaux pour un problème de transport de fret avec gestion de véhicules. Stud. Inform. Univ. 8 (2) (2010)
Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Chris N. Potts, Jonathan Whitehead
Scheduling of coupled tasks and one-machine no-wait robotic cells. Comput. Oper. Res. 36 (2) (2009)
Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Christophe Rapine, Hans Kellerer, Chris N. Potts, Vitaly A. Strusevich
Operator non-availability periods. 4OR 7 (3) (2009)
Gerd Finke, Pierre Lemaire, Jean-Marie Proth, Maurice Queyranne
Minimizing the number of machines for minimum length schedules. Eur. J. Oper. Res. 199 (3) (2009)
Gerd Finke, Vitaly A. Strusevich, Frank Werner
Guest Editorial. Comput. Oper. Res. 36 (2) (2009)
Ammar Oulamara, Gerd Finke, A. Kamgaing Kuiteing
Flowshop scheduling problem with a batching machine and task compatibilities. Comput. Oper. Res. 36 (2) (2009)
Christian Artigues, Van-Dat Cung, Gerd Finke, Bernard Penz
Articles ROADEF 2007. RAIRO Oper. Res. 43 (4) (2009)
Yury L. Orlovich, Gerd Finke, Valery S. Gordon, Igor E. Zverovich
Approximability results for the maximum and minimum maximal induced matching problems. Discret. Optim. 5 (3) (2008)
Gerd Finke, Vincent Jost, Maurice Queyranne, András Sebö
Batch processing with interval graph compatibilities between tasks. Discret. Appl. Math. 156 (5) (2008)
Gerd Finke, Ammar Oulamara
Total Completion Time in a Two-machine Flowshop with Deteriorating Tasks. J. Math. Model. Algorithms 6 (4) (2007)
Vitali M. Demidenko, Gerd Finke, Valery S. Gordon
Well Solvable Cases of the Quadratic Assignment Problem with Monotone and Bimonotone Matrices. J. Math. Model. Algorithms 5 (2) (2006)
Pierre Lemaire, Gerd Finke, Nadia Brauner
Models and Complexity of Multibin Packing Problems. J. Math. Model. Algorithms 5 (3) (2006)
Nadia Brauner, Rachid Echahed, Gerd Finke, Hanns Gregor, Frédéric Prost
Specializing Narrowing for Timetable Generation: A Case Study. PADL (2005)
Nadia Brauner, Gerd Finke
Robotic Cells: Configurations, Conjectures and Cycle Functions. OR (2005)
Adel Jedidi, Alexandre Caminada, Gerd Finke
2-Objective Optimization of Cells Overlap and Geometry with Evolutionary Algorithms. EvoWorkshops (2004)
Nadia Brauner, Yves Crama, Gerd Finke, Pierre Lemaire, Christelle Wynants
Approximation algorithms for the design of SDH/SONET networks. RAIRO Oper. Res. 37 (4) (2003)
Nadia Brauner, Gerd Finke, Wieslaw Kubiak
Complexity of One-Cycle Robotic Flow-Shops. J. Sched. 6 (4) (2003)
Valery S. Gordon, Jean-Marie Proth, Gerd Finke, Chengbin Chu
Scheduling with common due date assignment. ETFA (1) (2001)
Caroline Privault, Gerd Finke
k-server problems with bulk requests: an application to tool switching in manufacturing. Ann. Oper. Res. 96 (1-4) (2000)
Moshe Dror, Gerd Finke, Sylvain Gravier, Wieslaw Kubiak
On the complexity of a restricted list-coloring problem. Discret. Math. 195 (1-3) (1999)
Gerd Finke, H. Jiang
A Variant of the Permutation Flow Shop Model with Variable Processing Times. Discret. Appl. Math. 76 (1-3) (1997)
Caroline Privault, Gerd Finke
Modelling a tool switching problem on a single NC-machine. J. Intell. Manuf. 6 (2) (1995)
Gerd Finke
Planning and Scheduling. Information Management in Computer Integrated Manufacturing (1995)
Gerd Finke, Jacek Blazewicz
An integrated system for scheduling machines and vehicles in an FMS. ICRA (1991)
Andrew Kusiak, Gerd Finke
Selection of process plans in automated manufacturing systems. IEEE J. Robotics Autom. 4 (4) (1988)
Jacek Blazewicz, Gerd Finke
Minimizing Mean Weighted Execution Time Loss on Identical and Uniform Processors. Inf. Process. Lett. 24 (4) (1987)
Andrew Kusiak, Gerd Finke
Hierarchical approach to the process planning problem. Discret. Appl. Math. 18 (2) (1987)
Ruy Eduardo Campello, Gerd Finke
Preface. Discret. Appl. Math. 18 (2) (1987)
Andrew Kusiak, Gerd Finke
The process plan selection problem. ICRA (1986)
Joachim H. Ahrens, Gerd Finke
Degeneracy in fixed cost transportation problems. Math. Program. 8 (1) (1975)
Joachim H. Ahrens, Gerd Finke
Merging and Sorting Applied to the Zero-One Knapsack Problem. Oper. Res. 23 (6) (1975)