 | 2012 |
| 23 |  | Christophe Rapine,
Nadia Brauner,
Gerd Finke,
Vassilissa Lebacque:
Single machine scheduling with small operator-non-availability periods.
J. Scheduling 15(2): 127-139 (2012) |
| 2011 |
| 22 |  | Yury L. Orlovich,
Alexandre Dolgui,
Gerd Finke,
Valery S. Gordon,
Frank Werner:
The complexity of dissociation set problems in graphs.
Discrete Applied Mathematics 159(13): 1352-1366 (2011) |
| 21 |  | Yury L. Orlovich,
Jacek Blazewicz,
Alexandre Dolgui,
Gerd Finke,
Valery S. Gordon:
On the complexity of the independent set problem in triangle graphs.
Discrete Mathematics 311(16): 1670-1680 (2011) |
| 20 |  | Susann Schrenk,
Gerd Finke,
Van-Dat Cung:
Two classical transportation problems revisited: Pure constant fixed charges and the paradox.
Mathematical and Computer Modelling 54(9-10): 2306-2315 (2011) |
| 2010 |
| 19 |  | 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): 35-60 (2010) |
| 2009 |
| 18 |  | Nadia Brauner,
Gerd Finke,
Vassilissa Lehoux-Lebacque,
Christophe Rapine,
Hans Kellerer,
Chris N. Potts,
Vitaly A. Strusevich:
Operator non-availability periods.
4OR 7(3): 239-253 (2009) |
| 17 |  | Gerd Finke,
Vitaly A. Strusevich,
Frank Werner:
Guest Editorial.
Computers & OR 36(2): 299-300 (2009) |
| 16 |  | Nadia Brauner,
Gerd Finke,
Vassilissa Lehoux-Lebacque,
Chris N. Potts,
Jonathan Whitehead:
Scheduling of coupled tasks and one-machine no-wait robotic cells.
Computers & OR 36(2): 301-307 (2009) |
| 15 |  | Gerd Finke,
Pierre Lemaire,
Jean-Marie Proth,
Maurice Queyranne:
Minimizing the number of machines for minimum length schedules.
European Journal of Operational Research 199(3): 702-705 (2009) |
| 14 |  | Christian Artigues,
Van-Dat Cung,
Gerd Finke,
Bernard Penz:
Articles ROADEF 2007.
RAIRO - Operations Research 43(4): 373-374 (2009) |
| 2008 |
| 13 |  | Gerd Finke,
Vincent Jost,
Maurice Queyranne,
András Sebö:
Batch processing with interval graph compatibilities between tasks.
Discrete Applied Mathematics 156(5): 556-568 (2008) |
| 12 |  | Yury L. Orlovich,
Gerd Finke,
Valery S. Gordon,
Igor E. Zverovich:
Approximability results for the maximum and minimum maximal induced matching problems.
Discrete Optimization 5(3): 584-593 (2008) |
| 2006 |
| 11 |  | 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): 167-187 (2006) |
| 10 |  | Pierre Lemaire,
Gerd Finke,
Nadia Brauner:
Models and Complexity of Multibin Packing Problems.
J. Math. Model. Algorithms 5(3): 353-370 (2006) |
| 2005 |
| 9 |  | Nadia Brauner,
Gerd Finke:
Robotic Cells: Configurations, Conjectures and Cycle Functions.
OR 2005: 721-726 |
| 8 |  | Nadia Brauner,
Rachid Echahed,
Gerd Finke,
Hanns Gregor,
Frédéric Prost:
Specializing Narrowing for Timetable Generation: A Case Study.
PADL 2005: 22-36 |
| 2004 |
| 7 |  | Adel Jedidi,
Alexandre Caminada,
Gerd Finke:
2-Objective Optimization of Cells Overlap and Geometry with Evolutionary Algorithms.
EvoWorkshops 2004: 130-139 |
| 2003 |
| 6 |  | Nadia Brauner,
Gerd Finke,
Wieslaw Kubiak:
Complexity of One-Cycle Robotic Flow-Shops.
J. Scheduling 6(4): 355-372 (2003) |
| 5 |  | Nadia Brauner,
Yves Crama,
Gerd Finke,
Pierre Lemaire,
Christelle Wynants:
Approximation algorithms for the design of SDH/SONET networks.
RAIRO - Operations Research 37(4): 235-247 (2003) |
| 1999 |
| 4 |  | Moshe Dror,
Gerd Finke,
Sylvain Gravier,
Wieslaw Kubiak:
On the complexity of a restricted list-coloring problem.
Discrete Mathematics 195(1-3): 103-109 (1999) |
| 1997 |
| 3 |  | Gerd Finke,
H. Jiang:
A Variant of the Permutation Flow Shop Model with Variable Processing Times.
Discrete Applied Mathematics 76(1-3): 123-140 (1997) |
| 1995 |
| 2 |  | Gerd Finke:
Planning and Scheduling.
Information Management in Computer Integrated Manufacturing 1995: 165-178 |
| 1987 |
| 1 |  | Jacek Blazewicz,
Gerd Finke:
Minimizing Mean Weighted Execution Time Loss on Identical and Uniform Processors.
Inf. Process. Lett. 24(4): 259-263 (1987) |