Showing papers by "Peter Brucker published in 1991"
TL;DR: Consider the following generalization of the classical job-shop scheduling problem in which a set of machines is associated with each operation of a job, and a polynomial algorithm is derived.
Abstract: Consider the following generalization of the classical job-shop scheduling problem in which a set of machines is associated with each operation of a job. The operation can be processed on any of the machines in this set. For each assignment μ of operations to machines letP(μ) be the corresponding job-shop problem andf(μ) be the minimum makespan ofP(μ). How to find an assignment which minimizesf(μ)? For problems with two jobs a polynomial algorithm is derived.
526 citations
01 Jul 1991
TL;DR: A characterization of network representability and relate representable polymatroids to the theory of gammoids is given and a Verbindung her zwischen Repräsentierbarkeit and Gammoidtheorie is related.
Abstract: Meggido [1974] showed that the maximum flow through sets of sources in a multiple sink flow network is a polymatroidal function. Recently, Federgruen and Groenevelt [1985], [1986] have considered polymatroids that can be represented by a multiple source flow network and have improved the runnung time of an important scheduling application. We give a characterization of network representability and relate representable polymatroids to the theory of gammoids.