Peter Brucker - RankMe

101 papers A* 1B 3C 2Journal 89Unranked 2

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