default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGerd Finke
Person information
- affiliation: University Joseph Fourier, Grenoble, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j32]Nadia Brauner
, Gerd Finke, Yakov M. Shafransky:
Lawler's minmax cost problem under uncertainty. J. Comb. Optim. 34(1): 31-46 (2017)- 2016
- [j31]Ahmed Gara-Ali, Gerd Finke, Marie-Laure Espinouse:
Parallel-machine scheduling with maintenance: Praising the assignment problem. Eur. J. Oper. Res. 252(1): 90-97 (2016) - [j30]Nadia Brauner, Gerd Finke, Yakov M. Shafransky, Dzmitry Sledneu:
Lawler's minmax cost algorithm: optimality conditions and uncertainty. J. Sched. 19(4): 401-408 (2016) - 2015
- [j29]Vassilissa Lehoux-Lebacque, Nadia Brauner, Gerd Finke:
Identical coupled task scheduling: polynomial complexity of the cyclic case. J. Sched. 18(6): 631-644 (2015) - 2012
- [j28]Christophe Rapine, Nadia Brauner, Gerd Finke, Vassilissa Lebacque:
Single machine scheduling with small operator-non-availability periods. J. Sched. 15(2): 127-139 (2012) - 2011
- [j27]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) - [j26]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): 1670-1680 (2011) - [j25]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): 2306-2315 (2011) - 2010
- [j24]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)
2000 – 2009
- 2009
- [j23]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) - [j22]Gerd Finke, Vitaly A. Strusevich, Frank Werner:
Guest Editorial. Comput. Oper. Res. 36(2): 299-300 (2009) - [j21]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): 301-307 (2009) - [j20]Ammar Oulamara, Gerd Finke, A. Kamgaing Kuiteing:
Flowshop scheduling problem with a batching machine and task compatibilities. Comput. Oper. Res. 36(2): 391-401 (2009) - [j19]Gerd Finke, Pierre Lemaire, Jean-Marie Proth, Maurice Queyranne:
Minimizing the number of machines for minimum length schedules. Eur. J. Oper. Res. 199(3): 702-705 (2009) - [j18]Christian Artigues, Van-Dat Cung, Gerd Finke, Bernard Penz:
Articles ROADEF 2007. RAIRO Oper. Res. 43(4): 373-374 (2009) - 2008
- [j17]Gerd Finke, Vincent Jost, Maurice Queyranne, András Sebö:
Batch processing with interval graph compatibilities between tasks. Discret. Appl. Math. 156(5): 556-568 (2008) - [j16]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): 584-593 (2008) - 2007
- [j15]Gerd Finke, Ammar Oulamara:
Total Completion Time in a Two-machine Flowshop with Deteriorating Tasks. J. Math. Model. Algorithms 6(4): 563-576 (2007) - 2006
- [j14]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) - [j13]Pierre Lemaire, Gerd Finke, Nadia Brauner:
Models and Complexity of Multibin Packing Problems. J. Math. Model. Algorithms 5(3): 353-370 (2006) - 2005
- [c7]Nadia Brauner, Gerd Finke:
Robotic Cells: Configurations, Conjectures and Cycle Functions. OR 2005: 721-726 - [c6]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
- [c5]Adel Jedidi, Alexandre Caminada, Gerd Finke:
2-Objective Optimization of Cells Overlap and Geometry with Evolutionary Algorithms. EvoWorkshops 2004: 130-139 - [r1]Jacek Blazewicz, Nadia Brauner, Gerd Finke:
Scheduling with Discrete Resource Constraints. Handbook of Scheduling 2004 - 2003
- [j12]Nadia Brauner, Yves Crama, Gerd Finke, Pierre Lemaire, Christelle Wynants:
Approximation algorithms for the design of SDH/SONET networks. RAIRO Oper. Res. 37(4): 235-247 (2003) - [j11]Nadia Brauner, Gerd Finke, Wieslaw Kubiak:
Complexity of One-Cycle Robotic Flow-Shops. J. Sched. 6(4): 355-372 (2003) - 2001
- [c4]Valery S. Gordon, Jean-Marie Proth, Gerd Finke, Chengbin Chu:
Scheduling with common due date assignment. ETFA (1) 2001: 553-557 - 2000
- [j10]Caroline Privault, Gerd Finke:
k-server problems with bulk requests: an application to tool switching in manufacturing. Ann. Oper. Res. 96(1-4): 255-269 (2000)
1990 – 1999
- 1999
- [j9]Moshe Dror, Gerd Finke, Sylvain Gravier, Wieslaw Kubiak:
On the complexity of a restricted list-coloring problem. Discret. Math. 195(1-3): 103-109 (1999) - 1997
- [j8]Gerd Finke, H. Jiang:
A Variant of the Permutation Flow Shop Model with Variable Processing Times. Discret. Appl. Math. 76(1-3): 123-140 (1997) - 1995
- [j7]Caroline Privault, Gerd Finke:
Modelling a tool switching problem on a single NC-machine. J. Intell. Manuf. 6(2): 87-94 (1995) - [c3]Gerd Finke:
Planning and Scheduling. Information Management in Computer Integrated Manufacturing 1995: 165-178 - 1991
- [c2]Gerd Finke, Jacek Blazewicz:
An integrated system for scheduling machines and vehicles in an FMS. ICRA 1991: 1784-1788
1980 – 1989
- 1988
- [j6]Andrew Kusiak, Gerd Finke:
Selection of process plans in automated manufacturing systems. IEEE J. Robotics Autom. 4(4): 397-402 (1988) - 1987
- [j5]Ruy Eduardo Campello, Gerd Finke:
Preface. Discret. Appl. Math. 18(2): 105 (1987) - [j4]Andrew Kusiak, Gerd Finke:
Hierarchical approach to the process planning problem. Discret. Appl. Math. 18(2): 175-184 (1987) - [j3]Jacek Blazewicz, Gerd Finke:
Minimizing Mean Weighted Execution Time Loss on Identical and Uniform Processors. Inf. Process. Lett. 24(4): 259-263 (1987) - 1986
- [c1]Andrew Kusiak, Gerd Finke:
The process plan selection problem. ICRA 1986: 1827-1830
1970 – 1979
- 1975
- [j2]Joachim H. Ahrens, Gerd Finke:
Merging and Sorting Applied to the Zero-One Knapsack Problem. Oper. Res. 23(6): 1099-1109 (1975) - [j1]Joachim H. Ahrens, Gerd Finke:
Degeneracy in fixed cost transportation problems. Math. Program. 8(1): 369-374 (1975)
Coauthor Index
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-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
