default search action
Peter Brucker
Person information
- affiliation: Universität Osnabrück, Osnabrück, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2016
- [j89]Pieter Smet
, Peter Brucker, Patrick De Causmaecker
Polynomially solvable personnel rostering problems. Eur. J. Oper. Res. 249(1): 67-75 (2016) - [j88]Peter Brucker, Natalia V. Shakhlevich:
Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines. J. Sched. 19(6): 659-685 (2016) - 2014
- [j87]Peter Brucker, Rong Qu
Network flow models for intraday personnel scheduling problems. Ann. Oper. Res. 218(1): 107-114 (2014) - 2013
- [j86]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): 1060-1063 (2013) - [j85]S. S. Li, Peter Brucker, Chi To Ng
A note on reverse scheduling with maximum lateness objective. J. Sched. 16(4): 417-422 (2013) - 2012
- [j84]Peter Brucker, Edmund K. Burke
A branch and bound algorithm for the cyclic job-shop problem with transportation. Comput. Oper. Res. 39(12): 3200-3214 (2012) - [j83]Peter Brucker, Edmund K. Burke
A mixed integer programming model for the cyclic job-shop problem with transportation. Discret. Appl. Math. 160(13-14): 1924-1935 (2012) - [c8]Peter Brucker:
A Car Rental Problem at the German Bundeswehr. CTW 2012: 44-45 - 2011
- [j82]Peter Brucker, Rong Qu
Personnel scheduling: Models and complexity. Eur. J. Oper. Res. 210(3): 467-473 (2011) - [j81]Peter Brucker, Natalia V. Shakhlevich
Inverse scheduling: two-machine flow-shop problem. J. Sched. 14(3): 239-256 (2011) - [j80]Peter Brucker, Natalia V. Shakhlevich
A polynomial-time algorithm for a flow-shop batching problem with equal-length operations. J. Sched. 14(4): 371-389 (2011) - 2010
- [j79]Peter Brucker, Edmund K. Burke
A shift sequence based approach for nurse scheduling and a new benchmark dataset. J. Heuristics 16(4): 559-573 (2010)
2000 – 2009
- 2009
- [j78]Peter Brucker, Natalia V. Shakhlevich
Inverse scheduling with maximum lateness objective. J. Sched. 12(5): 475-488 (2009) - [p1]Peter Brucker, Sigrid Knust:
On the Complexity of Scheduling. Introduction to Scheduling 2009: 1-21 - [r2]Peter Brucker:
Job-shop Scheduling Problem. Encyclopedia of Optimization 2009: 1782-1788 - 2008
- [j77]Peter Brucker, Thomas Kampmeyer:
Cyclic job shop scheduling problems with blocking. Ann. Oper. Res. 159(1): 161-181 (2008) - [j76]Peter Brucker, Thomas Kampmeyer:
A general model for cyclic machine scheduling problems. Discret. Appl. Math. 156(13): 2561-2572 (2008) - [j75]Peter Brucker, Svetlana A. Kravchenko:
Scheduling jobs with equal processing times and time windows on identical parallel machines. J. Sched. 11(4): 229-237 (2008) - 2007
- [j74]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): 461-481 (2007) - [j73]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): 139-146 (2007) - 2006
- [j72]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) - [j71]Peter Brucker, Sigrid Knust, Ceyda Oguz
Scheduling chains with identical jobs and constant delays on a single machine. Math. Methods Oper. Res. 63(1): 63-75 (2006) - [j70]Peter Brucker, Silvia Heitmann, Johann L. Hurink
Job-shop scheduling with limited capacity buffers. OR Spectr. 28(2): 151-176 (2006) - [i1]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) - 2005
- [j69]Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park:
The algebraic Monge property and path problems. Discret. Appl. Math. 145(3): 455-464 (2005) - [j68]Peter Brucker, Sigrid Knust, Guoqing Wang:
Complexity results for flow-shop problems with a single server. Eur. J. Oper. Res. 165(2): 398-407 (2005) - [j67]Peter Brucker, Thomas Kampmeyer:
Tabu Search Algorithms for Cyclic Machine Scheduling Problems. J. Sched. 8(4): 303-322 (2005) - [c7]Peter Brucker, Svetlana A. Kravchenko:
Polynomial Algorithm for Parallel Machine Mean Flow Time Scheduling Problem with Release Dates. ICCSA (4) 2005: 182-191 - [c6]Peter Brucker, Thomas Kampmeyer:
Cyclic Scheduling Problems with Linear Precedences and Resource Constraints. OR 2005: 667-672 - 2004
- [b1]Peter Brucker:
Scheduling algorithms (4. ed.). Springer 2004, ISBN 978-3-540-20524-1, pp. I-XII, 1-367 - [j66]Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky:
Ten notes on equal-processing-time scheduling. 4OR 2(2): 111-127 (2004) - [j65]Peter Brucker, Sigrid Knust, T. C. Edwin Cheng
Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays. Ann. Oper. Res. 129(1-4): 81-106 (2004) - [r1]Philippe Baptiste, Peter Brucker:
Scheduling Equal Processing Time Jobs. Handbook of Scheduling 2004 - 2003
- [j64]Peter Brucker, Sigrid Knust:
Sequencing and scheduling. Eur. J. Oper. Res. 149(2): 247-248 (2003) - [j63]Peter Brucker, Sigrid Knust:
Lower bounds for resource-constrained project scheduling problems. Eur. J. Oper. Res. 149(2): 302-313 (2003) - [j62]Peter Brucker, Johann L. Hurink
Routing of Railway Carriages. J. Glob. Optim. 27(2-3): 313-332 (2003) - [j61]Peter Brucker, Johann L. Hurink
A polynomial algorithm for P | pj=1, rj, outtree | ∑ Cj. Math. Methods Oper. Res. 56(3): 407-412 (2003) - [j60]Peter Brucker, Silvia Heitmann, Johann L. Hurink
How useful are preemptive schedules? Oper. Res. Lett. 31(2): 129-136 (2003) - [j59]Peter Brucker, Silvia Heitmann, Johann L. Hurink:
Flow-shop problems with intermediate buffers. OR Spectr. 25(4): 549-574 (2003) - 2002
- [j58]Peter Brucker, Sigrid Knust:
Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment. Ann. Oper. Res. 115(1-4): 147-172 (2002) - [j57]Peter Brucker:
Scheduling and constraint propagation. Discret. Appl. Math. 123(1-3): 227-256 (2002) - [j56]Peter Brucker, Silvia Heitmann, Sigrid Knust:
Scheduling railway traffic at a construction site. OR Spectr. 24(1): 19-30 (2002) - [c5]Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park:
Fast Algorithms with Algebraic Monge Properties. MFCS 2002: 104-117 - 2000
- [j55]Peter Brucker, Johann L. Hurink:
Solving a chemical batch scheduling problem by local search. Ann. Oper. Res. 96(1-4): 17-38 (2000) - [j54]Peter Brucker, Sigrid Knust:
A linear programming and constraint propagation-based lower bound for the RCPSP. Eur. J. Oper. Res. 127(2): 355-362 (2000) - [j53]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): 369-387 (2000) - [c4]Peter Brucker, Sigrid Knust:
Resource-Constrained Project Scheduling and Timetabling. PATAT 2000: 277-293
1990 – 1999
- 1999
- [j52]Peter Brucker, Sigrid Knust:
Complexity Results for Single-Machine Problems with Positive Finish-Start Time-Lags. Computing 63(4): 299-316 (1999) - [j51]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): 77-99 (1999) - [j50]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): 3-41 (1999) - [j49]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): 41-76 (1999) - [j48]Peter Brucker, Johann L. Hurink, Wieslaw Kubiak:
Scheduling identical jobs with chain precedence constraints on two uniform machines. Math. Methods Oper. Res. 49(2): 211-219 (1999) - 1998
- [j47]Peter Brucker, Mikhail Y. Kovalyov, Yakov M. Shafransky, Frank Werner:
Batch scheduling with deadlines on parallel machines. Ann. Oper. Res. 83: 23-40 (1998) - [j46]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): 272-288 (1998) - 1997
- [j45]Peter Brucker, Bernd Jurisch, Andreas Krämer:
Complexity of scheduling problems with multi-purpose machines. Ann. Oper. Res. 70: 57-73 (1997) - [j44]Peter Brucker, Johann L. Hurink, Frank Werner
Improving Local Search Heuristics for some Scheduling Problems. Part II. Discret. Appl. Math. 72(1-2): 47-69 (1997) - [j43]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): 43-59 (1997) - [j42]Kurt Marti, Chandrasekharan Rajendran, Joachim R. Daduna, Peter Brucker:
Book reviews. Math. Methods Oper. Res. 45(1): 161-166 (1997) - [j41]Shmuel Onn, Robert Weismantel, Peter Brucker:
Book reviews. Math. Methods Oper. Res. 46(2): 281-284 (1997) - 1996
- [j40]Peter Brucker, Johann L. Hurink, Frank Werner
Improving Local Search Heuristics for Some Scheduling Problems-I. Discret. Appl. Math. 65(1-3): 97-122 (1996) - [j39]Peter Brucker, Mikhail Y. Kovalyov
Single machine batch scheduling to minimize the weighted number of late jobs. Math. Methods Oper. Res. 43(1): 1-8 (1996) - 1995
- [j38]Peter Brucker, Andreas Krämer:
Shop scheduling problems with multiprocessor tasks on dedicated processors. Ann. Oper. Res. 57(1): 13-27 (1995) - [j37]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): 97-109 (1995) - [j36]Peter Brucker:
Efficient Algorithms for Some Path Partitioning Problems. Discret. Appl. Math. 62(1-3): 77-85 (1995) - 1994
- [j35]Peter Brucker, Bernd Jurisch, Andreas Krämer:
The job-shop problem and immediate selection. Ann. Oper. Res. 50(1): 73-114 (1994) - [j34]Peter Brucker, L. Nordmann:
Thek-track assignment problem. Computing 52(2): 97-122 (1994) - [j33]Peter Brucker, Bernd Jurisch, Bernd Sievers:
A Branch and Bound Algorithm for the Job-Shop Scheduling Problem. Discret. Appl. Math. 49(1-3): 107-127 (1994) - 1993
- [j32]Susanne Albers, Peter Brucker:
The Complexity of One-Machine Batching Problems. Discret. Appl. Math. 47(2): 87-107 (1993) - [j31]Peter Brucker, Bernd Jurisch, Marion Jurisch:
Open shop problems with unit time operations. ZOR Methods Model. Oper. Res. 37(1): 59-73 (1993) - [j30]Peter Brucker:
Book review. ZOR Methods Model. Oper. Res. 37(2): 206 (1993) - [j29]Wolfgang W. Bein, Peter Brucker, Alan J. Hoffman:
Series parallel composition of greedy linear programming problems. Math. Program. 62: 1-14 (1993) - [j28]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): 245-250 (1993) - 1991
- [j27]Wolfgang W. Bein, Peter Brucker, Matthias F. M. Stallmann:
A characterization of network representable polymatroids. ZOR Methods Model. Oper. Res. 35(4): 267-272 (1991) - [c3]Peter Brucker:
Scheduling problems in connection with flexible production systems. ICRA 1991: 1778-1783 - 1990
- [j26]Peter Brucker, Rainer Schlie:
Job-shop scheduling with multi-purpose machines. Computing 45(4): 369-375 (1990) - [j25]Peter Brucker, Ulrich Kathmann:
Pattern scheduling. ZOR Methods Model. Oper. Res. 34(5): 381-394 (1990)
1980 – 1989
- 1989
- [j24]Wolfgang W. Bein, Peter Brucker:
AnO (n logn)-algorithm for solving a special class of linear programs. Computing 42(4): 309-313 (1989) - 1988
- [j23]Peter Brucker:
An efficient algorithm for the job-shop problem with two jobs. Computing 40(4): 353-359 (1988) - [j22]Peter Brucker, Wolfgang Meyer:
Scheduling two irregular polygons. Discret. Appl. Math. 20(2): 91-100 (1988) - 1987
- [j21]Peter Brucker, Wolfgang Meyer:
Approximation of a set of points by points of a grid. Computing 38(4): 341-345 (1987) - [j20]Manfred Grauer, Colhourn, Ludger Rüschendorf, M. L. Dowling, Adi Ben-Israel, D. Schweigert, Peter Brucker:
Book review. Z. Oper. Research 31(5) (1987) - 1986
- [j19]Wolfgang W. Bein, Peter Brucker:
Greedy concepts for network flow problems. Discret. Appl. Math. 15(2-3): 135-144 (1986) - [j18]Peter Brucker, Johann L. Hurink
A railway scheduling problem. Z. Oper. Research 30(5) (1986) - 1985
- [j17]Peter Brucker, W. Papenjohann:
An out-of-kilter method for the algebraic circulation problem. Discret. Appl. Math. 10(1): 1-18 (1985) - [j16]Wolfgang W. Bein, Peter Brucker, Arie Tamir:
Minimum cost flow algorithms for series-parallel networks. Discret. Appl. Math. 10(2): 117-124 (1985) - [j15]D. Baum, K. Schittkowski, Manfred Armbrust, J. Zowe, K. Nickel, Peter Brucker, G. Hübner, G. Trenkler, Johannes Jahn, T. Hanschke:
Book reviews. Z. Oper. Research 29(7): 317-324 (1985) - 1984
- [j14]Peter Brucker:
AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints. Z. Oper. Research 28(1): 29-40 (1984) - 1983
- [j13]Rudolf Avenhaus, Peter Brucker, Alfred Luhmer, Rolf H. Möhring, Franz Josef Radermacher, Klaus-Peter Kistner, Volker Brandenburg, Götz Uebe:
Book reviews. Z. Oper. Research 27(1): 67-72 (1983) - [j12]Peter Brucker, Wilhelm Hummeltenberg:
Book reviews. Z. Oper. Research 27(1): 176 (1983) - [j11]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, R. Abele, Lothar Streitferdt:
Buchbesprechungen. Z. Oper. Research 27(1) (1983) - [j10]Ulrich 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): 211-216 (1983) - [j9]Götz Uebe, Peter Brucker:
Buchbesprechungen. Z. Oper. Research 27(1) (1983) - [j8]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) - 1982
- [c2]Peter Brucker:
Network Flows in Trees and Knapsack Problems with Nested Constraints. WG 1982: 25-36 - 1981
- [j7]Peter Brucker:
Minimizing maximum lateness in a two-machine unit-time job shop. Computing 27(4): 367-370 (1981) - [j6]A. Jaeger, R. K. Huber, Bernd Schiemenz, Götz Uebe, Ulrich Derigs, Peter Brucker, Johannes Jahn:
Buchbesprechungen. Z. Oper. Research 25(2) (1981) - 1980
- [j5]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): 274-280 (1980) - [c1]Peter Brucker:
The Chinese Postman Problem for Mixed Graphs. WG 1980: 354-366
1970 – 1979
- 1979
- [j4]Peter Brucker:
NP-Complete operations research problems and approximation algorithms. Z. Oper. Research 23(3): 73-94 (1979) - 1977
- [j3]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): 275-284 (1977) - 1974
- [j2]Peter Brucker:
A decomposition algorithm for shortest paths in a network with many strongly connected components. Z. Oper. Research 18(5): 177-180 (1974) - 1972
- [j1]Peter Brucker:
ℜ-Netzwerke und Matrixalgorithmen. Computing 10(3): 271-283 (1972)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-11 20:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: