ℜ-Netzwerke und Matrixalgorithmen. - Peter Brucker (Computing, 1972)

A decomposition algorithm for shortest paths in a network with many strongly connected components. - Peter Brucker (Z. Oper. Research, 1974)

Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness. - Peter Brucker; Michael R. Garey; David S. Johnson 001 (Math. Oper. Res., 1977)

NP-Complete operations research problems and approximation algorithms. - Peter Brucker (Z. Oper. Research, 1979)

The Chinese Postman Problem for Mixed Graphs. - Peter Brucker (WG, 1980)

Book reviews. - Peter Brucker; Bernd Schiemenz; G. C. Ovuworie; Th. Eisele; Hans-Jürgen Zimmermann; Jochen Schwarze; T. Fischer; H. Dellwing; Dietrich Ohse (Z. Oper. Research, 1980)

Minimizing maximum lateness in a two-machine unit-time job shop. - Peter Brucker (Computing, 1981)

Buchbesprechungen. - A. Jaeger; R. K. Huber; Bernd Schiemenz; Götz Uebe; Ulrich Derigs; Peter Brucker; Johannes Jahn (Z. Oper. Research, 1981)

Network Flows in Trees and Knapsack Problems with Nested Constraints. - Peter Brucker (WG, 1982)

Book reviews. - Rudolf Avenhaus; Peter Brucker; Alfred Luhmer; Rolf H. Möhring; Franz Josef Radermacher; Klaus-Peter Kistner; Volker Brandenburg; Götz Uebe (Z. Oper. Research, 1983)

Book reviews. - Peter Brucker; Wilhelm Hummeltenberg (Z. Oper. Research, 1983)

Buchbesprechungen. - Peter Brucker; G. Seeber; K. Mosler; Gustav Feichtinger; Günther Zäpfel; D. Greiner; Michael Bastian; Fred Alois Behringer; Peter Stahlknecht; Hartmut Wiedey; P. H. van Leeuwen; J. M. R. Verbon-Huisman; et al. (Z. Oper. Research, 1983)

Book reviews. - Ulrich Lorscheider; K.-D. Hackbarth; Ch. Scholz; Rolf H. Möhring; Franz Josef Radermacher; Alfred Luhmer; Peter Brucker; Bernd Schiemenz; Gustav Feichtinger (Z. Oper. Research, 1983)

Buchbesprechungen. - Götz Uebe; Peter Brucker (Z. Oper. Research, 1983)

Linear and Combinatorial Optimization in Ordered Algebraic Structures, by U. Zimmermann, North-Holland, Amsterdam, 1981, 380 pp. Price: $61.00. - Peter Brucker (Networks, 1983)

AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints. - Peter Brucker (Z. Oper. Research, 1984)

Minimum cost flow algorithms for series-parallel networks. - Wolfgang W. Bein; Peter Brucker; Arie Tamir (Discret. Appl. Math., 1985)

An out-of-kilter method for the algebraic circulation problem. - Peter Brucker; W. Papenjohann (Discret. Appl. Math., 1985)

Book reviews. - D. Baum; K. Schittkowski; Manfred Armbrust; J. Zowe; K. Nickel; Peter Brucker; G. Hübner; G. Trenkler; Johannes Jahn; T. Hanschke (Z. Oper. Research, 1985)

Greedy concepts for network flow problems. - Wolfgang W. Bein; Peter Brucker (Discret. Appl. Math., 1986)

A railway scheduling problem. - Peter Brucker; Johann L. Hurink (Z. Oper. Research, 1986)

Approximation of a set of points by points of a grid. - Peter Brucker; Wolfgang Meyer 001 (Computing, 1987)

Book review. - Manfred Grauer; Colhourn; Ludger Rüschendorf; M. L. Dowling; Adi Ben-Israel; D. Schweigert; Peter Brucker (Z. Oper. Research, 1987)

An efficient algorithm for the job-shop problem with two jobs. - Peter Brucker (Computing, 1988)

Scheduling two irregular polygons. - Peter Brucker; Wolfgang Meyer 001 (Discret. Appl. Math., 1988)

AnO (n logn)-algorithm for solving a special class of linear programs. - Wolfgang W. Bein; Peter Brucker (Computing, 1989)

Job-shop scheduling with multi-purpose machines. - Peter Brucker; Rainer Schlie (Computing, 1990)

Pattern scheduling. - Peter Brucker; Ulrich Kathmann (ZOR Methods Model. Oper. Res., 1990)

Scheduling problems in connection with flexible production systems. - Peter Brucker (ICRA, 1991)

A characterization of network representable polymatroids. - Wolfgang W. Bein; Peter Brucker; Matthias F. M. Stallmann (ZOR Methods Model. Oper. Res., 1991)

The Complexity of One-Machine Batching Problems. - Susanne Albers; Peter Brucker (Discret. Appl. Math., 1993)

Book review. - Peter Brucker (ZOR Methods Model. Oper. Res., 1993)

Open shop problems with unit time operations. - Peter Brucker; Bernd Jurisch; Marion Jurisch (ZOR Methods Model. Oper. Res., 1993)

Series parallel composition of greedy linear programming problems. - Wolfgang W. Bein; Peter Brucker; Alan J. Hoffman (Math. Program., 1993)

Scheduling unit time open shops to minimize the weighted number of late jobs. - Peter Brucker; Bernd Jurisch; Thomas Tautenhahn; Frank Werner 001 (Oper. Res. Lett., 1993)

The job-shop problem and immediate selection. - Peter Brucker; Bernd Jurisch; Andreas Krämer (Ann. Oper. Res., 1994)

Thek-track assignment problem. - Peter Brucker; L. Nordmann (Computing, 1994)

A Branch and Bound Algorithm for the Job-Shop Scheduling Problem. - Peter Brucker; Bernd Jurisch; Bernd Sievers (Discret. Appl. Math., 1994)

Shop scheduling problems with multiprocessor tasks on dedicated processors. - Peter Brucker; Andreas Krämer (Ann. Oper. Res., 1995)

A Monge Property for the D-dimensional Transportation Problem. - Wolfgang W. Bein; Peter Brucker; James K. Park; Pramod K. Pathak (Discret. Appl. Math., 1995)

Efficient Algorithms for Some Path Partitioning Problems. - Peter Brucker (Discret. Appl. Math., 1995)

Improving Local Search Heuristics for Some Scheduling Problems-I. - Peter Brucker; Johann L. Hurink; Frank Werner 001 (Discret. Appl. Math., 1996)

Single machine batch scheduling to minimize the weighted number of late jobs. - Peter Brucker; Mikhail Y. Kovalyov (Math. Methods Oper. Res., 1996)

Complexity of scheduling problems with multi-purpose machines. - Peter Brucker; Bernd Jurisch; Andreas Krämer (Ann. Oper. Res., 1997)

A Branch & Bound Algorithm for the Open-shop Problem. - Peter Brucker; Johann L. Hurink; Bernd Jurisch; Birgit Wöstmann (Discret. Appl. Math., 1997)

Improving Local Search Heuristics for some Scheduling Problems. Part II. - Peter Brucker; Johann L. Hurink; Frank Werner 001 (Discret. Appl. Math., 1997)

Book reviews. - Kurt Marti; Chandrasekharan Rajendran; Joachim R. Daduna; Peter Brucker (Math. Methods Oper. Res., 1997)

Book reviews. - Shmuel Onn; Robert Weismantel; Peter Brucker (Math. Methods Oper. Res., 1997)

Batch scheduling with deadlines on parallel machines. - Peter Brucker; Mikhail Y. Kovalyov; Yakov M. Shafransky; Frank Werner 001 (Ann. Oper. Res., 1998)

A branch and bound algorithm for the resource-constrained project scheduling problem. - Peter Brucker; Sigrid Knust; Arno Schoo; Olaf Thiele (Eur. J. Oper. Res., 1998)

Complexity Results for Single-Machine Problems with Positive Finish-Start Time-Lags. - Peter Brucker; Sigrid Knust (Computing, 1999)

A Branch and Bound Algorithm for a Single-machine Scheduling Problem with Positive, Negative Time-lags. - Peter Brucker; Thomas Hilbig; Johann L. Hurink (Discret. Appl. Math., 1999)

Resource-constrained project scheduling: Notation, classification, models, and methods. - Peter Brucker; Andreas Drexl; Rolf H. Möhring; Klaus Neumann 001; Erwin Pesch (Eur. J. Oper. Res., 1999)

Scheduling identical jobs with chain precedence constraints on two uniform machines. - Peter Brucker; Johann L. Hurink; Wieslaw Kubiak (Math. Methods Oper. Res., 1999)

Preemptive job-shop scheduling problems with a fixed number of jobs. - Peter Brucker; Svetlana A. Kravchenko; Yuri N. Sotskov (Math. Methods Oper. Res., 1999)

Resource-Constrained Project Scheduling and Timetabling. - Peter Brucker; Sigrid Knust (PATAT, 2000)

Solving a chemical batch scheduling problem by local search. - Peter Brucker; Johann L. Hurink (Ann. Oper. Res., 2000)

A linear programming and constraint propagation-based lower bound for the RCPSP. - Peter Brucker; Sigrid Knust (Eur. J. Oper. Res., 2000)

Scheduling UET task systems with concurrency on two parallel identical processors. - Peter Brucker; Sigrid Knust; Duncan Roper; Yakov Zinder (Math. Methods Oper. Res., 2000)

Fast Algorithms with Algebraic Monge Properties. - Wolfgang W. Bein; Peter Brucker; Lawrence L. Larmore; James K. Park (MFCS, 2002)

Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment. - Peter Brucker; Sigrid Knust (Ann. Oper. Res., 2002)

Scheduling and constraint propagation. - Peter Brucker (Discret. Appl. Math., 2002)

Scheduling railway traffic at a construction site. - Peter Brucker; Silvia Heitmann; Sigrid Knust (OR Spectr., 2002)

Sequencing and scheduling. - Peter Brucker; Sigrid Knust (Eur. J. Oper. Res., 2003)

Lower bounds for resource-constrained project scheduling problems. - Peter Brucker; Sigrid Knust (Eur. J. Oper. Res., 2003)

Routing of Railway Carriages. - Peter Brucker; Johann L. Hurink; Thomas Rolfes (J. Glob. Optim., 2003)

A polynomial algorithm for P | pj=1, rj, outtree | ∑ Cj. - Peter Brucker; Johann L. Hurink; Sigrid Knust (Math. Methods Oper. Res., 2003)

How useful are preemptive schedules? - Peter Brucker; Silvia Heitmann; Johann L. Hurink (Oper. Res. Lett., 2003)

Flow-shop problems with intermediate buffers. - Peter Brucker; Silvia Heitmann; Johann L. Hurink (OR Spectr., 2003)

Scheduling algorithms (4. ed.). - Peter Brucker (Springer, 2004)

Ten notes on equal-processing-time scheduling. - Philippe Baptiste; Peter Brucker; Sigrid Knust; Vadim G. Timkovsky (4OR, 2004)

Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays. - Peter Brucker; Sigrid Knust; T. C. Edwin Cheng; Natalia V. Shakhlevich (Ann. Oper. Res., 2004)

Scheduling Equal Processing Time Jobs. - Philippe Baptiste; Peter Brucker (Handbook of Scheduling, 2004)

Polynomial Algorithm for Parallel Machine Mean Flow Time Scheduling Problem with Release Dates. - Peter Brucker; Svetlana A. Kravchenko (ICCSA (4), 2005)

Cyclic Scheduling Problems with Linear Precedences and Resource Constraints. - Peter Brucker; Thomas Kampmeyer (OR, 2005)

The algebraic Monge property and path problems. - Wolfgang W. Bein; Peter Brucker; Lawrence L. Larmore; James K. Park (Discret. Appl. Math., 2005)

Complexity results for flow-shop problems with a single server. - Peter Brucker; Sigrid Knust; Guoqing Wang (Eur. J. Oper. Res., 2005)

Tabu Search Algorithms for Cyclic Machine Scheduling Problems. - Peter Brucker; Thomas Kampmeyer (J. Sched., 2005)

Scheduling Equal Processing Time Jobs to Minimize the Weighted Number of Late Jobs. - Peter Brucker; Svetlana A. Kravchenko (J. Math. Model. Algorithms, 2006)

Scheduling chains with identical jobs and constant delays on a single machine. - Peter Brucker; Sigrid Knust; Ceyda Oguz (Math. Methods Oper. Res., 2006)

Job-shop scheduling with limited capacity buffers. - Peter Brucker; Silvia Heitmann; Johann L. Hurink; Tim Nieberg (OR Spectr., 2006)

Complexity of shop-scheduling problems with fixed number of jobs: a survey. - Peter Brucker; Yuri N. Sotskov; Frank Werner 001 (Math. Methods Oper. Res., 2007)

The complexity of mean flow time scheduling problems with release times. - Philippe Baptiste; Peter Brucker; Marek Chrobak; Christoph Dürr; Svetlana A. Kravchenko; Francis Sourd (J. Sched., 2007)

Cyclic job shop scheduling problems with blocking. - Peter Brucker; Thomas Kampmeyer (Ann. Oper. Res., 2008)

A general model for cyclic machine scheduling problems. - Peter Brucker; Thomas Kampmeyer (Discret. Appl. Math., 2008)

Scheduling jobs with equal processing times and time windows on identical parallel machines. - Peter Brucker; Svetlana A. Kravchenko (J. Sched., 2008)

On the Complexity of Scheduling. - Peter Brucker; Sigrid Knust (Introduction to Scheduling, 2009)

Inverse scheduling with maximum lateness objective. - Peter Brucker; Natalia V. Shakhlevich (J. Sched., 2009)

Job-shop Scheduling Problem. - Peter Brucker (Encyclopedia of Optimization, 2009)

A shift sequence based approach for nurse scheduling and a new benchmark dataset. - Peter Brucker; Edmund K. Burke; Timothy Curtois; Rong Qu; Greet Vanden Berghe (J. Heuristics, 2010)

Personnel scheduling: Models and complexity. - Peter Brucker; Rong Qu; Edmund K. Burke (Eur. J. Oper. Res., 2011)

Inverse scheduling: two-machine flow-shop problem. - Peter Brucker; Natalia V. Shakhlevich (J. Sched., 2011)

A polynomial-time algorithm for a flow-shop batching problem with equal-length operations. - Peter Brucker; Natalia V. Shakhlevich (J. Sched., 2011)

A Car Rental Problem at the German Bundeswehr. - Peter Brucker (CTW, 2012)

A branch and bound algorithm for the cyclic job-shop problem with transportation. - Peter Brucker; Edmund K. Burke; Sven Groenemeyer (Comput. Oper. Res., 2012)

A mixed integer programming model for the cyclic job-shop problem with transportation. - Peter Brucker; Edmund K. Burke; Sven Groenemeyer (Discret. Appl. Math., 2012)

A note on "event-based MILP models for resource-constrained project scheduling problems". - Christian Artigues; Peter Brucker; Sigrid Knust; Oumar Koné; Pierre Lopez; Marcel Mongeau (Comput. Oper. Res., 2013)

A note on reverse scheduling with maximum lateness objective. - S. S. Li; Peter Brucker; Chi To Ng 001; T. C. Edwin Cheng; Natalia V. Shakhlevich; Jinjiang Yuan (J. Sched., 2013)

Network flow models for intraday personnel scheduling problems. - Peter Brucker; Rong Qu (Ann. Oper. Res., 2014)

Polynomially solvable personnel rostering problems. - Pieter Smet; Peter Brucker; Patrick De Causmaecker; Greet Vanden Berghe (Eur. J. Oper. Res., 2016)

Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines. - Peter Brucker; Natalia V. Shakhlevich (J. Sched., 2016)