Brucker, Peter; Shakhlevich, Natalia V. Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines. (English) Zbl 1386.90046 J. Sched. 19, No. 6, 659-685 (2016). MSC: 90B35 68M20 90C46 PDFBibTeX XMLCite \textit{P. Brucker} and \textit{N. V. Shakhlevich}, J. Sched. 19, No. 6, 659--685 (2016; Zbl 1386.90046) Full Text: DOI
Brucker, Peter; Qu, Rong Network flow models for intraday personnel scheduling problems. (English) Zbl 1301.90029 Ann. Oper. Res. 218, 107-114 (2014). MSC: 90B35 90B80 90B10 PDFBibTeX XMLCite \textit{P. Brucker} and \textit{R. Qu}, Ann. Oper. Res. 218, 107--114 (2014; Zbl 1301.90029) Full Text: DOI Link
Brucker, Peter; Burke, Edmund K.; Groenemeyer, Sven A branch and bound algorithm for the cyclic job-shop problem with transportation. (English) Zbl 1349.90321 Comput. Oper. Res. 39, No. 12, 3200-3214 (2012). MSC: 90B35 90C57 PDFBibTeX XMLCite \textit{P. Brucker} et al., Comput. Oper. Res. 39, No. 12, 3200--3214 (2012; Zbl 1349.90321) Full Text: DOI
Brucker, Peter; Burke, Edmund K.; Groenemeyer, Sven A mixed integer programming model for the cyclic job-shop problem with transportation. (English) Zbl 1247.90153 Discrete Appl. Math. 160, No. 13-14, 1924-1935 (2012). MSC: 90B35 90C10 PDFBibTeX XMLCite \textit{P. Brucker} et al., Discrete Appl. Math. 160, No. 13--14, 1924--1935 (2012; Zbl 1247.90153) Full Text: DOI
Brucker, Peter; Shakhlevich, Natalia V. Inverse scheduling: Two-machine flow-shop problem. (English) Zbl 1222.90013 J. Sched. 14, No. 3, 239-256 (2011). MSC: 90B35 90C46 PDFBibTeX XMLCite \textit{P. Brucker} and \textit{N. V. Shakhlevich}, J. Sched. 14, No. 3, 239--256 (2011; Zbl 1222.90013) Full Text: DOI Link
Brucker, Peter; Qu, Rong; Burke, Edmund Personnel scheduling: models and complexity. (English) Zbl 1213.90151 Eur. J. Oper. Res. 210, No. 3, 467-473 (2011). MSC: 90B70 90B35 PDFBibTeX XMLCite \textit{P. Brucker} et al., Eur. J. Oper. Res. 210, No. 3, 467--473 (2011; Zbl 1213.90151) Full Text: DOI
Brucker, Peter; Burke, Edmund K.; Curtois, Tim; Qu, Rong; Vanden Berghe, Greet A shift sequence based approach for nurse scheduling and a new benchmark dataset. (English) Zbl 1230.90121 J. Heuristics 16, No. 4, 559-573 (2010). MSC: 90B70 90C59 PDFBibTeX XMLCite \textit{P. Brucker} et al., J. Heuristics 16, No. 4, 559--573 (2010; Zbl 1230.90121) Full Text: DOI Link
Brucker, Peter; Shakhlevich, Natalia V. Inverse scheduling with maximum lateness objective. (English) Zbl 1176.90195 J. Sched. 12, No. 5, 475-488 (2009). MSC: 90B35 PDFBibTeX XMLCite \textit{P. Brucker} and \textit{N. V. Shakhlevich}, J. Sched. 12, No. 5, 475--488 (2009; Zbl 1176.90195) Full Text: DOI Link
Brucker, Peter; Kampmeyer, Thomas A general model for cyclic machine scheduling problems. (English) Zbl 1152.90430 Discrete Appl. Math. 156, No. 13, 2561-2572 (2008). MSC: 90B35 PDFBibTeX XMLCite \textit{P. Brucker} and \textit{T. Kampmeyer}, Discrete Appl. Math. 156, No. 13, 2561--2572 (2008; Zbl 1152.90430) Full Text: DOI
Brucker, Peter; Kampmeyer, Thomas Cyclic job shop scheduling problems with blocking. (English) Zbl 1151.90397 Ann. Oper. Res. 159, 161-181 (2008). MSC: 90B35 PDFBibTeX XMLCite \textit{P. Brucker} and \textit{T. Kampmeyer}, Ann. Oper. Res. 159, 161--181 (2008; Zbl 1151.90397) Full Text: DOI
Brucker, Peter; Sotskov, Yu N.; Werner, Frank Complexity of shop-scheduling problems with fixed number of jobs: a survey. (English) Zbl 1180.90115 Math. Methods Oper. Res. 65, No. 3, 461-481 (2007). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{P. Brucker} et al., Math. Methods Oper. Res. 65, No. 3, 461--481 (2007; Zbl 1180.90115) Full Text: DOI
Baptiste, Philippe; Brucker, Peter; Chrobak, Marek; Dürr, Christoph; Kravchenko, Svetlana A.; Sourd, Francis The complexity of mean flow time scheduling problems with release times. (English) Zbl 1154.90407 J. Sched. 10, No. 2, 139-146 (2007). MSC: 90B35 PDFBibTeX XMLCite \textit{P. Baptiste} et al., J. Sched. 10, No. 2, 139--146 (2007; Zbl 1154.90407) Full Text: DOI
Brucker, Peter; Kampmeyer, Thomas Tabu search algorithms for cyclic machine scheduling problems. (English) Zbl 1123.90018 J. Sched. 8, No. 4, 303-322 (2005). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{P. Brucker} and \textit{T. Kampmeyer}, J. Sched. 8, No. 4, 303--322 (2005; Zbl 1123.90018) Full Text: DOI
Brucker, Peter; Drexl, Andreas; Möhring, Rolf; Neumann, Klaus; Pesch, Erwin Resource-constrained project scheduling: Notation, classification, models, and methods. (English) Zbl 0937.90030 Eur. J. Oper. Res. 112, No. 1, 3-41 (1999). MSC: 90B35 PDFBibTeX XMLCite \textit{P. Brucker} et al., Eur. J. Oper. Res. 112, No. 1, 3--41 (1999; Zbl 0937.90030) Full Text: DOI
Brucker, Peter; Schumacher, Doris A new tabu search procedure for an audit-scheduling problem. (English) Zbl 0941.90033 J. Sched. 2, No. 4, 157-173 (1999). MSC: 90B35 PDFBibTeX XMLCite \textit{P. Brucker} and \textit{D. Schumacher}, J. Sched. 2, No. 4, 157--173 (1999; Zbl 0941.90033) Full Text: DOI
Brucker, Peter; Hilbig, Thomas; Hurink, Johann A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags. (English) Zbl 0932.68006 Discrete Appl. Math. 94, No. 1-3, 77-99 (1999). MSC: 68M20 PDFBibTeX XMLCite \textit{P. Brucker} et al., Discrete Appl. Math. 94, No. 1--3, 77--99 (1999; Zbl 0932.68006) Full Text: DOI
Brucker, Peter; Knust, Sigrid; Schoo, Arno; Thiele, Olaf A branch and bound algorithm for the resource-constrained project scheduling problem. (English) Zbl 0970.90030 Eur. J. Oper. Res. 107, No. 2, 272-288 (1998). MSC: 90B35 90C57 PDFBibTeX XMLCite \textit{P. Brucker} et al., Eur. J. Oper. Res. 107, No. 2, 272--288 (1998; Zbl 0970.90030) Full Text: DOI
Brucker, Peter; Kovalyov, Mikhail Y.; Shafransky, Yakov M.; Werner, Frank Batch scheduling with deadlines on parallel machines. (English) Zbl 0913.90160 Ann. Oper. Res. 83, 23-40 (1998). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{P. Brucker} et al., Ann. Oper. Res. 83, 23--40 (1998; Zbl 0913.90160) Full Text: DOI
Brucker, Peter; Hurink, Johann; Werner, Frank Improving local search heuristics for some scheduling problems. II. (English) Zbl 0872.90045 Discrete Appl. Math. 72, No. 1-2, 47-69 (1997). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{P. Brucker} et al., Discrete Appl. Math. 72, No. 1--2, 47--69 (1997; Zbl 0872.90045) Full Text: DOI Link
Brucker, Peter; Hurink, Johann; Jurisch, Bernd; Wöstmann, Birgit A branch \(\&\) bound algorithm for the open-shop problem. (English) Zbl 0882.90066 Discrete Appl. Math. 76, No. 1-3, 43-59 (1997). MSC: 90B35 PDFBibTeX XMLCite \textit{P. Brucker} et al., Discrete Appl. Math. 76, No. 1--3, 43--59 (1997; Zbl 0882.90066) Full Text: DOI Link
Brucker, Peter; Thiele, Olaf A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times. (English) Zbl 0852.90087 OR Spektrum 18, No. 3, 145-161 (1996). MSC: 90B35 PDFBibTeX XMLCite \textit{P. Brucker} and \textit{O. Thiele}, OR Spektrum 18, No. 3, 145--161 (1996; Zbl 0852.90087) Full Text: DOI
Brucker, Peter; Hurink, Johann; Werner, Frank Improving local search heuristics for some scheduling problems. I. (English) Zbl 0846.90046 Discrete Appl. Math. 65, No. 1-3, 97-122 (1996). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{P. Brucker} et al., Discrete Appl. Math. 65, No. 1--3, 97--122 (1996; Zbl 0846.90046) Full Text: DOI
Brucker, Peter; Krämer, Andreas Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems. (English) Zbl 0916.90144 Eur. J. Oper. Res. 90, No. 2, 214-226 (1996). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{P. Brucker} and \textit{A. Krämer}, Eur. J. Oper. Res. 90, No. 2, 214--226 (1996; Zbl 0916.90144) Full Text: DOI
Brucker, Peter; Krämer, Andreas Shop scheduling problems with multiprocessor tasks on dedicated processors. (English) Zbl 0831.90071 Ann. Oper. Res. 57, 13-27 (1995). MSC: 90B35 PDFBibTeX XMLCite \textit{P. Brucker} and \textit{A. Krämer}, Ann. Oper. Res. 57, 13--27 (1995; Zbl 0831.90071) Full Text: DOI
Bein, Wolfgang W.; Brucker, Peter; Park, James K.; Pathak, Pramod K. A Monge property for the \(d\)-dimensional transportation problem. (English) Zbl 0833.90083 Discrete Appl. Math. 58, No. 2, 97-109 (1995). MSC: 90C08 90B06 PDFBibTeX XMLCite \textit{W. W. Bein} et al., Discrete Appl. Math. 58, No. 2, 97--109 (1995; Zbl 0833.90083) Full Text: DOI
Brucker, Peter; Jurisch, Bernd; Sievers, Bernd A branch and bound algorithm for the job-shop scheduling problem. (English) Zbl 0802.90057 Discrete Appl. Math. 49, No. 1-3, 107-127 (1994). Reviewer: R.Słowinski (Poznań) MSC: 90B35 90C60 68M20 90-08 PDFBibTeX XMLCite \textit{P. Brucker} et al., Discrete Appl. Math. 49, No. 1--3, 107--127 (1994; Zbl 0802.90057) Full Text: DOI
Brucker, Peter; Jurisch, Bernd; Tautenhahn, Thomas; Werner, Frank Scheduling unit time open shops to minimize the weighted number of late jobs. (English) Zbl 0793.90028 Oper. Res. Lett. 14, No. 5, 245-250 (1993). MSC: 90B35 90C39 90C60 PDFBibTeX XMLCite \textit{P. Brucker} et al., Oper. Res. Lett. 14, No. 5, 245--250 (1993; Zbl 0793.90028) Full Text: DOI
Albers, Susanne; Brucker, Peter The complexity of one-machine batching problems. (English) Zbl 0792.90035 Discrete Appl. Math. 47, No. 2, 87-107 (1993). MSC: 90B35 90C60 90C35 PDFBibTeX XMLCite \textit{S. Albers} and \textit{P. Brucker}, Discrete Appl. Math. 47, No. 2, 87--107 (1993; Zbl 0792.90035) Full Text: DOI
Brucker, Peter; Jurisch, Bernd A new lower bound for the job-shop scheduling problem. (English) Zbl 0778.90022 Eur. J. Oper. Res. 64, No. 2, 156-167 (1993). Reviewer: I.N.Lushchakova (Minsk) MSC: 90B35 PDFBibTeX XMLCite \textit{P. Brucker} and \textit{B. Jurisch}, Eur. J. Oper. Res. 64, No. 2, 156--167 (1993; Zbl 0778.90022) Full Text: DOI
Brucker, Peter; Jurisch, Bernd; Jurisch, Marion Open shop problems with unit time operations. (English) Zbl 0776.90033 Z. Oper. Res. 37, No. 1, 59-73 (1993). Reviewer: J.Błazewicz (Poznań) MSC: 90B35 PDFBibTeX XMLCite \textit{P. Brucker} et al., Z. Oper. Res. 37, No. 1, 59--73 (1993; Zbl 0776.90033) Full Text: DOI
Brucker, P.; Schlie, R. Job-shop scheduling with multi-purpose machines. (English) Zbl 0813.90058 Computing 45, No. 4, 369-375 (1990). MSC: 90B35 PDFBibTeX XMLCite \textit{P. Brucker} and \textit{R. Schlie}, Computing 45, No. 4, 369--375 (1990; Zbl 0813.90058) Full Text: DOI
Brucker, Peter J.; Hamacher, Horst W. k-optimal solution sets for some polynomially solvable scheduling problems. (English) Zbl 0673.90060 Eur. J. Oper. Res. 41, No. 2, 194-202 (1989). MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{P. J. Brucker} and \textit{H. W. Hamacher}, Eur. J. Oper. Res. 41, No. 2, 194--202 (1989; Zbl 0673.90060) Full Text: DOI
Brucker, P. An efficient algorithm for the job-shop problem with two jobs. (English) Zbl 0654.90036 Computing 40, No. 4, 353-359 (1988). MSC: 90B35 90C35 68Q25 PDFBibTeX XMLCite \textit{P. Brucker}, Computing 40, No. 4, 353--359 (1988; Zbl 0654.90036) Full Text: DOI
Bein, Wolfgang W.; Brucker, Peter Greedy concepts for network flow problems. (English) Zbl 0617.90027 Discrete Appl. Math. 15, 135-144 (1986). Reviewer: E.Ciurea MSC: 90B10 05C35 PDFBibTeX XMLCite \textit{W. W. Bein} and \textit{P. Brucker}, Discrete Appl. Math. 15, 135--144 (1986; Zbl 0617.90027) Full Text: DOI
Brucker, P. An 0(n)-algorithm for LP-knapsacks with a fixed number of GUB constraints. (English) Zbl 0529.90072 Z. Oper. Res., Ser. A 28, 29-40 (1984). MSC: 90C10 68Q25 90C05 PDFBibTeX XMLCite \textit{P. Brucker}, Z. Oper. Res., Ser. A 28, 29--40 (1984; Zbl 0529.90072) Full Text: DOI
Brucker, P. NP-complete operations research problems and approximation algorithms. (English) Zbl 0402.90070 Z. Oper. Res., Ser. A 23, 73-94 (1979). MSC: 90C10 90-02 68Q25 PDFBibTeX XMLCite \textit{P. Brucker}, Z. Oper. Res., Ser. A 23, 73--94 (1979; Zbl 0402.90070) Full Text: DOI
Brucker, P. A decomposition algorithm for shortest paths in a network with many strongly connected components. (English) Zbl 0285.90077 Z. Oper. Res., Ser. A 18, 177-180 (1974). MSC: 90C35 90B10 PDFBibTeX XMLCite \textit{P. Brucker}, Z. Oper. Res., Ser. A 18, 177--180 (1974; Zbl 0285.90077) Full Text: DOI
Brucker, P. \({\mathfrak R}\)-Netzwerke und Matrixalgorithmen. (German) Zbl 0255.90068 Computing 10, 271-283 (1972). MSC: 90C35 PDFBibTeX XMLCite \textit{P. Brucker}, Computing 10, 271--283 (1972; Zbl 0255.90068) Full Text: DOI