Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarPeter Brucker
Person information
- affiliation: Universität Osnabrück, Osnabrück, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2016
[j84]Pieter Smet, Peter Brucker, Patrick De Causmaecker, Greet Vanden Berghe:
Polynomially solvable personnel rostering problems. European Journal of Operational Research 249(1): 67-75 (2016)- [j83]Peter Brucker, Natalia V. Shakhlevich:
Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines. J. Scheduling 19(6): 659-685 (2016) - 2014
- [j82]Peter Brucker, Rong Qu:
Network flow models for intraday personnel scheduling problems. Annals OR 218(1): 107-114 (2014) - 2013
- [j81]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) - [j80]S. S. Li, Peter Brucker, Chi To Ng, T. C. Edwin Cheng, Natalia V. Shakhlevich, J. J. Yuan:
A note on reverse scheduling with maximum lateness objective. J. Scheduling 16(4): 417-422 (2013) - 2012
- [j79]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) - [j78]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) - [c6]
- 2011
- [j77]Peter Brucker, Rong Qu, Edmund K. Burke:
Personnel scheduling: Models and complexity. European Journal of Operational Research 210(3): 467-473 (2011) - [j76]Peter Brucker, Natalia V. Shakhlevich:
Inverse scheduling: two-machine flow-shop problem. J. Scheduling 14(3): 239-256 (2011) - [j75]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) - 2010
- [j74]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)
2000 – 2009
- 2009
- [j73]Peter Brucker, Natalia V. Shakhlevich:
Inverse scheduling with maximum lateness objective. J. Scheduling 12(5): 475-488 (2009) - [r2]
- 2008
- [j72]Peter Brucker, Thomas Kampmeyer:
Cyclic job shop scheduling problems with blocking. Annals OR 159(1): 161-181 (2008) - [j71]Peter Brucker, Thomas Kampmeyer:
A general model for cyclic machine scheduling problems. Discrete Applied Mathematics 156(13): 2561-2572 (2008) - [j70]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) - 2007
- [j69]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) - [j68]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) - 2006
- [j67]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) - [j66]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) - [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
- [j65]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) - [j64]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) - [j63]Peter Brucker, Thomas Kampmeyer:
Tabu Search Algorithms for Cyclic Machine Scheduling Problems. J. Scheduling 8(4): 303-322 (2005) - [c5]Peter Brucker, Svetlana A. Kravchenko:
Polynomial Algorithm for Parallel Machine Mean Flow Time Scheduling Problem with Release Dates. ICCSA (4) 2005: 182-191 - [c4]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 - [j62]Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky:
Ten notes on equal-processing-time scheduling. 4OR 2(2): 111-127 (2004) - [j61]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) - [r1]Philippe Baptiste, Peter Brucker:
Scheduling Equal Processing Time Jobs. Handbook of Scheduling 2004 - 2003
- [j60]Peter Brucker, Sigrid Knust:
Sequencing and scheduling. European Journal of Operational Research 149(2): 247-248 (2003) - [j59]Peter Brucker, Sigrid Knust:
Lower bounds for resource-constrained project scheduling problems. European Journal of Operational Research 149(2): 302-313 (2003) - [j58]Peter Brucker, Johann Hurink, Thomas Rolfes:
Routing of Railway Carriages. J. Global Optimization 27(2-3): 313-332 (2003) - [j57]Peter Brucker, Johann Hurink, Sigrid Knust:
A polynomial algorithm for P | pj=1, rj, outtree | ∑ Cj. Math. Meth. of OR 56(3): 407-412 (2003) - [j56]Peter Brucker, Silvia Heitmann, Johann Hurink:
How useful are preemptive schedules? Oper. Res. Lett. 31(2): 129-136 (2003) - 2002
- [j55]Peter Brucker, Sigrid Knust:
Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment. Annals OR 115(1-4): 147-172 (2002) - [j54]Peter Brucker:
Scheduling and constraint propagation. Discrete Applied Mathematics 123(1-3): 227-256 (2002) - [c3]Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park:
Fast Algorithms with Algebraic Monge Properties. MFCS 2002: 104-117 - 2000
- [j53]Peter Brucker, Johann Hurink:
Solving a chemical batch scheduling problem by local search. Annals OR 96(1-4): 17-38 (2000) - [j52]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) - [j51]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) - [c2]Peter Brucker, Sigrid Knust:
Resource-Constrained Project Scheduling and Timetabling. PATAT 2000: 277-293
1990 – 1999
- 1999
- [j50]Peter Brucker, Sigrid Knust:
Complexity Results for Single-Machine Problems with Positive Finish-Start Time-Lags. Computing 63(4): 299-316 (1999) - [j49]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) - [j48]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) - [j47]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) - [j46]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) - 1998
- [j45]Peter Brucker, Mikhail Y. Kovalyov, Yakov M. Shafransky, Frank Werner:
Batch scheduling with deadlines on parallel machines. Annals OR 83: 23-40 (1998) - [j44]Peter Brucker, Sigrid Knust, Arno Schoo, Olaf Thiele:
A branch and bound algorithm for the resource-constrained project scheduling problem. European Journal of Operational Research 107(2): 272-288 (1998) - 1997
- [j43]Peter Brucker, Bernd Jurisch, Andreas Krämer:
Complexity of scheduling problems with multi-purpose machines. Annals OR 70: 57-73 (1997) - [j42]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) - [j41]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) - [j40]Kurt Marti, Chandrasekharan Rajendran, J. R. Daduna, Peter Brucker:
Book reviews. Math. Meth. of OR 45(1): 161-166 (1997) - [j39]
- 1996
- [j38]Peter Brucker, Johann Hurink, Frank Werner:
Improving Local Search Heuristics for Some Scheduling Problems-I. Discrete Applied Mathematics 65(1-3): 97-122 (1996) - [j37]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) - 1995
- [j36]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) - [j35]Peter Brucker:
Efficient Algorithms for Some Path Partitioning Problems. Discrete Applied Mathematics 62(1-3): 77-85 (1995) - 1994
- [j34]
- [j33]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) - 1993
- [j32]Susanne Albers, Peter Brucker:
The Complexity of One-Machine Batching Problems. Discrete Applied Mathematics 47(2): 87-107 (1993) - [j31]Peter Brucker, Bernd Jurisch, Marion Jurisch:
Open shop problems with unit time operations. ZOR - Meth. & Mod. of OR 37(1): 59-73 (1993) - [j30]
- [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 - Meth. & Mod. of OR 35(4): 267-272 (1991) - 1990
- [j26]Peter Brucker, Rainer Schlie:
Job-shop scheduling with multi-purpose machines. Computing 45(4): 369-375 (1990) - [j25]
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. Discrete Applied Mathematics 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, L. Rüschendorf, M. L. Dowling, Adi Ben-Israel, D. Schweigert, Peter Brucker:
Book review. Zeitschr. für OR 31(5) (1987) - 1986
- [j19]Wolfgang W. Bein, Peter Brucker:
Greedy concepts for network flow problems. Discrete Applied Mathematics 15(2-3): 135-144 (1986) - [j18]
- 1985
- [j17]Peter Brucker, W. Papenjohann:
An out-of-kilter method for the algebraic circulation problem. Discrete Applied Mathematics 10(1): 1-18 (1985) - [j16]Wolfgang W. Bein, Peter Brucker, Arie Tamir:
Minimum cost flow algorithms for series-parallel networks. Discrete Applied Mathematics 10(2): 117-124 (1985) - [j15]D. Baum, K. Schittkowski, M. Armbrust, J. Zowe, K. Nickel, Peter Brucker, G. Hübner, G. Trenkler, Johannes Jahn, T. Hanschke:
Book reviews. Zeitschr. für OR 29(7): 317-324 (1985) - 1984
- [j14]Peter Brucker:
AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints. Zeitschr. für OR 28(1): 29-40 (1984) - 1983
- [j13]R. Avenhaus, Peter Brucker, Alfred Luhmer, Rolf H. Möhring, Franz Josef Radermacher, Klaus-Peter Kistner, V. Brandenburg, Götz Uebe:
Book reviews. Zeitschr. für OR 27(1): 67-72 (1983) - [j12]
- [j11]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. Zeitschr. für OR 27(1) (1983) - [j10]U. Lorscheider, K.-D. Hackbarth, Ch. Scholz, Rolf H. Möhring, Franz Josef Radermacher, Alfred Luhmer, Peter Brucker, Bernd Schiemenz, Gustav Feichtinger:
Book reviews. Zeitschr. für OR 27(1): 211-216 (1983) - [j9]
- [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) - 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. Zeitschr. für OR 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. Zeitschr. für OR 24(7): 274-280 (1980) - [c1]
1970 – 1979
- 1979
- [j4]Peter Brucker:
NP-Complete operations research problems and approximation algorithms. Zeitschr. für OR 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. Zeitschr. für OR 18(5): 177-180 (1974) - 1972
- [j1]
Coauthor Index
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-02-21 00:07 CET by the dblp team