Complexity of machine scheduling problems. Zbl 0353.68067
Lenstra, J. K.; Rinnooy Kan, A. H. G.; Brucker, P. |
|
1977
|
Resource-constrained project scheduling: Notation, classification, models, and methods. Zbl 0937.90030
Brucker, Peter; Drexl, Andreas; Möhring, Rolf; Neumann, Klaus; Pesch, Erwin |
|
1999
|
Scheduling algorithms.
5th ed. Zbl 1126.90001
Brucker, Peter |
|
2007
|
Scheduling a batching machine. Zbl 0909.90172
Brucker, Peter; Gladky, Andrei; Hoogeveen, Han; Kovalyov, Mikhail Y.; Potts, Chris N.; Tautenhahn, Thomas; van de Velde, Steef L. |
|
1998
|
Complexity of machine scheduling problems. Zbl 0301.90025
Brucker, P.; Lenstra, J. K.; Rinnooy Kan, A. H. G. |
|
1975
|
Scheduling algorithms.
3rd ed. Zbl 1051.90011
Brucker, Peter |
|
2001
|
A branch and bound algorithm for the job-shop scheduling problem. Zbl 0802.90057
Brucker, Peter; Jurisch, Bernd; Sievers, Bernd |
|
1994
|
An O(n) algorithm for quadratic knapsack problems. Zbl 0544.90086
Brucker, Peter |
|
1984
|
Scheduling algorithms.
4th edition. Zbl 1060.90034
Brucker, Peter |
|
2004
|
The complexity of one-machine batching problems. Zbl 0792.90035
Albers, Susanne; Brucker, Peter |
|
1993
|
Job-shop scheduling with multi-purpose machines. Zbl 0813.90058
Brucker, P.; Schlie, R. |
|
1990
|
A branch and bound algorithm for the resource-constrained project scheduling problem. Zbl 0970.90030
Brucker, Peter; Knust, Sigrid; Schoo, Arno; Thiele, Olaf |
|
1998
|
Scheduling algorithms.
2nd rev. a. enl. ed. Zbl 0914.90157
Brucker, Peter |
|
1998
|
Scheduling algorithms. Zbl 0839.90059
Brucker, Peter |
|
1995
|
Complexity results for single-machine problems with positive finish-start time-lags. Zbl 0946.90026
Brucker, P.; Knust, S. |
|
1999
|
On the complexity of clustering problems. Zbl 0397.68044
Brucker, P. |
|
1978
|
A branch \(\&\) bound algorithm for the open-shop problem. Zbl 0882.90066
Brucker, Peter; Hurink, Johann; Jurisch, Bernd; Wöstmann, Birgit |
|
1997
|
Personnel scheduling: models and complexity. Zbl 1213.90151
Brucker, Peter; Qu, Rong; Burke, Edmund |
|
2011
|
Complexity results for parallel machine problems with a single server. Zbl 1040.90016
Brucker, Peter; Dhaenens-Flipo, Clarisse; Knust, Sigrid; Kravchenko, Svetlana A.; Werner, Frank |
|
2002
|
An efficient algorithm for the job-shop problem with two jobs. Zbl 0654.90036
Brucker, P. |
|
1988
|
Complex scheduling. Zbl 1154.90002
Brucker, Peter; Knust, Sigrid |
|
2006
|
A linear programming and constraint propagation-based lower bound for the RCPSP. Zbl 0990.90055
Brucker, Peter; Knust, Sigrid |
|
2000
|
Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time. Zbl 1070.90041
Baptiste, Philippe; Brucker, Peter; Knust, Sigrid; Timkovsky, Vadim G. |
|
2004
|
Scheduling equal-length tasks under treelike precedence constraints to minimize maximum lateness. Zbl 0397.90044
Brucker, Peter; Garey, M. R.; Johnson, D. S. |
|
1977
|
Minimum cost flow algorithms for series-parallel networks. Zbl 0571.90019
Bein, Wolfgang W.; Brucker, Peter; Tamir, Arie |
|
1985
|
A Monge property for the \(d\)-dimensional transportation problem. Zbl 0833.90083
Bein, Wolfgang W.; Brucker, Peter; Park, James K.; Pathak, Pramod K. |
|
1995
|
Complexity of scheduling problems with multi-purpose machines. Zbl 0890.90089
Brucker, Peter; Jurisch, Bernd; Krämer, Andreas |
|
1997
|
Scheduling jobs with equal processing times and time windows on identical parallel machines. Zbl 1168.90426
Brucker, Peter; Kravchenko, Svetlana A. |
|
2008
|
A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times. Zbl 0852.90087
Brucker, Peter; Thiele, Olaf |
|
1996
|
Open shop problems with unit time operations. Zbl 0776.90033
Brucker, Peter; Jurisch, Bernd; Jurisch, Marion |
|
1993
|
Single machine batch scheduling to minimize the weighted number of late jobs. Zbl 0842.90058
Brucker, Peter; Kovalyov, Mikhail Y. |
|
1996
|
Complexity results for flow-shop and open-shop scheduling problems with transportation delays. Zbl 1056.90057
Brucker, Peter; Knust, Sigrid; Cheng, T. C. Edwin; Shakhlevich, Natalia V. |
|
2004
|
Tabu search algorithms and lower bounds for the resource-constrained project scheduling problem. Zbl 1074.90563
Baar, Tonius; Brucker, Peter; Knust, Sigrid |
|
1999
|
Lower bounds for resource-constrained project scheduling problems. Zbl 1036.90038
Brucker, Peter; Knust, Sigrid |
|
2003
|
Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems. Zbl 0916.90144
Brucker, Peter; Krämer, Andreas |
|
1996
|
A shift sequence based approach for nurse scheduling and a new benchmark dataset. Zbl 1230.90121
Brucker, Peter; Burke, Edmund K.; Curtois, Tim; Qu, Rong; Vanden Berghe, Greet |
|
2010
|
The job-shop problem and immediate selection. Zbl 0826.90062
Brucker, Peter; Jurisch, Bernd; Krämer, Andreas |
|
1994
|
Flow-shop problems with intermediate buffers. Zbl 1042.90016
Brucker, Peter; Heitmann, Silvia; Hurink, Johann |
|
2003
|
The complexity of mean flow time scheduling problems with release times. Zbl 1154.90407
Baptiste, Philippe; Brucker, Peter; Chrobak, Marek; Dürr, Christoph; Kravchenko, Svetlana A.; Sourd, Francis |
|
2007
|
A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags. Zbl 0932.68006
Brucker, Peter; Hilbig, Thomas; Hurink, Johann |
|
1999
|
Complexity results for flow-shop problems with a single server. Zbl 1066.90024
Brucker, Peter; Knust, Sigrid; Wang, Guoqing |
|
2005
|
Tabu-search for the multi-mode job-shop problem. Zbl 0897.90122
Brucker, Peter; Neyer, Jürgen |
|
1998
|
Cyclic job shop scheduling problems with blocking. Zbl 1151.90397
Brucker, Peter; Kampmeyer, Thomas |
|
2008
|
Improving local search heuristics for some scheduling problems. II. Zbl 0872.90045
Brucker, Peter; Hurink, Johann; Werner, Frank |
|
1997
|
Scheduling and constraint propagation. Zbl 1018.90013
Brucker, Peter |
|
2002
|
Batch scheduling with deadlines on parallel machines. Zbl 0913.90160
Brucker, Peter; Kovalyov, Mikhail Y.; Shafransky, Yakov M.; Werner, Frank |
|
1998
|
A general model for cyclic machine scheduling problems. Zbl 1152.90430
Brucker, Peter; Kampmeyer, Thomas |
|
2008
|
Complexity of shop-scheduling problems with fixed number of jobs: a survey. Zbl 1180.90115
Brucker, Peter; Sotskov, Yu N.; Werner, Frank |
|
2007
|
Shop scheduling problems with multiprocessor tasks on dedicated processors. Zbl 0831.90071
Brucker, Peter; Krämer, Andreas |
|
1995
|
How useful are preemptive schedules? Zbl 1041.90015
Brucker, Peter; Heitmann, Silvia; Hurink, Johann |
|
2003
|
Tabu search algorithms for cyclic machine scheduling problems. Zbl 1123.90018
Brucker, Peter; Kampmeyer, Thomas |
|
2005
|
A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\). Zbl 1064.90016
Brucker, Peter; Hurink, Johann; Knust, Sigrid |
|
2002
|
Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments. Zbl 0979.90053
Brinkkötter, Wolfgang; Brucker, Peter |
|
2001
|
Cyclic schedules for r irregularity occurring events. Zbl 0718.90043
Brucker, Peter; Burkard, Rainer E.; Hurink, Johann |
|
1990
|
The \(k\)-track assignment problem. Zbl 0822.90080
Brucker, P.; Nordmann, L. |
|
1994
|
Polynomially solvable personnel rostering problems. Zbl 1346.90474
Smet, Pieter; Brucker, Peter; De Causmaecker, Patrick; Vanden Berghe, Greet |
|
2016
|
Inverse scheduling with maximum lateness objective. Zbl 1176.90195
Brucker, Peter; Shakhlevich, Natalia V. |
|
2009
|
Job-shop scheduling with limited capacity buffers. Zbl 1101.90029
Brucker, Peter; Heitmann, Silvia; Hurink, Johann; Nieberg, Tim |
|
2006
|
A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs. Zbl 0807.90061
Brucker, Peter |
|
1994
|
Scheduling UET task systems with concurrency on two parallel identical processors. Zbl 1023.90023
Brucker, Peter; Knust, Sigrid; Roper, Duncan; Zinder, Yakov |
|
2000
|
Improving local search heuristics for some scheduling problems. I. Zbl 0846.90046
Brucker, Peter; Hurink, Johann; Werner, Frank |
|
1996
|
Resource-constrained project scheduling and timetabling. Zbl 0982.68746
Brucker, Peter; Knust, Sigrid |
|
2001
|
Scheduling railway traffic at a construction site. Zbl 1007.90022
Brucker, Peter; Heitmann, Silvia; Knust, Sigrid |
|
2002
|
Minimizing maximum lateness in a two-machine unit-time job shop. Zbl 0456.68042
Brucker, P. |
|
1981
|
Preemptive job-shop scheduling problems with a fixed number of jobs. Zbl 0948.90064
Brucker, Peter; Kravchenko, Svetlana A.; Sotskov, Yuri N. |
|
1999
|
The Chinese postman problem for mixed graphs. Zbl 0463.05049
Brucker, Peter |
|
1981
|
Scheduling equal processing time jobs to minimize the weighted number of late jobs. Zbl 1126.90019
Brucker, Peter; Kravchenko, Svetlana A. |
|
2006
|
A new lower bound for the job-shop scheduling problem. Zbl 0778.90022
Brucker, Peter; Jurisch, Bernd |
|
1993
|
Routing of railway carriages. Zbl 1033.90034
Brucker, Peter; Hurink, Johann; Rolfes, Thomas |
|
2003
|
Scheduling identical jobs with chain precedence constraints on two uniform machines. Zbl 0941.90019
Brucker, Peter; Hurink, Johann; Kubiak, Wieslaw |
|
1999
|
k-optimal solution sets for some polynomially solvable scheduling problems. Zbl 0673.90060
Brucker, Peter J.; Hamacher, Horst W. |
|
1989
|
Scheduling unit time open shops to minimize the weighted number of late jobs. Zbl 0793.90028
Brucker, Peter; Jurisch, Bernd; Tautenhahn, Thomas; Werner, Frank |
|
1993
|
On the complexity of two machine job-shop scheduling with regular objective functions. Zbl 0892.90097
Brucker, Peter; Kravchenko, Svetlana A.; Sotskov, Yuri N. |
|
1997
|
Series parallel composition of greedy linear programming problem. Zbl 0801.90076
Bein, Wolfgang W.; Brucker, Peter; Hoffman, Alan J. |
|
1993
|
A new tabu search procedure for an audit-scheduling problem. Zbl 0941.90033
Brucker, Peter; Schumacher, Doris |
|
1999
|
A note on “Event-based MILP models for resource-constrained project scheduling problems”. Zbl 1349.90311
Artigues, Christian; Brucker, Peter; Knust, Sigrid; Koné, Oumar; Lopez, Pierre; Mongeau, Marcel |
|
2013
|
Solving a chemical batch scheduling problem by local search. Zbl 0997.90034
Brucker, Peter; Hurink, Johann |
|
2000
|
A railway scheduling problem. Zbl 0617.90046
Brucker, P.; Hurink, J. |
|
1986
|
Scheduling two irregular polygons. Zbl 0647.90042
Brucker, Peter; Meyer, Wolfgang |
|
1988
|
Diskrete parametrische Optimierungsprobleme und wesentliche effiziente Punkte. Zbl 0251.90032
Brucker, P. |
|
1972
|
Inverse scheduling: Two-machine flow-shop problem. Zbl 1222.90013
Brucker, Peter; Shakhlevich, Natalia V. |
|
2011
|
Greedy concepts for network flow problems. Zbl 0617.90027
Bein, Wolfgang W.; Brucker, Peter |
|
1986
|
Lower bounds for scheduling a single robot in a job-shop environment. Zbl 1020.90023
Brucker, Peter; Knust, Sigrid |
|
2002
|
A linear time algorithm to minimize maximum lateness for the two-machine, unit-time, job-shop, scheduling problem. Zbl 0483.90052
Brucker, P. |
|
1982
|
Networks flows in trees and knapsack problems with nested constraints. Zbl 0534.90032
Brucker, P. |
|
1982
|
Verbände stetiger Funktionen und kettenwertige Homomorphismen. Zbl 0185.03502
Brucker, P. |
|
1971
|
A branch and bound algorithm for the cyclic job-shop problem with transportation. Zbl 1349.90321
Brucker, Peter; Burke, Edmund K.; Groenemeyer, Sven |
|
2012
|
A mixed integer programming model for the cyclic job-shop problem with transportation. Zbl 1247.90153
Brucker, Peter; Burke, Edmund K.; Groenemeyer, Sven |
|
2012
|
Die Erstellung von CPM-Netzplänen. Zbl 0309.90019
Brucker, P. |
|
1974
|
A polynomial-time algorithm for a flow-shop batching problem with equal-length operations. Zbl 1230.90087
Brucker, Peter; Shakhlevich, Natalia V. |
|
2011
|
Scheduling chains with identical jobs and constant delays on a single machine. Zbl 1103.90040
Brucker, Peter; Knust, Sigrid; Oğuz, Ceyda |
|
2006
|
Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines. Zbl 1386.90046
Brucker, Peter; Shakhlevich, Natalia V. |
|
2016
|
Scheduling. Zbl 0474.68052
Brucker, Peter |
|
1981
|
The algebraic Monge property and path problems. Zbl 1087.90060
Bein, Wolfgang; Brucker, Peter; Larmore, Lawrence L.; Park, James K. |
|
2005
|
An 0(n)-algorithm for LP-knapsacks with a fixed number of GUB constraints. Zbl 0529.90072
Brucker, P. |
|
1984
|
An O(nlogn)-algorithm for the minimum cost flow problem in trees. Zbl 0543.90036
Brucker, Peter |
|
1984
|
Eine Charakterisierung \(K\)-kompakter topologischer Räume. Zbl 0207.52801
Brucker, P. |
|
1971
|
\({\mathfrak R}\)-Netzwerke und Matrixalgorithmen. Zbl 0255.90068
Brucker, P. |
|
1972
|
Anmerkungen zu heuristischen Verfahren. Zbl 0392.90060
Brucker, P. |
|
1976
|
NP-complete operations research problems and approximation algorithms. Zbl 0402.90070
Brucker, P. |
|
1979
|
On the complexity of scheduling. Zbl 1398.68065
Brucker, Peter; Knust, Sigrid |
|
2017
|
Polynomially solvable personnel rostering problems. Zbl 1346.90474
Smet, Pieter; Brucker, Peter; De Causmaecker, Patrick; Vanden Berghe, Greet |
|
2016
|
Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines. Zbl 1386.90046
Brucker, Peter; Shakhlevich, Natalia V. |
|
2016
|
Network flow models for intraday personnel scheduling problems. Zbl 1301.90029
Brucker, Peter; Qu, Rong |
|
2014
|
A note on “Event-based MILP models for resource-constrained project scheduling problems”. Zbl 1349.90311
Artigues, Christian; Brucker, Peter; Knust, Sigrid; Koné, Oumar; Lopez, Pierre; Mongeau, Marcel |
|
2013
|
A branch and bound algorithm for the cyclic job-shop problem with transportation. Zbl 1349.90321
Brucker, Peter; Burke, Edmund K.; Groenemeyer, Sven |
|
2012
|
A mixed integer programming model for the cyclic job-shop problem with transportation. Zbl 1247.90153
Brucker, Peter; Burke, Edmund K.; Groenemeyer, Sven |
|
2012
|
Personnel scheduling: models and complexity. Zbl 1213.90151
Brucker, Peter; Qu, Rong; Burke, Edmund |
|
2011
|
Inverse scheduling: Two-machine flow-shop problem. Zbl 1222.90013
Brucker, Peter; Shakhlevich, Natalia V. |
|
2011
|
A polynomial-time algorithm for a flow-shop batching problem with equal-length operations. Zbl 1230.90087
Brucker, Peter; Shakhlevich, Natalia V. |
|
2011
|
A shift sequence based approach for nurse scheduling and a new benchmark dataset. Zbl 1230.90121
Brucker, Peter; Burke, Edmund K.; Curtois, Tim; Qu, Rong; Vanden Berghe, Greet |
|
2010
|
Inverse scheduling with maximum lateness objective. Zbl 1176.90195
Brucker, Peter; Shakhlevich, Natalia V. |
|
2009
|
Scheduling jobs with equal processing times and time windows on identical parallel machines. Zbl 1168.90426
Brucker, Peter; Kravchenko, Svetlana A. |
|
2008
|
Cyclic job shop scheduling problems with blocking. Zbl 1151.90397
Brucker, Peter; Kampmeyer, Thomas |
|
2008
|
A general model for cyclic machine scheduling problems. Zbl 1152.90430
Brucker, Peter; Kampmeyer, Thomas |
|
2008
|
Scheduling algorithms.
5th ed. Zbl 1126.90001
Brucker, Peter |
|
2007
|
The complexity of mean flow time scheduling problems with release times. Zbl 1154.90407
Baptiste, Philippe; Brucker, Peter; Chrobak, Marek; Dürr, Christoph; Kravchenko, Svetlana A.; Sourd, Francis |
|
2007
|
Complexity of shop-scheduling problems with fixed number of jobs: a survey. Zbl 1180.90115
Brucker, Peter; Sotskov, Yu N.; Werner, Frank |
|
2007
|
Complex scheduling. Zbl 1154.90002
Brucker, Peter; Knust, Sigrid |
|
2006
|
Job-shop scheduling with limited capacity buffers. Zbl 1101.90029
Brucker, Peter; Heitmann, Silvia; Hurink, Johann; Nieberg, Tim |
|
2006
|
Scheduling equal processing time jobs to minimize the weighted number of late jobs. Zbl 1126.90019
Brucker, Peter; Kravchenko, Svetlana A. |
|
2006
|
Scheduling chains with identical jobs and constant delays on a single machine. Zbl 1103.90040
Brucker, Peter; Knust, Sigrid; Oğuz, Ceyda |
|
2006
|
Complexity results for flow-shop problems with a single server. Zbl 1066.90024
Brucker, Peter; Knust, Sigrid; Wang, Guoqing |
|
2005
|
Tabu search algorithms for cyclic machine scheduling problems. Zbl 1123.90018
Brucker, Peter; Kampmeyer, Thomas |
|
2005
|
The algebraic Monge property and path problems. Zbl 1087.90060
Bein, Wolfgang; Brucker, Peter; Larmore, Lawrence L.; Park, James K. |
|
2005
|
Scheduling algorithms.
4th edition. Zbl 1060.90034
Brucker, Peter |
|
2004
|
Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time. Zbl 1070.90041
Baptiste, Philippe; Brucker, Peter; Knust, Sigrid; Timkovsky, Vadim G. |
|
2004
|
Complexity results for flow-shop and open-shop scheduling problems with transportation delays. Zbl 1056.90057
Brucker, Peter; Knust, Sigrid; Cheng, T. C. Edwin; Shakhlevich, Natalia V. |
|
2004
|
Lower bounds for resource-constrained project scheduling problems. Zbl 1036.90038
Brucker, Peter; Knust, Sigrid |
|
2003
|
Flow-shop problems with intermediate buffers. Zbl 1042.90016
Brucker, Peter; Heitmann, Silvia; Hurink, Johann |
|
2003
|
How useful are preemptive schedules? Zbl 1041.90015
Brucker, Peter; Heitmann, Silvia; Hurink, Johann |
|
2003
|
Routing of railway carriages. Zbl 1033.90034
Brucker, Peter; Hurink, Johann; Rolfes, Thomas |
|
2003
|
Complexity results for parallel machine problems with a single server. Zbl 1040.90016
Brucker, Peter; Dhaenens-Flipo, Clarisse; Knust, Sigrid; Kravchenko, Svetlana A.; Werner, Frank |
|
2002
|
Scheduling and constraint propagation. Zbl 1018.90013
Brucker, Peter |
|
2002
|
A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\). Zbl 1064.90016
Brucker, Peter; Hurink, Johann; Knust, Sigrid |
|
2002
|
Scheduling railway traffic at a construction site. Zbl 1007.90022
Brucker, Peter; Heitmann, Silvia; Knust, Sigrid |
|
2002
|
Lower bounds for scheduling a single robot in a job-shop environment. Zbl 1020.90023
Brucker, Peter; Knust, Sigrid |
|
2002
|
Scheduling algorithms.
3rd ed. Zbl 1051.90011
Brucker, Peter |
|
2001
|
Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments. Zbl 0979.90053
Brinkkötter, Wolfgang; Brucker, Peter |
|
2001
|
Resource-constrained project scheduling and timetabling. Zbl 0982.68746
Brucker, Peter; Knust, Sigrid |
|
2001
|
A linear programming and constraint propagation-based lower bound for the RCPSP. Zbl 0990.90055
Brucker, Peter; Knust, Sigrid |
|
2000
|
Scheduling UET task systems with concurrency on two parallel identical processors. Zbl 1023.90023
Brucker, Peter; Knust, Sigrid; Roper, Duncan; Zinder, Yakov |
|
2000
|
Solving a chemical batch scheduling problem by local search. Zbl 0997.90034
Brucker, Peter; Hurink, Johann |
|
2000
|
Resource-constrained project scheduling: Notation, classification, models, and methods. Zbl 0937.90030
Brucker, Peter; Drexl, Andreas; Möhring, Rolf; Neumann, Klaus; Pesch, Erwin |
|
1999
|
Complexity results for single-machine problems with positive finish-start time-lags. Zbl 0946.90026
Brucker, P.; Knust, S. |
|
1999
|
Tabu search algorithms and lower bounds for the resource-constrained project scheduling problem. Zbl 1074.90563
Baar, Tonius; Brucker, Peter; Knust, Sigrid |
|
1999
|
A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags. Zbl 0932.68006
Brucker, Peter; Hilbig, Thomas; Hurink, Johann |
|
1999
|
Preemptive job-shop scheduling problems with a fixed number of jobs. Zbl 0948.90064
Brucker, Peter; Kravchenko, Svetlana A.; Sotskov, Yuri N. |
|
1999
|
Scheduling identical jobs with chain precedence constraints on two uniform machines. Zbl 0941.90019
Brucker, Peter; Hurink, Johann; Kubiak, Wieslaw |
|
1999
|
A new tabu search procedure for an audit-scheduling problem. Zbl 0941.90033
Brucker, Peter; Schumacher, Doris |
|
1999
|
Scheduling a batching machine. Zbl 0909.90172
Brucker, Peter; Gladky, Andrei; Hoogeveen, Han; Kovalyov, Mikhail Y.; Potts, Chris N.; Tautenhahn, Thomas; van de Velde, Steef L. |
|
1998
|
A branch and bound algorithm for the resource-constrained project scheduling problem. Zbl 0970.90030
Brucker, Peter; Knust, Sigrid; Schoo, Arno; Thiele, Olaf |
|
1998
|
Scheduling algorithms.
2nd rev. a. enl. ed. Zbl 0914.90157
Brucker, Peter |
|
1998
|
Tabu-search for the multi-mode job-shop problem. Zbl 0897.90122
Brucker, Peter; Neyer, Jürgen |
|
1998
|
Batch scheduling with deadlines on parallel machines. Zbl 0913.90160
Brucker, Peter; Kovalyov, Mikhail Y.; Shafransky, Yakov M.; Werner, Frank |
|
1998
|
A branch \(\&\) bound algorithm for the open-shop problem. Zbl 0882.90066
Brucker, Peter; Hurink, Johann; Jurisch, Bernd; Wöstmann, Birgit |
|
1997
|
Complexity of scheduling problems with multi-purpose machines. Zbl 0890.90089
Brucker, Peter; Jurisch, Bernd; Krämer, Andreas |
|
1997
|
Improving local search heuristics for some scheduling problems. II. Zbl 0872.90045
Brucker, Peter; Hurink, Johann; Werner, Frank |
|
1997
|
On the complexity of two machine job-shop scheduling with regular objective functions. Zbl 0892.90097
Brucker, Peter; Kravchenko, Svetlana A.; Sotskov, Yuri N. |
|
1997
|
A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times. Zbl 0852.90087
Brucker, Peter; Thiele, Olaf |
|
1996
|
Single machine batch scheduling to minimize the weighted number of late jobs. Zbl 0842.90058
Brucker, Peter; Kovalyov, Mikhail Y. |
|
1996
|
Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems. Zbl 0916.90144
Brucker, Peter; Krämer, Andreas |
|
1996
|
Improving local search heuristics for some scheduling problems. I. Zbl 0846.90046
Brucker, Peter; Hurink, Johann; Werner, Frank |
|
1996
|
Complex sequencing problems and local search heuristics. Zbl 0877.90040
Brucker, Peter; Hurink, Johann |
|
1996
|
Scheduling algorithms. Zbl 0839.90059
Brucker, Peter |
|
1995
|
A Monge property for the \(d\)-dimensional transportation problem. Zbl 0833.90083
Bein, Wolfgang W.; Brucker, Peter; Park, James K.; Pathak, Pramod K. |
|
1995
|
Shop scheduling problems with multiprocessor tasks on dedicated processors. Zbl 0831.90071
Brucker, Peter; Krämer, Andreas |
|
1995
|
Papers presented at the workshop on discrete algorithms, University of Osnabrück, Germany, July 10-12, 1991. Zbl 0816.00039
|
|
1995
|
A branch and bound algorithm for the job-shop scheduling problem. Zbl 0802.90057
Brucker, Peter; Jurisch, Bernd; Sievers, Bernd |
|
1994
|
The job-shop problem and immediate selection. Zbl 0826.90062
Brucker, Peter; Jurisch, Bernd; Krämer, Andreas |
|
1994
|
The \(k\)-track assignment problem. Zbl 0822.90080
Brucker, P.; Nordmann, L. |
|
1994
|
A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs. Zbl 0807.90061
Brucker, Peter |
|
1994
|
The complexity of one-machine batching problems. Zbl 0792.90035
Albers, Susanne; Brucker, Peter |
|
1993
|
Open shop problems with unit time operations. Zbl 0776.90033
Brucker, Peter; Jurisch, Bernd; Jurisch, Marion |
|
1993
|
A new lower bound for the job-shop scheduling problem. Zbl 0778.90022
Brucker, Peter; Jurisch, Bernd |
|
1993
|
Scheduling unit time open shops to minimize the weighted number of late jobs. Zbl 0793.90028
Brucker, Peter; Jurisch, Bernd; Tautenhahn, Thomas; Werner, Frank |
|
1993
|
Series parallel composition of greedy linear programming problem. Zbl 0801.90076
Bein, Wolfgang W.; Brucker, Peter; Hoffman, Alan J. |
|
1993
|
A characterization of network representable polymatroids. Zbl 0724.90023
Bein, W. W.; Brucker, P.; Stallmann, M. F. M. |
|
1991
|
Job-shop scheduling with multi-purpose machines. Zbl 0813.90058
Brucker, P.; Schlie, R. |
|
1990
|
Cyclic schedules for r irregularity occurring events. Zbl 0718.90043
Brucker, Peter; Burkard, Rainer E.; Hurink, Johann |
|
1990
|
k-optimal solution sets for some polynomially solvable scheduling problems. Zbl 0673.90060
Brucker, Peter J.; Hamacher, Horst W. |
|
1989
|
An efficient algorithm for the job-shop problem with two jobs. Zbl 0654.90036
Brucker, P. |
|
1988
|
Scheduling two irregular polygons. Zbl 0647.90042
Brucker, Peter; Meyer, Wolfgang |
|
1988
|
Approximation of a set of points by points of a grid. Zbl 0641.65019
Brucker, P.; Meyer, W. |
|
1987
|
A railway scheduling problem. Zbl 0617.90046
Brucker, P.; Hurink, J. |
|
1986
|
Greedy concepts for network flow problems. Zbl 0617.90027
Bein, Wolfgang W.; Brucker, Peter |
|
1986
|
Minimum cost flow algorithms for series-parallel networks. Zbl 0571.90019
Bein, Wolfgang W.; Brucker, Peter; Tamir, Arie |
|
1985
|
An out-of-kilter method for the algebraic circulation problem. Zbl 0562.90023
Brucker, P.; Papenjohann, W. |
|
1985
|
An O(n) algorithm for quadratic knapsack problems. Zbl 0544.90086
Brucker, Peter |
|
1984
|
An 0(n)-algorithm for LP-knapsacks with a fixed number of GUB constraints. Zbl 0529.90072
Brucker, P. |
|
1984
|
An O(nlogn)-algorithm for the minimum cost flow problem in trees. Zbl 0543.90036
Brucker, Peter |
|
1984
|
A dual optimality criterion for algebraic linear programs. Zbl 0566.90094
Brucker, P.; Papenjohann, W.; Zimmermann, U. |
|
1984
|
Complexity results for shop problems. Zbl 0541.90053
Brucker, Peter |
|
1984
|
A linear time algorithm to minimize maximum lateness for the two-machine, unit-time, job-shop, scheduling problem. Zbl 0483.90052
Brucker, P. |
|
1982
|
Networks flows in trees and knapsack problems with nested constraints. Zbl 0534.90032
Brucker, P. |
|
1982
|
Minimizing maximum lateness in a two-machine unit-time job shop. Zbl 0456.68042
Brucker, P. |
|
1981
|
The Chinese postman problem for mixed graphs. Zbl 0463.05049
Brucker, Peter |
|
1981
|
Scheduling. Zbl 0474.68052
Brucker, Peter |
|
1981
|
NP-complete operations research problems and approximation algorithms. Zbl 0402.90070
Brucker, P. |
|
1979
|
On the complexity of clustering problems. Zbl 0397.68044
Brucker, P. |
|
1978
|
| ...and 14 more Documents |
