Peter Brucker

J. Sched., 2016

Polynomially solvable personnel rostering problems.

[BibT_eX]

[DOI]

Pieter Smet

Patrick De Causmaecker

Greet Vanden Berghe

Eur. J. Oper. Res., 2016

2014

Network flow models for intraday personnel scheduling problems.

[BibT_eX]

[DOI]

Rong Qu

Ann. Oper. Res., 2014

2013

A note on reverse scheduling with maximum lateness objective.

[BibT_eX]

[DOI]

Jinjiang Yuan

J. Sched., 2013

A note on "event-based MILP models for resource-constrained project scheduling problems".

[BibT_eX]

[DOI]

Comput. Oper. Res., 2013

2012

A mixed integer programming model for the cyclic job-shop problem with transportation.

[BibT_eX]

[DOI]

Edmund K. Burke

Sven Groenemeyer

Discret. Appl. Math., 2012

A branch and bound algorithm for the cyclic job-shop problem with transportation.

[BibT_eX]

[DOI]

Edmund K. Burke

Sven Groenemeyer

Comput. Oper. Res., 2012

A Car Rental Problem at the German Bundeswehr.

[BibT_eX]

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.

[BibT_eX]

[DOI]

J. Sched., 2011

Inverse scheduling: two-machine flow-shop problem.

[BibT_eX]

[DOI]

J. Sched., 2011

Personnel scheduling: Models and complexity.

[BibT_eX]

[DOI]

Rong Qu

Edmund K. Burke

Eur. J. Oper. Res., 2011

2010

A shift sequence based approach for nurse scheduling and a new benchmark dataset.

[BibT_eX]

[DOI]

J. Heuristics, 2010

2009

Job-shop Scheduling Problem.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Inverse scheduling with maximum lateness objective.

[BibT_eX]

[DOI]

J. Sched., 2009

On the Complexity of Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Introduction to Scheduling., 2009

2008

Scheduling jobs with equal processing times and time windows on identical parallel machines.

[BibT_eX]

[DOI]

J. Sched., 2008

A general model for cyclic machine scheduling problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Cyclic job shop scheduling problems with blocking.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2008

2007

The complexity of mean flow time scheduling problems with release times.

[BibT_eX]

[DOI]

Francis Sourd

J. Sched., 2007

Complexity of shop-scheduling problems with fixed number of jobs: a survey.

[BibT_eX]

[DOI]

Yuri N. Sotskov

Frank Werner

Math. Methods Oper. Res., 2007

2006

Job-shop scheduling with limited capacity buffers.

[BibT_eX]

[DOI]

OR Spectr., 2006

Scheduling chains with identical jobs and constant delays on a single machine.

[BibT_eX]

[DOI]

Ceyda Oguz

Math. Methods Oper. Res., 2006

Scheduling Equal Processing Time Jobs to Minimize the Weighted Number of Late Jobs.

[BibT_eX]

[DOI]

J. Math. Model. Algorithms, 2006

2005

Tabu Search Algorithms for Cyclic Machine Scheduling Problems.

[BibT_eX]

[DOI]

J. Sched., 2005

Complexity results for flow-shop problems with a single server.

[BibT_eX]

[DOI]

Guoqing Wang

Eur. J. Oper. Res., 2005

The algebraic Monge property and path problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Cyclic Scheduling Problems with Linear Precedences and Resource Constraints.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2005, 2005

Polynomial Algorithm for Parallel Machine Mean Flow Time Scheduling Problem with Release Dates.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2005

2004

Scheduling Equal Processing Time Jobs.

[BibT_eX]

[DOI]

Philippe Baptiste

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.

[BibT_eX]

[DOI]

T. C. Edwin Cheng

Ann. Oper. Res., 2004

Ten notes on equal-processing-time scheduling.

[BibT_eX]

[DOI]

4OR, 2004

Scheduling algorithms (4. ed.).

[BibT_eX]

Springer, ISBN: 978-3-540-20524-1, 2004

2003

Flow-shop problems with intermediate buffers.

[BibT_eX]

[DOI]

Silvia Heitmann

OR Spectr., 2003

How useful are preemptive schedules?

[BibT_eX]

[DOI]

Silvia Heitmann

Oper. Res. Lett., 2003

A polynomial algorithm for P | pj=1, rj, outtree | ∑ Cj.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2003

Routing of Railway Carriages.

[BibT_eX]

[DOI]

Thomas Rolfes

J. Glob. Optim., 2003

Lower bounds for resource-constrained project scheduling problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2003

Sequencing and scheduling.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2003

2002

Scheduling railway traffic at a construction site.

[BibT_eX]

[DOI]

Silvia Heitmann

OR Spectr., 2002

Scheduling and constraint propagation.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2002

Fast Algorithms with Algebraic Monge Properties.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2000

Scheduling UET task systems with concurrency on two parallel identical processors.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2000

A linear programming and constraint propagation-based lower bound for the RCPSP.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2000

Solving a chemical batch scheduling problem by local search.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2000

Resource-Constrained Project Scheduling and Timetabling.

[BibT_eX]

[DOI]

Proceedings of the Practice and Theory of Automated Timetabling III, 2000

1999

Preemptive job-shop scheduling problems with a fixed number of jobs.

[BibT_eX]

[DOI]

Yuri N. Sotskov

Math. Methods Oper. Res., 1999

Scheduling identical jobs with chain precedence constraints on two uniform machines.

[BibT_eX]

[DOI]

Wieslaw Kubiak

Math. Methods Oper. Res., 1999

Resource-constrained project scheduling: Notation, classification, models, and methods.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 1999

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

[BibT_eX]

[DOI]

Thomas Hilbig

Discret. Appl. Math., 1999

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

[BibT_eX]

[DOI]

Computing, 1999

1998

A branch and bound algorithm for the resource-constrained project scheduling problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 1998

Batch scheduling with deadlines on parallel machines.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1998

1997

Book reviews.

[BibT_eX]

[DOI]

Shmuel Onn

Robert Weismantel

Chandrasekharan Rajendran

Math. Methods Oper. Res., 1997

Book reviews.

[BibT_eX]

[DOI]

Kurt Marti

Joachim R. Daduna

Math. Methods Oper. Res., 1997

Improving Local Search Heuristics for some Scheduling Problems. Part II.

[BibT_eX]

[DOI]

Frank Werner

Discret. Appl. Math., 1997

A Branch & Bound Algorithm for the Open-shop Problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

Complexity of scheduling problems with multi-purpose machines.

[BibT_eX]

[DOI]

Andreas Krämer

Ann. Oper. Res., 1997

1996

Single machine batch scheduling to minimize the weighted number of late jobs.

[BibT_eX]

[DOI]

Mikhail Y. Kovalyov

Math. Methods Oper. Res., 1996

Improving Local Search Heuristics for Some Scheduling Problems-I.

[BibT_eX]

[DOI]

Frank Werner

Discret. Appl. Math., 1996

1995

Efficient Algorithms for Some Path Partitioning Problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

A Monge Property for the D-dimensional Transportation Problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

Shop scheduling problems with multiprocessor tasks on dedicated processors.

[BibT_eX]

[DOI]

Andreas Krämer

Ann. Oper. Res., 1995

1994

A Branch and Bound Algorithm for the Job-Shop Scheduling Problem.

[BibT_eX]

[DOI]

Bernd Sievers

Discret. Appl. Math., 1994

Thek-track assignment problem.

[BibT_eX]

[DOI]

L. Nordmann

Computing, 1994

The job-shop problem and immediate selection.

[BibT_eX]

[DOI]

Andreas Krämer

Ann. Oper. Res., 1994

1993

Scheduling unit time open shops to minimize the weighted number of late jobs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1993

Series parallel composition of greedy linear programming problems.

[BibT_eX]

[DOI]

Alan J. Hoffman

Math. Program., 1993

Open shop problems with unit time operations.

[BibT_eX]

[DOI]

Marion Jurisch

ZOR Methods Model. Oper. Res., 1993

Book review.

[BibT_eX]

[DOI]

ZOR Methods Model. Oper. Res., 1993

The Complexity of One-Machine Batching Problems.

[BibT_eX]

[DOI]

Susanne Albers

Discret. Appl. Math., 1993

1991

A characterization of network representable polymatroids.

[BibT_eX]

[DOI]

Matthias F. M. Stallmann

ZOR Methods Model. Oper. Res., 1991

Scheduling problems in connection with flexible production systems.

[BibT_eX]

[DOI]

Proceedings of the 1991 IEEE International Conference on Robotics and Automation, 1991

1990

Pattern scheduling.

[BibT_eX]

[DOI]

Ulrich Kathmann

ZOR Methods Model. Oper. Res., 1990

Job-shop scheduling with multi-purpose machines.

[BibT_eX]

[DOI]

Rainer Schlie

Computing, 1990

1989

AnO (n logn)-algorithm for solving a special class of linear programs.

[BibT_eX]

[DOI]

Computing, 1989

1988

Scheduling two irregular polygons.

[BibT_eX]

[DOI]

Wolfgang Meyer

Discret. Appl. Math., 1988

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

[BibT_eX]

[DOI]

Computing, 1988

1987

Book review.

[BibT_eX]

[DOI]

Z. Oper. Research, 1987

Approximation of a set of points by points of a grid.

[BibT_eX]

[DOI]

Wolfgang Meyer

Computing, 1987

1986

A railway scheduling problem.

[BibT_eX]

[DOI]

Z. Oper. Research, 1986

Greedy concepts for network flow problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1986

1985

Book reviews.

[BibT_eX]

[DOI]

Z. Oper. Research, 1985

An out-of-kilter method for the algebraic circulation problem.

[BibT_eX]

[DOI]

W. Papenjohann

Discret. Appl. Math., 1985

Minimum cost flow algorithms for series-parallel networks.

[BibT_eX]

[DOI]

Arie Tamir

Discret. Appl. Math., 1985

1984

AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Networks, 1983

Buchbesprechungen.

[BibT_eX]

[DOI]

Götz Uebe

Z. Oper. Research, 1983

Book reviews.

[BibT_eX]

[DOI]

Franz Josef Radermacher

Z. Oper. Research, 1983

Buchbesprechungen.

[BibT_eX]

[DOI]

J. M. R. Verbon-Huisman

R. Abele

Lothar Streitferdt

Z. Oper. Research, 1983

Book reviews.

[BibT_eX]

[DOI]

Wilhelm Hummeltenberg

Z. Oper. Research, 1983

Book reviews.

[BibT_eX]

[DOI]

Franz Josef Radermacher

Klaus-Peter Kistner

Volker Brandenburg

Götz Uebe

Z. Oper. Research, 1983

1982

Network Flows in Trees and Knapsack Problems with Nested Constraints.

[BibT_eX]

Proceedings of the 8th Conference Graphtheoretic Concepts in Computer Science (WG '82), 1982

1981

Buchbesprechungen.

[BibT_eX]

[DOI]

Z. Oper. Research, 1981

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

[BibT_eX]

[DOI]

Computing, 1981

1980

Book reviews.

[BibT_eX]

[DOI]

Hans-Jürgen Zimmermann

Z. Oper. Research, 1980

The Chinese Postman Problem for Mixed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graphtheoretic Concepts in Computer Science, 1980

1979

NP-Complete operations research problems and approximation algorithms.

[BibT_eX]

[DOI]

Z. Oper. Research, 1979

1977

Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness.

[BibT_eX]

[DOI]

Michael R. Garey

David S. Johnson

Math. Oper. Res., 1977

1974

A decomposition algorithm for shortest paths in a network with many strongly connected components.

[BibT_eX]

[DOI]

Z. Oper. Research, 1974

1972

ℜ-Netzwerke und Matrixalgorithmen.

[BibT_eX]

[DOI]