Gerd Finke

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:81/6590 · DBLP profile ↗

← Back

11ranked-venue papers

3as first author

0since 2021 · last 2011

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 6 · 2 first-authorSystems, architecture and hardware · 3 · 1 first-authorArtificial intelligence and machine learning · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 1Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science 1 paper		Mathematical optimization · 100%
Artificial intelligence 1 paper		Planning, search and constraint satisfaction · 100%

Topics — the 1 heaviest of 3, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning process planning	0.0	1	1986	The process plan selection problem · ICRA 1986

Methods — techniques the papers use, named apart from their topics

heuristic algorithm · 0.0

Year	Publication	Venue	Position
2011	The complexity of dissociation set problems in graphs Yury L. Orlovich, Alexandre Dolgui, Gerd Finke, Valery S. Gordon, Frank Werner 0001	Discret. Appl. Math.	3
2008	Batch processing with interval graph compatibilities between tasks Gerd Finke, Vincent Jost, Maurice Queyranne, András Sebö	Discret. Appl. Math.	1
2005	Specializing Narrowing for Timetable Generation: A Case Study Nadia Brauner, Rachid Echahed, Gerd Finke, Hanns Gregor, Frédéric Prost	PADL	3
2001	Scheduling with common due date assignment abstract We consider single machine scheduling problems in which due dates are assigned according to the CON (common due date) rule. The objective in this problem is to find an optimal value of the due date and the related optimal schedule in order to optimize a given criterion based on the due date and the completion times of jobs. Valery S. Gordon, Jean-Marie Proth, Gerd Finke, Chengbin Chu	ETFA (1)	3
1997	A Variant of the Permutation Flow Shop Model with Variable Processing Times Gerd Finke	Discret. Appl. Math.	1
1991	An integrated system for scheduling machines and vehicles in an FMS abstract An FMS is considered in which the AGV are operated in cyclic mode. This yields an efficient utilization of the AGVs with respect to the throughput rate for the material to be delivered. The FMS produces helicopter party. The aim is to solve simultaneously the machine and the vehicle scheduling problems. A dynamic programming approach can solve this problem in pseudo-polynomial time. In the case of a given production schedule, a polynomial-time algorithm is proposed that constructs a feasible vehicle schedule whenever one exists.> Gerd Finke, Jacek Blazewicz	ICRA	1
1988	Selection of process plans in automated manufacturing systems abstract Most of the planning models for automated manufacturing systems are based on the assumption that for each part there is only one process plan available. A more realistic point of view is taken that for each part a number of different process plans are generated, each of which may require specific types of tools and auxiliary devices such as fixtures, grippers, and feeders. A model for the selection of a set of process plans with the minimum corresponding manufacturing cost and minimal number of tools and auxiliary devices is formulated. The developed model for m parts is equivalent to the problem of finding the maximum clique in an m-partite graph with the minimum corresponding cost. Heuristic algorithms and numerical results are discussed.> Andrew Kusiak, Gerd Finke	IEEE J. Robotics Autom.	2
1987	Preface Ruy Eduardo Campello, Gerd Finke	Discret. Appl. Math.	2
1987	Hierarchical approach to the process planning problem Andrew Kusiak, Gerd Finke	Discret. Appl. Math.	2
1987	Minimizing Mean Weighted Execution Time Loss on Identical and Uniform Processors Jacek Blazewicz, Gerd Finke	Inf. Process. Lett.	2
1986	The process plan selection problem abstract Most of the planning models for FMSs are based on the assumption that for each part there is only one process plan available. In this paper, we take the more realistic standpoint that for each part a number of different process plans could be used, each of which requires specific types of tools and fixtures. A model for the selection of a set of process plans with the minimum corresponding manufacturing cost and minimal number of tools and fixtures is formulated. Heuristic algorithms and numerical results are discussed. Andrew Kusiak, Gerd Finke	ICRA	2