Peter Brucker

Publication Activity (10 Years)

Years Active: 1972-2016
Publications (10 Years): 2

Top Topics

Scheduling Problem

Identical Parallel Machines

Top Venues

Comput. Oper. Res.

Ann. Oper. Res.

Discret. Appl. Math.

Publications

Pieter Smet, Peter Brucker, Patrick De Causmaecker, Greet Vanden Berghe
Polynomially solvable personnel rostering problems. Eur. J. Oper. Res. 249 (1) (2016)
Peter Brucker, Natalia V. Shakhlevich
Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines. J. Sched. 19 (6) (2016)
Peter Brucker, Rong Qu
Network flow models for intraday personnel scheduling problems. Ann. Oper. Res. 218 (1) (2014)
S. S. Li, Peter Brucker, Chi To Ng, T. C. Edwin Cheng, Natalia V. Shakhlevich, Jinjiang Yuan
A note on reverse scheduling with maximum lateness objective. J. Sched. 16 (4) (2013)
Christian Artigues, Peter Brucker, Sigrid Knust, Oumar Koné, Pierre Lopez, Marcel Mongeau
A note on "event-based MILP models for resource-constrained project scheduling problems". Comput. Oper. Res. 40 (4) (2013)
Peter Brucker, Edmund K. Burke, Sven Groenemeyer
A mixed integer programming model for the cyclic job-shop problem with transportation. Discret. Appl. Math. 160 (13-14) (2012)
Peter Brucker, Edmund K. Burke, Sven Groenemeyer
A branch and bound algorithm for the cyclic job-shop problem with transportation. Comput. Oper. Res. 39 (12) (2012)
Peter Brucker
A Car Rental Problem at the German Bundeswehr. CTW (2012)
Peter Brucker, Natalia V. Shakhlevich
Inverse scheduling: two-machine flow-shop problem. J. Sched. 14 (3) (2011)
Peter Brucker, Rong Qu, Edmund K. Burke
Personnel scheduling: Models and complexity. Eur. J. Oper. Res. 210 (3) (2011)
Peter Brucker, Natalia V. Shakhlevich
A polynomial-time algorithm for a flow-shop batching problem with equal-length operations. J. Sched. 14 (4) (2011)
Peter Brucker, Edmund K. Burke, Timothy Curtois, Rong Qu, Greet Vanden Berghe
A shift sequence based approach for nurse scheduling and a new benchmark dataset. J. Heuristics 16 (4) (2010)
Peter Brucker, Natalia V. Shakhlevich
Inverse scheduling with maximum lateness objective. J. Sched. 12 (5) (2009)
Peter Brucker, Thomas Kampmeyer
A general model for cyclic machine scheduling problems. Discret. Appl. Math. 156 (13) (2008)
Peter Brucker, Svetlana A. Kravchenko
Scheduling jobs with equal processing times and time windows on identical parallel machines. J. Sched. 11 (4) (2008)
Peter Brucker, Thomas Kampmeyer
Cyclic job shop scheduling problems with blocking. Ann. Oper. Res. 159 (1) (2008)
Peter Brucker, Yuri N. Sotskov, Frank Werner
Complexity of shop-scheduling problems with fixed number of jobs: a survey. Math. Methods Oper. Res. 65 (3) (2007)
Philippe Baptiste, Peter Brucker, Marek Chrobak, Christoph Dürr, Svetlana A. Kravchenko, Francis Sourd
The complexity of mean flow time scheduling problems with release times. J. Sched. 10 (2) (2007)
Philippe Baptiste, Peter Brucker, Marek Chrobak, Christoph Dürr, Svetlana A. Kravchenko, Francis Sourd
The Complexity of Mean Flow Time Scheduling Problems with Release Times CoRR (2006)
Peter Brucker, Svetlana A. Kravchenko
Scheduling Equal Processing Time Jobs to Minimize the Weighted Number of Late Jobs. J. Math. Model. Algorithms 5 (2) (2006)
Peter Brucker, Sigrid Knust, Ceyda Oguz
Scheduling chains with identical jobs and constant delays on a single machine. Math. Methods Oper. Res. 63 (1) (2006)
Peter Brucker, Silvia Heitmann, Johann L. Hurink, Tim Nieberg
Job-shop scheduling with limited capacity buffers. OR Spectr. 28 (2) (2006)
Peter Brucker, Svetlana A. Kravchenko
Polynomial Algorithm for Parallel Machine Mean Flow Time Scheduling Problem with Release Dates. ICCSA (4) (2005)
Peter Brucker, Thomas Kampmeyer
Cyclic Scheduling Problems with Linear Precedences and Resource Constraints. OR (2005)
Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park
The algebraic Monge property and path problems. Discret. Appl. Math. 145 (3) (2005)
Peter Brucker, Sigrid Knust, Guoqing Wang
Complexity results for flow-shop problems with a single server. Eur. J. Oper. Res. 165 (2) (2005)
Peter Brucker, Thomas Kampmeyer
Tabu Search Algorithms for Cyclic Machine Scheduling Problems. J. Sched. 8 (4) (2005)
Peter Brucker, Sigrid Knust, T. C. Edwin Cheng, Natalia V. Shakhlevich
Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays. Ann. Oper. Res. 129 (1-4) (2004)
Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky
Ten notes on equal-processing-time scheduling. 4OR 2 (2) (2004)
Peter Brucker, Johann L. Hurink, Sigrid Knust
. Math. Methods Oper. Res. 56 (3) (2003)
Peter Brucker, Johann L. Hurink, Thomas Rolfes
Routing of Railway Carriages. J. Glob. Optim. 27 (2-3) (2003)
Peter Brucker, Sigrid Knust
Sequencing and scheduling. Eur. J. Oper. Res. 149 (2) (2003)
Peter Brucker, Silvia Heitmann, Johann L. Hurink
Flow-shop problems with intermediate buffers. OR Spectr. 25 (4) (2003)
Peter Brucker, Silvia Heitmann, Johann L. Hurink
How useful are preemptive schedules? Oper. Res. Lett. 31 (2) (2003)
Peter Brucker, Sigrid Knust
Lower bounds for resource-constrained project scheduling problems. Eur. J. Oper. Res. 149 (2) (2003)
Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park
Fast Algorithms with Algebraic Monge Properties. MFCS (2002)
Peter Brucker
Scheduling and constraint propagation. Discret. Appl. Math. 123 (1-3) (2002)
Peter Brucker, Sigrid Knust
Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment. Ann. Oper. Res. 115 (1-4) (2002)
Peter Brucker, Silvia Heitmann, Sigrid Knust
Scheduling railway traffic at a construction site. OR Spectr. 24 (1) (2002)
Peter Brucker, Sigrid Knust
A linear programming and constraint propagation-based lower bound for the RCPSP. Eur. J. Oper. Res. 127 (2) (2000)
Peter Brucker, Sigrid Knust, Duncan Roper, Yakov Zinder
Scheduling UET task systems with concurrency on two parallel identical processors. Math. Methods Oper. Res. 52 (3) (2000)
Peter Brucker, Johann L. Hurink
Solving a chemical batch scheduling problem by local search. Ann. Oper. Res. 96 (1-4) (2000)
Peter Brucker, Sigrid Knust
Resource-Constrained Project Scheduling and Timetabling. PATAT (2000)
Peter Brucker, Andreas Drexl, Rolf H. Möhring, Klaus Neumann, Erwin Pesch
Resource-constrained project scheduling: Notation, classification, models, and methods. Eur. J. Oper. Res. 112 (1) (1999)
Peter Brucker, Thomas Hilbig, Johann L. Hurink
A Branch and Bound Algorithm for a Single-machine Scheduling Problem with Positive, Negative Time-lags. Discret. Appl. Math. 94 (1-3) (1999)
Peter Brucker, Svetlana A. Kravchenko, Yuri N. Sotskov
Preemptive job-shop scheduling problems with a fixed number of jobs. Math. Methods Oper. Res. 49 (1) (1999)
Peter Brucker, Johann L. Hurink, Wieslaw Kubiak
Scheduling identical jobs with chain precedence constraints on two uniform machines. Math. Methods Oper. Res. 49 (2) (1999)
Peter Brucker, Sigrid Knust
Complexity Results for Single-Machine Problems with Positive Finish-Start Time-Lags. Computing 63 (4) (1999)
Peter Brucker, Sigrid Knust, Arno Schoo, Olaf Thiele
A branch and bound algorithm for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 107 (2) (1998)
Peter Brucker, Mikhail Y. Kovalyov, Yakov M. Shafransky, Frank Werner
Batch scheduling with deadlines on parallel machines. Ann. Oper. Res. 83 (1998)
Kurt Marti, Chandrasekharan Rajendran, J. R. Daduna, Peter Brucker
Book reviews. Math. Methods Oper. Res. 45 (1) (1997)
Peter Brucker, Bernd Jurisch, Andreas Krämer
Complexity of scheduling problems with multi-purpose machines. Ann. Oper. Res. 70 (1997)
Shmuel Onn, Robert Weismantel, Peter Brucker
Book reviews. Math. Methods Oper. Res. 46 (2) (1997)
Peter Brucker, Johann L. Hurink, Bernd Jurisch, Birgit Wöstmann
A Branch & Bound Algorithm for the Open-shop Problem. Discret. Appl. Math. 76 (1-3) (1997)
Peter Brucker, Johann L. Hurink, Frank Werner
Improving Local Search Heuristics for some Scheduling Problems. Part II. Discret. Appl. Math. 72 (1-2) (1997)
Peter Brucker, Johann L. Hurink, Frank Werner
Improving Local Search Heuristics for Some Scheduling Problems-I. Discret. Appl. Math. 65 (1-3) (1996)
Peter Brucker, Mikhail Y. Kovalyov
Single machine batch scheduling to minimize the weighted number of late jobs. Math. Methods Oper. Res. 43 (1) (1996)
Peter Brucker, Andreas Krämer
Shop scheduling problems with multiprocessor tasks on dedicated processors. Ann. Oper. Res. 57 (1) (1995)
Wolfgang W. Bein, Peter Brucker, James K. Park, Pramod K. Pathak
A Monge Property for the D-dimensional Transportation Problem. Discret. Appl. Math. 58 (2) (1995)
Peter Brucker
Efficient Algorithms for Some Path Partitioning Problems. Discret. Appl. Math. 62 (1-3) (1995)
Peter Brucker, Bernd Jurisch, Bernd Sievers
A Branch and Bound Algorithm for the Job-Shop Scheduling Problem. Discret. Appl. Math. 49 (1-3) (1994)
Peter Brucker, L. Nordmann
-track assignment problem. Computing 52 (2) (1994)
Peter Brucker, Bernd Jurisch, Andreas Krämer
The job-shop problem and immediate selection. Ann. Oper. Res. 50 (1) (1994)
Peter Brucker, Bernd Jurisch, Thomas Tautenhahn, Frank Werner
Scheduling unit time open shops to minimize the weighted number of late jobs. Oper. Res. Lett. 14 (5) (1993)
Peter Brucker
Book review. ZOR Methods Model. Oper. Res. 37 (2) (1993)
Peter Brucker, Bernd Jurisch, Marion Jurisch
Open shop problems with unit time operations. ZOR Methods Model. Oper. Res. 37 (1) (1993)
Wolfgang W. Bein, Peter Brucker, Alan J. Hoffman
Series parallel composition of greedy linear programming problems. Math. Program. 62 (1993)
Susanne Albers, Peter Brucker
The Complexity of One-Machine Batching Problems. Discret. Appl. Math. 47 (2) (1993)
Peter Brucker
Scheduling problems in connection with flexible production systems. ICRA (1991)
Wolfgang W. Bein, Peter Brucker, Matthias F. M. Stallmann
A characterization of network representable polymatroids. ZOR Methods Model. Oper. Res. 35 (4) (1991)
Peter Brucker, Ulrich Kathmann
Pattern scheduling. ZOR Methods Model. Oper. Res. 34 (5) (1990)
Peter Brucker, Rainer Schlie
Job-shop scheduling with multi-purpose machines. Computing 45 (4) (1990)
Wolfgang W. Bein, Peter Brucker
)-algorithm for solving a special class of linear programs. Computing 42 (4) (1989)
Peter Brucker
An efficient algorithm for the job-shop problem with two jobs. Computing 40 (4) (1988)
Peter Brucker, Wolfgang Meyer
Scheduling two irregular polygons. Discret. Appl. Math. 20 (2) (1988)
Manfred Grauer, Colhourn, Ludger Rüschendorf, M. L. Dowling, Adi Ben-Israel, D. Schweigert, Peter Brucker
Book review. Z. Oper. Research 31 (5) (1987)
Peter Brucker, Wolfgang Meyer
Approximation of a set of points by points of a grid. Computing 38 (4) (1987)
Wolfgang W. Bein, Peter Brucker
Greedy concepts for network flow problems. Discret. Appl. Math. 15 (2-3) (1986)
Peter Brucker, Johann L. Hurink
A railway scheduling problem. Z. Oper. Research 30 (5) (1986)
Peter Brucker, W. Papenjohann
An out-of-kilter method for the algebraic circulation problem. Discret. Appl. Math. 10 (1) (1985)
Wolfgang W. Bein, Peter Brucker, Arie Tamir
Minimum cost flow algorithms for series-parallel networks. Discret. Appl. Math. 10 (2) (1985)
D. Baum, K. Schittkowski, M. Armbrust, J. Zowe, K. Nickel, Peter Brucker, G. Hübner, G. Trenkler, Johannes Jahn, T. Hanschke
Book reviews. Z. Oper. Research 29 (7) (1985)
Peter Brucker
-algorithm for LP-knapsacks with a fixed number of GUB constraints. Z. Oper. Research 28 (1) (1984)
Peter Brucker, Wilhelm Hummeltenberg
Book reviews. Z. Oper. Research 27 (1) (1983)
U. Lorscheider, K.-D. Hackbarth, Ch. Scholz, Rolf H. Möhring, Franz Josef Radermacher, Alfred Luhmer, Peter Brucker, Bernd Schiemenz, Gustav Feichtinger
Book reviews. Z. Oper. Research 27 (1) (1983)
Peter Brucker
Linear and Combinatorial Optimization in Ordered Algebraic Structures, by U. Zimmermann, North-Holland, Amsterdam, 1981, 380 pp. Price: $61.00. Networks 13 (3) (1983)
Götz Uebe, Peter Brucker
Buchbesprechungen. Z. Oper. Research 27 (1) (1983)
R. Avenhaus, Peter Brucker, Alfred Luhmer, Rolf H. Möhring, Franz Josef Radermacher, Klaus-Peter Kistner, V. Brandenburg, Götz Uebe
Book reviews. Z. Oper. Research 27 (1) (1983)
Peter Brucker, G. Seeber, K. Mosler, Gustav Feichtinger, Günther Zäpfel, D. Greiner, M. Bastian, Fred Alois Behringer, Peter Stahlknecht, Hartmut Wiedey, P. H. van Leeuwen, J. M. R. Verbon-Huisman, R. Abele, Lothar Streitferdt
Buchbesprechungen. Z. Oper. Research 27 (1) (1983)
Peter Brucker
Network Flows in Trees and Knapsack Problems with Nested Constraints. WG (1982)
Peter Brucker
Minimizing maximum lateness in a two-machine unit-time job shop. Computing 27 (4) (1981)
A. Jaeger, R. K. Huber, Bernd Schiemenz, Götz Uebe, Ulrich Derigs, Peter Brucker, Johannes Jahn
Buchbesprechungen. Z. Oper. Research 25 (2) (1981)
Peter Brucker, Bernd Schiemenz, G. C. Ovuworie, Th. Eisele, Hans-Jürgen Zimmermann, Jochen Schwarze, T. Fischer, H. Dellwing, Dietrich Ohse
Book reviews. Z. Oper. Research 24 (7) (1980)
Peter Brucker
The Chinese Postman Problem for Mixed Graphs. WG (1980)
Peter Brucker
-Complete operations research problems and approximation algorithms. Z. Oper. Research 23 (3) (1979)
Peter Brucker, Michael R. Garey, David S. Johnson
Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness. Math. Oper. Res. 2 (3) (1977)
Peter Brucker
A decomposition algorithm for shortest paths in a network with many strongly connected components. Z. Oper. Research 18 (5) (1974)
Peter Brucker
ℜ-Netzwerke und Matrixalgorithmen. Computing 10 (3) (1972)