Gerd Finke

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