Peter Brucker

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". Computers & OR 40(4): 1060-1063 (2013)

Peter Brucker, Edmund K. Burke, Sven Groenemeyer: A branch and bound algorithm for the cyclic job-shop problem with transportation. Computers & OR 39(12): 3200-3214 (2012)

Peter Brucker, Edmund K. Burke, Sven Groenemeyer: A mixed integer programming model for the cyclic job-shop problem with transportation. Discrete Applied Mathematics 160(13-14): 1924-1935 (2012)

Peter Brucker: A Car Rental Problem at the German Bundeswehr. CTW 2012: 44-45

Peter Brucker, Rong Qu, Edmund K. Burke: Personnel scheduling: Models and complexity. European Journal of Operational Research 210(3): 467-473 (2011)

Peter Brucker, Natalia V. Shakhlevich: Inverse scheduling: two-machine flow-shop problem. J. Scheduling 14(3): 239-256 (2011)

Peter Brucker, Natalia V. Shakhlevich: A polynomial-time algorithm for a flow-shop batching problem with equal-length operations. J. Scheduling 14(4): 371-389 (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): 559-573 (2010)

Peter Brucker, Natalia V. Shakhlevich: Inverse scheduling with maximum lateness objective. J. Scheduling 12(5): 475-488 (2009)

Peter Brucker: Job-shop Scheduling Problem. Encyclopedia of Optimization 2009: 1782-1788

Peter Brucker, Thomas Kampmeyer: Cyclic job shop scheduling problems with blocking. Annals OR 159(1): 161-181 (2008)

Peter Brucker, Thomas Kampmeyer: A general model for cyclic machine scheduling problems. Discrete Applied Mathematics 156(13): 2561-2572 (2008)

Peter Brucker, Svetlana A. Kravchenko: Scheduling jobs with equal processing times and time windows on identical parallel machines. J. Scheduling 11(4): 229-237 (2008)

Peter Brucker, Yuri N. Sotskov, Frank Werner: Complexity of shop-scheduling problems with fixed number of jobs: a survey. Math. Meth. of OR 65(3): 461-481 (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. Scheduling 10(2): 139-146 (2007)

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

Peter Brucker, Sigrid Knust, Ceyda Oguz: Scheduling chains with identical jobs and constant delays on a single machine. Math. Meth. of OR 63(1): 63-75 (2006)

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 abs/cs/0605078 (2006)

Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park: The algebraic Monge property and path problems. Discrete Applied Mathematics 145(3): 455-464 (2005)

Peter Brucker, Sigrid Knust, Guoqing Wang: Complexity results for flow-shop problems with a single server. European Journal of Operational Research 165(2): 398-407 (2005)

Peter Brucker, Thomas Kampmeyer: Tabu Search Algorithms for Cyclic Machine Scheduling Problems. J. Scheduling 8(4): 303-322 (2005)

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

Peter Brucker, Thomas Kampmeyer: Cyclic Scheduling Problems with Linear Precedences and Resource Constraints. OR 2005: 667-672

Peter Brucker: Scheduling algorithms (4. ed.). Springer 2004, isbn 978-3-540-20524-1, pp. I-XII, 1-367

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

Peter Brucker, Sigrid Knust, T. C. Edwin Cheng, Natalia V. Shakhlevich: Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays. Annals OR 129(1-4): 81-106 (2004)

Peter Brucker, Sigrid Knust: Sequencing and scheduling. European Journal of Operational Research 149(2): 247-248 (2003)

Peter Brucker, Sigrid Knust: Lower bounds for resource-constrained project scheduling problems. European Journal of Operational Research 149(2): 302-313 (2003)

Peter Brucker, Johann Hurink, Sigrid Knust: A polynomial algorithm for P | p_j=1, r_j, outtree | ∑ C_j. Math. Meth. of OR 56(3): 407-412 (2003)

Peter Brucker, Silvia Heitmann, Johann Hurink: How useful are preemptive schedules? Oper. Res. Lett. 31(2): 129-136 (2003)

Peter Brucker, Sigrid Knust: Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment. Annals OR 115(1-4): 147-172 (2002)

Peter Brucker: Scheduling and constraint propagation. Discrete Applied Mathematics 123(1-3): 227-256 (2002)

Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park: Fast Algorithms with Algebraic Monge Properties. MFCS 2002: 104-117

Peter Brucker, Sigrid Knust: A linear programming and constraint propagation-based lower bound for the RCPSP. European Journal of Operational Research 127(2): 355-362 (2000)

Peter Brucker, Sigrid Knust, Duncan Roper, Yakov Zinder: Scheduling UET task systems with concurrency on two parallel identical processors. Math. Meth. of OR 52(3): 369-387 (2000)

Peter Brucker, Sigrid Knust: Resource-Constrained Project Scheduling and Timetabling. PATAT 2000: 277-293

Peter Brucker, Sigrid Knust: Complexity Results for Single-Machine Problems with Positive Finish-Start Time-Lags. Computing 63(4): 299-316 (1999)

Peter Brucker, Thomas Hilbig, Johann Hurink: A Branch and Bound Algorithm for a Single-machine Scheduling Problem with Positive, Negative Time-lags. Discrete Applied Mathematics 94(1-3): 77-99 (1999)

Peter Brucker, Andreas Drexl, Rolf H. Möhring, Klaus Neumann, Erwin Pesch: Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research 112(1): 3-41 (1999)

Peter Brucker, Svetlana A. Kravchenko, Yuri N. Sotskov: Preemptive job-shop scheduling problems with a fixed number of jobs. Math. Meth. of OR 49(1): 41-76 (1999)

Peter Brucker, Johann Hurink, Wieslaw Kubiak: Scheduling identical jobs with chain precedence constraints on two uniform machines. Math. Meth. of OR 49(2): 211-219 (1999)

Peter Brucker, Johann Hurink, Frank Werner: Improving Local Search Heuristics for some Scheduling Problems. Part II. Discrete Applied Mathematics 72(1-2): 47-69 (1997)

Peter Brucker, Johann Hurink, Bernd Jurisch, Birgit Wöstmann: A Branch & Bound Algorithm for the Open-shop Problem. Discrete Applied Mathematics 76(1-3): 43-59 (1997)

Peter Brucker, Johann Hurink, Frank Werner: Improving Local Search Heuristics for Some Scheduling Problems-I. Discrete Applied Mathematics 65(1-3): 97-122 (1996)

Peter Brucker, Mikhail Y. Kovalyov: Single machine batch scheduling to minimize the weighted number of late jobs. Math. Meth. of OR 43(1): 1-8 (1996)

Wolfgang W. Bein, Peter Brucker, James K. Park, Pramod K. Pathak: A Monge Property for the D-dimensional Transportation Problem. Discrete Applied Mathematics 58(2): 97-109 (1995)

Peter Brucker: Efficient Algorithms for Some Path Partitioning Problems. Discrete Applied Mathematics 62(1-3): 77-85 (1995)

Peter Brucker, Bernd Jurisch, Bernd Sievers: A Branch and Bound Algorithm for the Job-Shop Scheduling Problem. Discrete Applied Mathematics 49(1-3): 107-127 (1994)

Susanne Albers, Peter Brucker: The Complexity of One-Machine Batching Problems. Discrete Applied Mathematics 47(2): 87-107 (1993)

Peter Brucker, Bernd Jurisch, Marion Jurisch: Open shop problems with unit time operations. Math. Meth. of OR 37(1): 59-73 (1993)

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

Peter Brucker, Wolfgang Meyer: Scheduling two irregular polygons. Discrete Applied Mathematics 20(2): 91-100 (1988)

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): 451 (1983)

Peter Brucker: The Chinese Postman Problem for Mixed Graphs. WG 1980: 354-366