Peter Brucker

According to our database1, Peter Brucker authored at least 101 papers between 1972 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines.
J. Sched., 2016

Polynomially solvable personnel rostering problems.
Eur. J. Oper. Res., 2016

2014
Network flow models for intraday personnel scheduling problems.
Ann. Oper. Res., 2014

2013
A note on reverse scheduling with maximum lateness objective.
J. Sched., 2013

A note on "event-based MILP models for resource-constrained project scheduling problems".
Comput. Oper. Res., 2013

2012
A mixed integer programming model for the cyclic job-shop problem with transportation.
Discret. Appl. Math., 2012

A branch and bound algorithm for the cyclic job-shop problem with transportation.
Comput. Oper. Res., 2012

A Car Rental Problem at the German Bundeswehr.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011
A polynomial-time algorithm for a flow-shop batching problem with equal-length operations.
J. Sched., 2011

Inverse scheduling: two-machine flow-shop problem.
J. Sched., 2011

Personnel scheduling: Models and complexity.
Eur. J. Oper. Res., 2011

2010
A shift sequence based approach for nurse scheduling and a new benchmark dataset.
J. Heuristics, 2010

2009
Job-shop Scheduling Problem.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Inverse scheduling with maximum lateness objective.
J. Sched., 2009

On the Complexity of Scheduling.
Proceedings of the Introduction to Scheduling., 2009

2008
Scheduling jobs with equal processing times and time windows on identical parallel machines.
J. Sched., 2008

A general model for cyclic machine scheduling problems.
Discret. Appl. Math., 2008

Cyclic job shop scheduling problems with blocking.
Ann. Oper. Res., 2008

2007
The complexity of mean flow time scheduling problems with release times.
J. Sched., 2007

Complexity of shop-scheduling problems with fixed number of jobs: a survey.
Math. Methods Oper. Res., 2007

2006
Job-shop scheduling with limited capacity buffers.
OR Spectr., 2006

Scheduling chains with identical jobs and constant delays on a single machine.
Math. Methods Oper. Res., 2006

Scheduling Equal Processing Time Jobs to Minimize the Weighted Number of Late Jobs.
J. Math. Model. Algorithms, 2006

2005
Tabu Search Algorithms for Cyclic Machine Scheduling Problems.
J. Sched., 2005

Complexity results for flow-shop problems with a single server.
Eur. J. Oper. Res., 2005

The algebraic Monge property and path problems.
Discret. Appl. Math., 2005

Cyclic Scheduling Problems with Linear Precedences and Resource Constraints.
Proceedings of the Operations Research Proceedings 2005, 2005

Polynomial Algorithm for Parallel Machine Mean Flow Time Scheduling Problem with Release Dates.
Proceedings of the Computational Science and Its Applications, 2005

2004
Scheduling Equal Processing Time Jobs.
Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays.
Ann. Oper. Res., 2004

Ten notes on equal-processing-time scheduling.
4OR, 2004

Scheduling algorithms (4. ed.).
Springer, ISBN: 978-3-540-20524-1, 2004

2003
Flow-shop problems with intermediate buffers.
OR Spectr., 2003

How useful are preemptive schedules?
Oper. Res. Lett., 2003

A polynomial algorithm for P | p<sub>j</sub>=1, r<sub>j</sub>, outtree | ∑ C<sub>j</sub>.
Math. Methods Oper. Res., 2003

Routing of Railway Carriages.
J. Glob. Optim., 2003

Lower bounds for resource-constrained project scheduling problems.
Eur. J. Oper. Res., 2003

Sequencing and scheduling.
Eur. J. Oper. Res., 2003

2002
Scheduling railway traffic at a construction site.
OR Spectr., 2002

Scheduling and constraint propagation.
Discret. Appl. Math., 2002

Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment.
Ann. Oper. Res., 2002

Fast Algorithms with Algebraic Monge Properties.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2000
Scheduling UET task systems with concurrency on two parallel identical processors.
Math. Methods Oper. Res., 2000

A linear programming and constraint propagation-based lower bound for the RCPSP.
Eur. J. Oper. Res., 2000

Solving a chemical batch scheduling problem by local search.
Ann. Oper. Res., 2000

Resource-Constrained Project Scheduling and Timetabling.
Proceedings of the Practice and Theory of Automated Timetabling III, 2000

1999
Preemptive job-shop scheduling problems with a fixed number of jobs.
Math. Methods Oper. Res., 1999

Scheduling identical jobs with chain precedence constraints on two uniform machines.
Math. Methods Oper. Res., 1999

Resource-constrained project scheduling: Notation, classification, models, and methods.
Eur. J. Oper. Res., 1999

A Branch and Bound Algorithm for a Single-machine Scheduling Problem with Positive, Negative Time-lags.
Discret. Appl. Math., 1999

Complexity Results for Single-Machine Problems with Positive Finish-Start Time-Lags.
Computing, 1999

1998
A branch and bound algorithm for the resource-constrained project scheduling problem.
Eur. J. Oper. Res., 1998

Batch scheduling with deadlines on parallel machines.
Ann. Oper. Res., 1998

1997
Book reviews.
Math. Methods Oper. Res., 1997

Book reviews.
Math. Methods Oper. Res., 1997

Improving Local Search Heuristics for some Scheduling Problems. Part II.
Discret. Appl. Math., 1997

A Branch & Bound Algorithm for the Open-shop Problem.
Discret. Appl. Math., 1997

Complexity of scheduling problems with multi-purpose machines.
Ann. Oper. Res., 1997

1996
Single machine batch scheduling to minimize the weighted number of late jobs.
Math. Methods Oper. Res., 1996

Improving Local Search Heuristics for Some Scheduling Problems-I.
Discret. Appl. Math., 1996

1995
Efficient Algorithms for Some Path Partitioning Problems.
Discret. Appl. Math., 1995

A Monge Property for the D-dimensional Transportation Problem.
Discret. Appl. Math., 1995

Shop scheduling problems with multiprocessor tasks on dedicated processors.
Ann. Oper. Res., 1995

1994
A Branch and Bound Algorithm for the Job-Shop Scheduling Problem.
Discret. Appl. Math., 1994

The<i>k</i>-track assignment problem.
Computing, 1994

The job-shop problem and immediate selection.
Ann. Oper. Res., 1994

1993
Scheduling unit time open shops to minimize the weighted number of late jobs.
Oper. Res. Lett., 1993

Series parallel composition of greedy linear programming problems.
Math. Program., 1993

Open shop problems with unit time operations.
ZOR Methods Model. Oper. Res., 1993

Book review.
ZOR Methods Model. Oper. Res., 1993

The Complexity of One-Machine Batching Problems.
Discret. Appl. Math., 1993

1991
A characterization of network representable polymatroids.
ZOR Methods Model. Oper. Res., 1991

Scheduling problems in connection with flexible production systems.
Proceedings of the 1991 IEEE International Conference on Robotics and Automation, 1991

1990
Pattern scheduling.
ZOR Methods Model. Oper. Res., 1990

Job-shop scheduling with multi-purpose machines.
Computing, 1990

1989
An<i>O</i> (<i>n</i> log<i>n</i>)-algorithm for solving a special class of linear programs.
Computing, 1989

1988
Scheduling two irregular polygons.
Discret. Appl. Math., 1988

An efficient algorithm for the job-shop problem with two jobs.
Computing, 1988

1987
Book review.
Z. Oper. Research, 1987

Approximation of a set of points by points of a grid.
Computing, 1987

1986
A railway scheduling problem.
Z. Oper. Research, 1986

Greedy concepts for network flow problems.
Discret. Appl. Math., 1986

1985
Book reviews.
Z. Oper. Research, 1985

An out-of-kilter method for the algebraic circulation problem.
Discret. Appl. Math., 1985

Minimum cost flow algorithms for series-parallel networks.
Discret. Appl. Math., 1985

1984
An<i>O (n)</i>-algorithm for LP-knapsacks with a fixed number of GUB constraints.
Z. Oper. Research, 1984

1983
Linear and Combinatorial Optimization in Ordered Algebraic Structures, by U. Zimmermann, North-Holland, Amsterdam, 1981, 380 pp. Price: $61.00.
Networks, 1983

Buchbesprechungen.
Z. Oper. Research, 1983

Book reviews.
Z. Oper. Research, 1983

Buchbesprechungen.
Z. Oper. Research, 1983

Book reviews.
Z. Oper. Research, 1983

Book reviews.
Z. Oper. Research, 1983

1982
Network Flows in Trees and Knapsack Problems with Nested Constraints.
Proceedings of the 8th Conference Graphtheoretic Concepts in Computer Science (WG '82), 1982

1981
Buchbesprechungen.
Z. Oper. Research, 1981

Minimizing maximum lateness in a two-machine unit-time job shop.
Computing, 1981

1980
Book reviews.
Z. Oper. Research, 1980

The Chinese Postman Problem for Mixed Graphs.
Proceedings of the Graphtheoretic Concepts in Computer Science, 1980

1979
<i>NP</i>-Complete operations research problems and approximation algorithms.
Z. Oper. Research, 1979

1977
Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness.
Math. Oper. Res., 1977

1974
A decomposition algorithm for shortest paths in a network with many strongly connected components.
Z. Oper. Research, 1974

1972
ℜ-Netzwerke und Matrixalgorithmen.
Computing, 1972


  Loading...