Peter Brucker

	2011
41		Peter Brucker, Rong Qu, Edmund K. Burke: Personnel scheduling: Models and complexity. European Journal of Operational Research 210(3): 467-473 (2011)
40		Peter Brucker, Natalia V. Shakhlevich: Inverse scheduling: two-machine flow-shop problem. J. Scheduling 14(3): 239-256 (2011)
39		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
38		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)
	2009
37		Peter Brucker: Job-shop Scheduling Problem. Encyclopedia of Optimization 2009: 1782-1788
36		Peter Brucker, Natalia V. Shakhlevich: Inverse scheduling with maximum lateness objective. J. Scheduling 12(5): 475-488 (2009)
	2008
35		Peter Brucker, Thomas Kampmeyer: Cyclic job shop scheduling problems with blocking. Annals OR 159(1): 161-181 (2008)
34		Peter Brucker, Thomas Kampmeyer: A general model for cyclic machine scheduling problems. Discrete Applied Mathematics 156(13): 2561-2572 (2008)
33		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
32		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
31		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)
30		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)
	2005
29		Peter Brucker, Svetlana A. Kravchenko: Polynomial Algorithm for Parallel Machine Mean Flow Time Scheduling Problem with Release Dates. ICCSA (4) 2005: 182-191
28		Peter Brucker, Thomas Kampmeyer: Cyclic Scheduling Problems with Linear Precedences and Resource Constraints. OR 2005: 667-672
27		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)
26		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)
25		Peter Brucker, Thomas Kampmeyer: Tabu Search Algorithms for Cyclic Machine Scheduling Problems. J. Scheduling 8(4): 303-322 (2005)
	2004
24		Peter Brucker: Scheduling algorithms (4. ed.). Springer 2004: I-XII, 1-367
23		Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky: Ten notes on equal-processing-time scheduling. 4OR 2(2): 111-127 (2004)
22		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)
	2003
21		Peter Brucker, Sigrid Knust: Sequencing and scheduling. European Journal of Operational Research 149(2): 247-248 (2003)
20		Peter Brucker, Sigrid Knust: Lower bounds for resource-constrained project scheduling problems. European Journal of Operational Research 149(2): 302-313 (2003)
19		Peter Brucker, Silvia Heitmann, Johann Hurink: How useful are preemptive schedules? Oper. Res. Lett. 31(2): 129-136 (2003)
	2002
18		Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park: Fast Algorithms with Algebraic Monge Properties. MFCS 2002: 104-117
17		Peter Brucker, Sigrid Knust: Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment. Annals OR 115(1-4): 147-172 (2002)
16		Peter Brucker: Scheduling and constraint propagation. Discrete Applied Mathematics 123(1-3): 227-256 (2002)
	2000
15		Peter Brucker, Sigrid Knust: Resource-Constrained Project Scheduling and Timetabling. PATAT 2000: 277-293
14		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)
	1999
13		Peter Brucker, Sigrid Knust: Complexity Results for Single-Machine Problems with Positive Finish-Start Time-Lags. Computing 63(4): 299-316 (1999)
12		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)
11		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)
	1997
10		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)
9		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)
	1996
8		Peter Brucker, Johann Hurink, Frank Werner: Improving Local Search Heuristics for Some Scheduling Problems-I. Discrete Applied Mathematics 65(1-3): 97-122 (1996)
	1995
7		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)
6		Peter Brucker: Efficient Algorithms for Some Path Partitioning Problems. Discrete Applied Mathematics 62(1-3): 77-85 (1995)
	1994
5		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
4		Susanne Albers, Peter Brucker: The Complexity of One-Machine Batching Problems. Discrete Applied Mathematics 47(2): 87-107 (1993)
3		Wolfgang W. Bein, Peter Brucker, Alan J. Hoffman: Series parallel composition of greedy linear programming problems. Math. Program. 62: 1-14 (1993)
	1988
2		Peter Brucker, Wolfgang Meyer: Scheduling two irregular polygons. Discrete Applied Mathematics 20(2): 91-100 (1988)
	1980
1		Peter Brucker: The Chinese Postman Problem for Mixed Graphs. WG 1980: 354-366

Coauthor Index

1	Susanne Albers	[4]
2	Philippe Baptiste	[23] [31] [32]
3	Wolfgang W. Bein	[3] [7] [18] [27]
4	Greet Vanden Berghe (Greta Van den Berghe)	[38]
5	Edmund K. Burke	[38] [41]
6	T. C. Edwin Cheng (T. C. E. Cheng)	[22]
7	Marek Chrobak	[31] [32]
8	Timothy Curtois	[38]
9	Andreas Drexl	[11]
10	Christoph Dürr	[31] [32]
11	Silvia Heitmann	[19]
12	Thomas Hilbig	[12]
13	Alan J. Hoffman	[3]
14	Johann Hurink (Johann L. Hurink)	[8] [9] [10] [12] [19]
15	Bernd Jurisch	[5] [9]
16	Thomas Kampmeyer	[25] [28] [34] [35]
17	Sigrid Knust	[13] [14] [15] [17] [20] [21] [22] [23] [26]
18	Svetlana A. Kravchenko	[29] [30] [31] [32] [33]
19	Lawrence L. Larmore	[18] [27]
20	Wolfgang Meyer	[2]
21	Rolf H. Möhring	[11]
22	Klaus Neumann	[11]
23	James K. Park	[7] [18] [27]
24	Pramod K. Pathak	[7]
25	Erwin Pesch	[11]
26	Rong Qu	[38] [41]
27	Natalia V. Shakhlevich	[22] [36] [39] [40]
28	Bernd Sievers	[5]
29	Francis Sourd	[31] [32]
30	Vadim G. Timkovsky	[23]
31	Guoqing Wang	[26]
32	Frank Werner	[8] [10]
33	Birgit Wöstmann	[9]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page