P
Peter Brucker
Researcher at University of Osnabrück
Publications - 117
Citations - 7131
Peter Brucker is an academic researcher from University of Osnabrück. The author has contributed to research in topics: Job shop scheduling & Flow shop scheduling. The author has an hindex of 39, co-authored 117 publications receiving 6757 citations.
Papers
More filters
Journal ArticleDOI
Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
Peter Brucker,Andreas Krämer +1 more
TL;DR: For problems with makespan, (weighted) mean flow time, weighted number of tardy tasks, and sum of tardiness as objective functions polynomial time algorithms are presented.
Journal ArticleDOI
A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
TL;DR: It is shown that complex scheduling problems like general shop problems, problems with multi-processor tasks, problemsWith multi-purpose machines, and problems with changeover times can be reduced to single-machine problems with positive and negative time-lags between jobs.
Book ChapterDOI
The job-shop problem and immediate selection
TL;DR: New algorithms for immediate selection of job-shop problems using anO(max {n logn,f})-algorithm for fixing all disjunctions induced by cliques, based on concepts which are different from those used by Carlier and Pinson are presented.
Journal ArticleDOI
Ten notes on equal-processing-time scheduling
Philippe Baptiste,Philippe Baptiste,Peter Brucker,Sigrid Knust,Vadim G. Timkovsky,Vadim G. Timkovsky +5 more
TL;DR: Equal-processing-time scheduling problems whose complexity status has been unknown are shown to be solved in polynomial time by well-known and relatively new techniques.
Journal ArticleDOI
Tabu-search for the multi-mode job-shop problem
Peter Brucker,Jürgen Neyer +1 more
TL;DR: The objective is to find a schedule which minimizes the makespan in a multi-mode job-shop problem (MMJSP) such that the resulting makespan is minimized.