Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Peter Brucker
@article{DBLP:journals/eor/SmetBCB16,
author = {Pieter Smet and
Peter Brucker and
Patrick De Causmaecker and
Greet Vanden Berghe},
title = {Polynomially solvable personnel rostering problems},
journal = {Eur. J. Oper. Res.},
volume = {249},
number = {1},
pages = {67--75},
year = {2016},
url = {https://doi.org/10.1016/j.ejor.2015.08.025},
doi = {10.1016/J.EJOR.2015.08.025},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/SmetBCB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BruckerS16,
author = {Peter Brucker and
Natalia V. Shakhlevich},
title = {Necessary and sufficient optimality conditions for scheduling unit
time jobs on identical parallel machines},
journal = {J. Sched.},
volume = {19},
number = {6},
pages = {659--685},
year = {2016},
url = {https://doi.org/10.1007/s10951-016-0471-3},
doi = {10.1007/S10951-016-0471-3},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/BruckerS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/BruckerQ14,
author = {Peter Brucker and
Rong Qu},
title = {Network flow models for intraday personnel scheduling problems},
journal = {Ann. Oper. Res.},
volume = {218},
number = {1},
pages = {107--114},
year = {2014},
url = {https://doi.org/10.1007/s10479-012-1234-y},
doi = {10.1007/S10479-012-1234-Y},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/BruckerQ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/ArtiguesBKKLM13,
author = {Christian Artigues and
Peter Brucker and
Sigrid Knust and
Oumar Kon{\'{e}} and
Pierre Lopez and
Marcel Mongeau},
title = {A note on "event-based {MILP} models for resource-constrained
project scheduling problems"},
journal = {Comput. Oper. Res.},
volume = {40},
number = {4},
pages = {1060--1063},
year = {2013},
url = {https://doi.org/10.1016/j.cor.2012.10.018},
doi = {10.1016/J.COR.2012.10.018},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/ArtiguesBKKLM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/LiBNCSY13,
author = {S. S. Li and
Peter Brucker and
Chi To Ng and
T. C. Edwin Cheng and
Natalia V. Shakhlevich and
Jinjiang Yuan},
title = {A note on reverse scheduling with maximum lateness objective},
journal = {J. Sched.},
volume = {16},
number = {4},
pages = {417--422},
year = {2013},
url = {https://doi.org/10.1007/s10951-013-0314-4},
doi = {10.1007/S10951-013-0314-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/LiBNCSY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/BruckerBG12,
author = {Peter Brucker and
Edmund K. Burke and
Sven Groenemeyer},
title = {A branch and bound algorithm for the cyclic job-shop problem with
transportation},
journal = {Comput. Oper. Res.},
volume = {39},
number = {12},
pages = {3200--3214},
year = {2012},
url = {https://doi.org/10.1016/j.cor.2012.04.008},
doi = {10.1016/J.COR.2012.04.008},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/BruckerBG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BruckerBG12,
author = {Peter Brucker and
Edmund K. Burke and
Sven Groenemeyer},
title = {A mixed integer programming model for the cyclic job-shop problem
with transportation},
journal = {Discret. Appl. Math.},
volume = {160},
number = {13-14},
pages = {1924--1935},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2012.04.001},
doi = {10.1016/J.DAM.2012.04.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BruckerBG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/Brucker12,
author = {Peter Brucker},
editor = {Andreas Brieden and
Zafer{-}Korcan G{\"{o}}rg{\"{u}}l{\"{u}} and
Tino Krug and
Erik Kropat and
Silja Meyer{-}Nieberg and
Goran Mihelcic and
Stefan Wolfgang Pickl},
title = {A Car Rental Problem at the German Bundeswehr},
booktitle = {11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
Munich, Germany, May 29-31, 2012. Extended Abstracts},
pages = {44--45},
year = {2012},
timestamp = {Thu, 16 May 2013 15:41:40 +0200},
biburl = {https://dblp.org/rec/conf/colognetwente/Brucker12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/BruckerQB11,
author = {Peter Brucker and
Rong Qu and
Edmund K. Burke},
title = {Personnel scheduling: Models and complexity},
journal = {Eur. J. Oper. Res.},
volume = {210},
number = {3},
pages = {467--473},
year = {2011},
url = {https://doi.org/10.1016/j.ejor.2010.11.017},
doi = {10.1016/J.EJOR.2010.11.017},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/BruckerQB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BruckerS11,
author = {Peter Brucker and
Natalia V. Shakhlevich},
title = {Inverse scheduling: two-machine flow-shop problem},
journal = {J. Sched.},
volume = {14},
number = {3},
pages = {239--256},
year = {2011},
url = {https://doi.org/10.1007/s10951-010-0168-y},
doi = {10.1007/S10951-010-0168-Y},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/BruckerS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BruckerS11a,
author = {Peter Brucker and
Natalia V. Shakhlevich},
title = {A polynomial-time algorithm for a flow-shop batching problem with
equal-length operations},
journal = {J. Sched.},
volume = {14},
number = {4},
pages = {371--389},
year = {2011},
url = {https://doi.org/10.1007/s10951-009-0150-8},
doi = {10.1007/S10951-009-0150-8},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/BruckerS11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/BruckerBCQB10,
author = {Peter Brucker and
Edmund K. Burke and
Timothy Curtois and
Rong Qu and
Greet Vanden Berghe},
title = {A shift sequence based approach for nurse scheduling and a new benchmark
dataset},
journal = {J. Heuristics},
volume = {16},
number = {4},
pages = {559--573},
year = {2010},
url = {https://doi.org/10.1007/s10732-008-9099-6},
doi = {10.1007/S10732-008-9099-6},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/heuristics/BruckerBCQB10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BruckerS09,
author = {Peter Brucker and
Natalia V. Shakhlevich},
title = {Inverse scheduling with maximum lateness objective},
journal = {J. Sched.},
volume = {12},
number = {5},
pages = {475--488},
year = {2009},
url = {https://doi.org/10.1007/s10951-009-0117-9},
doi = {10.1007/S10951-009-0117-9},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/BruckerS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/tf/09/BruckerK09,
author = {Peter Brucker and
Sigrid Knust},
editor = {Yves Robert and
Fr{\'{e}}d{\'{e}}ric Vivien},
title = {On the Complexity of Scheduling},
booktitle = {Introduction to Scheduling},
series = {{CRC} computational science series},
pages = {1--21},
publisher = {{CRC} Press / Chapman and Hall / Taylor {\&} Francis},
year = {2009},
url = {https://doi.org/10.1201/9781420072747-c1},
doi = {10.1201/9781420072747-C1},
timestamp = {Mon, 05 Feb 2024 20:35:55 +0100},
biburl = {https://dblp.org/rec/books/tf/09/BruckerK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/opt/Brucker09,
author = {Peter Brucker},
editor = {Christodoulos A. Floudas and
Panos M. Pardalos},
title = {Job-shop Scheduling Problem},
booktitle = {Encyclopedia of Optimization, Second Edition},
pages = {1782--1788},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-0-387-74759-0\_313},
doi = {10.1007/978-0-387-74759-0\_313},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/opt/Brucker09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/BruckerK08,
author = {Peter Brucker and
Thomas Kampmeyer},
title = {Cyclic job shop scheduling problems with blocking},
journal = {Ann. Oper. Res.},
volume = {159},
number = {1},
pages = {161--181},
year = {2008},
url = {https://doi.org/10.1007/s10479-007-0276-z},
doi = {10.1007/S10479-007-0276-Z},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/BruckerK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BruckerK08,
author = {Peter Brucker and
Thomas Kampmeyer},
title = {A general model for cyclic machine scheduling problems},
journal = {Discret. Appl. Math.},
volume = {156},
number = {13},
pages = {2561--2572},
year = {2008},
url = {https://doi.org/10.1016/j.dam.2008.03.029},
doi = {10.1016/J.DAM.2008.03.029},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BruckerK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BruckerK08,
author = {Peter Brucker and
Svetlana A. Kravchenko},
title = {Scheduling jobs with equal processing times and time windows on identical
parallel machines},
journal = {J. Sched.},
volume = {11},
number = {4},
pages = {229--237},
year = {2008},
url = {https://doi.org/10.1007/s10951-008-0063-y},
doi = {10.1007/S10951-008-0063-Y},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/BruckerK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/BruckerSW07,
author = {Peter Brucker and
Yuri N. Sotskov and
Frank Werner},
title = {Complexity of shop-scheduling problems with fixed number of jobs:
a survey},
journal = {Math. Methods Oper. Res.},
volume = {65},
number = {3},
pages = {461--481},
year = {2007},
url = {https://doi.org/10.1007/s00186-006-0127-8},
doi = {10.1007/S00186-006-0127-8},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/BruckerSW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BaptisteBCDKS07,
author = {Philippe Baptiste and
Peter Brucker and
Marek Chrobak and
Christoph D{\"{u}}rr and
Svetlana A. Kravchenko and
Francis Sourd},
title = {The complexity of mean flow time scheduling problems with release
times},
journal = {J. Sched.},
volume = {10},
number = {2},
pages = {139--146},
year = {2007},
url = {https://doi.org/10.1007/s10951-006-0006-4},
doi = {10.1007/S10951-006-0006-4},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/BaptisteBCDKS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jmma/BruckerK06,
author = {Peter Brucker and
Svetlana A. Kravchenko},
title = {Scheduling Equal Processing Time Jobs to Minimize the Weighted Number
of Late Jobs},
journal = {J. Math. Model. Algorithms},
volume = {5},
number = {2},
pages = {143--165},
year = {2006},
url = {https://doi.org/10.1007/s10852-005-9011-4},
doi = {10.1007/S10852-005-9011-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jmma/BruckerK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/BruckerKO06,
author = {Peter Brucker and
Sigrid Knust and
Ceyda Oguz},
title = {Scheduling chains with identical jobs and constant delays on a single
machine},
journal = {Math. Methods Oper. Res.},
volume = {63},
number = {1},
pages = {63--75},
year = {2006},
url = {https://doi.org/10.1007/s00186-005-0014-8},
doi = {10.1007/S00186-005-0014-8},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/BruckerKO06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ors/BruckerHHN06,
author = {Peter Brucker and
Silvia Heitmann and
Johann L. Hurink and
Tim Nieberg},
title = {Job-shop scheduling with limited capacity buffers},
journal = {{OR} Spectr.},
volume = {28},
number = {2},
pages = {151--176},
year = {2006},
url = {https://doi.org/10.1007/s00291-005-0008-1},
doi = {10.1007/S00291-005-0008-1},
timestamp = {Mon, 06 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ors/BruckerHHN06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0605078,
author = {Philippe Baptiste and
Peter Brucker and
Marek Chrobak and
Christoph D{\"{u}}rr and
Svetlana A. Kravchenko and
Francis Sourd},
title = {The Complexity of Mean Flow Time Scheduling Problems with Release
Times},
journal = {CoRR},
volume = {abs/cs/0605078},
year = {2006},
url = {http://arxiv.org/abs/cs/0605078},
eprinttype = {arXiv},
eprint = {cs/0605078},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0605078.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BeinBLP05,
author = {Wolfgang W. Bein and
Peter Brucker and
Lawrence L. Larmore and
James K. Park},
title = {The algebraic Monge property and path problems},
journal = {Discret. Appl. Math.},
volume = {145},
number = {3},
pages = {455--464},
year = {2005},
url = {https://doi.org/10.1016/j.dam.2004.06.001},
doi = {10.1016/J.DAM.2004.06.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BeinBLP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/BruckerKW05,
author = {Peter Brucker and
Sigrid Knust and
Guoqing Wang},
title = {Complexity results for flow-shop problems with a single server},
journal = {Eur. J. Oper. Res.},
volume = {165},
number = {2},
pages = {398--407},
year = {2005},
url = {https://doi.org/10.1016/j.ejor.2004.04.010},
doi = {10.1016/J.EJOR.2004.04.010},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/BruckerKW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BruckerK05,
author = {Peter Brucker and
Thomas Kampmeyer},
title = {Tabu Search Algorithms for Cyclic Machine Scheduling Problems},
journal = {J. Sched.},
volume = {8},
number = {4},
pages = {303--322},
year = {2005},
url = {https://doi.org/10.1007/s10951-005-1639-4},
doi = {10.1007/S10951-005-1639-4},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/BruckerK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccsa/BruckerK05,
author = {Peter Brucker and
Svetlana A. Kravchenko},
editor = {Osvaldo Gervasi and
Marina L. Gavrilova and
Vipin Kumar and
Antonio Lagan{\`{a}} and
Heow Pueh Lee and
Youngsong Mun and
David Taniar and
Chih Jeng Kenneth Tan},
title = {Polynomial Algorithm for Parallel Machine Mean Flow Time Scheduling
Problem with Release Dates},
booktitle = {Computational Science and Its Applications - {ICCSA} 2005, International
Conference, Singapore, May 9-12, 2005, Proceedings, Part {IV}},
series = {Lecture Notes in Computer Science},
volume = {3483},
pages = {182--191},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11424925\_21},
doi = {10.1007/11424925\_21},
timestamp = {Thu, 28 Apr 2022 16:17:38 +0200},
biburl = {https://dblp.org/rec/conf/iccsa/BruckerK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/or/BruckerK05,
author = {Peter Brucker and
Thomas Kampmeyer},
editor = {Hans{-}Dietrich Haasis and
Herbert Kopfer and
J{\"{o}}rn Sch{\"{o}}nberger},
title = {Cyclic Scheduling Problems with Linear Precedences and Resource Constraints},
booktitle = {Operations Research Proceedings 2005, Selected Papers of the Annual
International Conference of the German Operations Research Society
(GOR), Bremen, Germany, September 7-9, 2005},
pages = {667--672},
year = {2005},
url = {https://doi.org/10.1007/3-540-32539-5\_104},
doi = {10.1007/3-540-32539-5\_104},
timestamp = {Tue, 19 Jun 2018 08:18:34 +0200},
biburl = {https://dblp.org/rec/conf/or/BruckerK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0010885,
author = {Peter Brucker},
title = {Scheduling algorithms {(4.} ed.)},
publisher = {Springer},
year = {2004},
isbn = {978-3-540-20524-1},
timestamp = {Thu, 07 Apr 2011 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0010885.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/BaptisteBKT04,
author = {Philippe Baptiste and
Peter Brucker and
Sigrid Knust and
Vadim G. Timkovsky},
title = {Ten notes on equal-processing-time scheduling},
journal = {4OR},
volume = {2},
number = {2},
pages = {111--127},
year = {2004},
url = {https://doi.org/10.1007/s10288-003-0024-4},
doi = {10.1007/S10288-003-0024-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/4or/BaptisteBKT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/BruckerKCS04,
author = {Peter Brucker and
Sigrid Knust and
T. C. Edwin Cheng and
Natalia V. Shakhlevich},
title = {Complexity Results for Flow-Shop and Open-Shop Scheduling Problems
with Transportation Delays},
journal = {Ann. Oper. Res.},
volume = {129},
number = {1-4},
pages = {81--106},
year = {2004},
url = {https://doi.org/10.1023/B:ANOR.0000030683.64615.c8},
doi = {10.1023/B:ANOR.0000030683.64615.C8},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/BruckerKCS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/BaptisteB04,
author = {Philippe Baptiste and
Peter Brucker},
editor = {Joseph Y.{-}T. Leung},
title = {Scheduling Equal Processing Time Jobs},
booktitle = {Handbook of Scheduling - Algorithms, Models, and Performance Analysis},
publisher = {Chapman and Hall/CRC},
year = {2004},
url = {http://www.crcnetbase.com/doi/abs/10.1201/9780203489802.ch14},
doi = {10.1201/9780203489802.CH14},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/crc/BaptisteB04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/BruckerK03,
author = {Peter Brucker and
Sigrid Knust},
title = {Sequencing and scheduling},
journal = {Eur. J. Oper. Res.},
volume = {149},
number = {2},
pages = {247--248},
year = {2003},
url = {https://doi.org/10.1016/S0377-2217(02)00757-9},
doi = {10.1016/S0377-2217(02)00757-9},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/BruckerK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/BruckerK03a,
author = {Peter Brucker and
Sigrid Knust},
title = {Lower bounds for resource-constrained project scheduling problems},
journal = {Eur. J. Oper. Res.},
volume = {149},
number = {2},
pages = {302--313},
year = {2003},
url = {https://doi.org/10.1016/S0377-2217(02)00762-2},
doi = {10.1016/S0377-2217(02)00762-2},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/BruckerK03a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/BruckerHR03,
author = {Peter Brucker and
Johann L. Hurink and
Thomas Rolfes},
title = {Routing of Railway Carriages},
journal = {J. Glob. Optim.},
volume = {27},
number = {2-3},
pages = {313--332},
year = {2003},
url = {https://doi.org/10.1023/A:1024843208074},
doi = {10.1023/A:1024843208074},
timestamp = {Fri, 11 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/BruckerHR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/BruckerHK03,
author = {Peter Brucker and
Johann L. Hurink and
Sigrid Knust},
title = {A polynomial algorithm for {P} {\(\vert\)} p\({}_{\mbox{j}}\)=1, r\({}_{\mbox{j}}\),
outtree {\(\vert\)} {\(\sum\)} C\({}_{\mbox{j}}\)},
journal = {Math. Methods Oper. Res.},
volume = {56},
number = {3},
pages = {407--412},
year = {2003},
url = {https://doi.org/10.1007/s001860200228},
doi = {10.1007/S001860200228},
timestamp = {Mon, 06 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/BruckerHK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BruckerHH03,
author = {Peter Brucker and
Silvia Heitmann and
Johann L. Hurink},
title = {How useful are preemptive schedules?},
journal = {Oper. Res. Lett.},
volume = {31},
number = {2},
pages = {129--136},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00220-1},
doi = {10.1016/S0167-6377(02)00220-1},
timestamp = {Mon, 06 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BruckerHH03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ors/BruckerHH03,
author = {Peter Brucker and
Silvia Heitmann and
Johann L. Hurink},
title = {Flow-shop problems with intermediate buffers},
journal = {{OR} Spectr.},
volume = {25},
number = {4},
pages = {549--574},
year = {2003},
url = {https://doi.org/10.1007/s00291-003-0133-7},
doi = {10.1007/S00291-003-0133-7},
timestamp = {Mon, 06 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ors/BruckerHH03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/BruckerK02,
author = {Peter Brucker and
Sigrid Knust},
title = {Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment},
journal = {Ann. Oper. Res.},
volume = {115},
number = {1-4},
pages = {147--172},
year = {2002},
url = {https://doi.org/10.1023/A:1021149204501},
doi = {10.1023/A:1021149204501},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/BruckerK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Brucker02,
author = {Peter Brucker},
title = {Scheduling and constraint propagation},
journal = {Discret. Appl. Math.},
volume = {123},
number = {1-3},
pages = {227--256},
year = {2002},
url = {https://doi.org/10.1016/S0166-218X(01)00342-0},
doi = {10.1016/S0166-218X(01)00342-0},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Brucker02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ors/BruckerHK02,
author = {Peter Brucker and
Silvia Heitmann and
Sigrid Knust},
title = {Scheduling railway traffic at a construction site},
journal = {{OR} Spectr.},
volume = {24},
number = {1},
pages = {19--30},
year = {2002},
url = {https://doi.org/10.1007/s291-002-8198-0},
doi = {10.1007/S291-002-8198-0},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ors/BruckerHK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BeinBLP02,
author = {Wolfgang W. Bein and
Peter Brucker and
Lawrence L. Larmore and
James K. Park},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Fast Algorithms with Algebraic Monge Properties},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {104--117},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_8},
doi = {10.1007/3-540-45687-2\_8},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BeinBLP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/BruckerH00,
author = {Peter Brucker and
Johann L. Hurink},
title = {Solving a chemical batch scheduling problem by local search},
journal = {Ann. Oper. Res.},
volume = {96},
number = {1-4},
pages = {17--38},
year = {2000},
url = {https://doi.org/10.1023/A\%3A1018959704264},
doi = {10.1023/A\%3A1018959704264},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/BruckerH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/BruckerK00,
author = {Peter Brucker and
Sigrid Knust},
title = {A linear programming and constraint propagation-based lower bound
for the {RCPSP}},
journal = {Eur. J. Oper. Res.},
volume = {127},
number = {2},
pages = {355--362},
year = {2000},
url = {https://doi.org/10.1016/S0377-2217(99)00489-0},
doi = {10.1016/S0377-2217(99)00489-0},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/BruckerK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/BruckerKRZ00,
author = {Peter Brucker and
Sigrid Knust and
Duncan Roper and
Yakov Zinder},
title = {Scheduling {UET} task systems with concurrency on two parallel identical
processors},
journal = {Math. Methods Oper. Res.},
volume = {52},
number = {3},
pages = {369--387},
year = {2000},
url = {https://doi.org/10.1007/s001860000089},
doi = {10.1007/S001860000089},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/BruckerKRZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/patat/BruckerK00,
author = {Peter Brucker and
Sigrid Knust},
editor = {Edmund K. Burke and
Wilhelm Erben},
title = {Resource-Constrained Project Scheduling and Timetabling},
booktitle = {Practice and Theory of Automated Timetabling III, Third International
Conference, {PATAT} 2000, Konstanz, Germany, August 16-18, 2000, Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {2079},
pages = {277--293},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44629-X\_17},
doi = {10.1007/3-540-44629-X\_17},
timestamp = {Sun, 02 Jun 2019 21:15:13 +0200},
biburl = {https://dblp.org/rec/conf/patat/BruckerK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/BruckerK99,
author = {Peter Brucker and
Sigrid Knust},
title = {Complexity Results for Single-Machine Problems with Positive Finish-Start
Time-Lags},
journal = {Computing},
volume = {63},
number = {4},
pages = {299--316},
year = {1999},
url = {https://doi.org/10.1007/s006070050036},
doi = {10.1007/S006070050036},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/BruckerK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BruckerHH99,
author = {Peter Brucker and
Thomas Hilbig and
Johann L. Hurink},
title = {A Branch and Bound Algorithm for a Single-machine Scheduling Problem
with Positive, Negative Time-lags},
journal = {Discret. Appl. Math.},
volume = {94},
number = {1-3},
pages = {77--99},
year = {1999},
url = {https://doi.org/10.1016/S0166-218X(99)00015-3},
doi = {10.1016/S0166-218X(99)00015-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BruckerHH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/BruckerDMNP99,
author = {Peter Brucker and
Andreas Drexl and
Rolf H. M{\"{o}}hring and
Klaus Neumann and
Erwin Pesch},
title = {Resource-constrained project scheduling: Notation, classification,
models, and methods},
journal = {Eur. J. Oper. Res.},
volume = {112},
number = {1},
pages = {3--41},
year = {1999},
url = {https://doi.org/10.1016/S0377-2217(98)00204-5},
doi = {10.1016/S0377-2217(98)00204-5},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/BruckerDMNP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/BruckerKS99,
author = {Peter Brucker and
Svetlana A. Kravchenko and
Yuri N. Sotskov},
title = {Preemptive job-shop scheduling problems with a fixed number of jobs},
journal = {Math. Methods Oper. Res.},
volume = {49},
number = {1},
pages = {41--76},
year = {1999},
url = {https://doi.org/10.1007/PL00020906},
doi = {10.1007/PL00020906},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/BruckerKS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/BruckerHK99,
author = {Peter Brucker and
Johann L. Hurink and
Wieslaw Kubiak},
title = {Scheduling identical jobs with chain precedence constraints on two
uniform machines},
journal = {Math. Methods Oper. Res.},
volume = {49},
number = {2},
pages = {211--219},
year = {1999},
url = {https://doi.org/10.1007/PL00020913},
doi = {10.1007/PL00020913},
timestamp = {Mon, 06 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/BruckerHK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/BruckerKS098,
author = {Peter Brucker and
Mikhail Y. Kovalyov and
Yakov M. Shafransky and
Frank Werner},
title = {Batch scheduling with deadlines on parallel machines},
journal = {Ann. Oper. Res.},
volume = {83},
pages = {23--40},
year = {1998},
url = {https://doi.org/10.1023/A\%3A1018912114491},
doi = {10.1023/A\%3A1018912114491},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/BruckerKS098.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/BruckerKST98,
author = {Peter Brucker and
Sigrid Knust and
Arno Schoo and
Olaf Thiele},
title = {A branch and bound algorithm for the resource-constrained project
scheduling problem},
journal = {Eur. J. Oper. Res.},
volume = {107},
number = {2},
pages = {272--288},
year = {1998},
url = {https://doi.org/10.1016/S0377-2217(97)00335-4},
doi = {10.1016/S0377-2217(97)00335-4},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/BruckerKST98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/BruckerJK97,
author = {Peter Brucker and
Bernd Jurisch and
Andreas Kr{\"{a}}mer},
title = {Complexity of scheduling problems with multi-purpose machines},
journal = {Ann. Oper. Res.},
volume = {70},
pages = {57--73},
year = {1997},
url = {https://doi.org/10.1023/A\%3A1018950911030},
doi = {10.1023/A\%3A1018950911030},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/BruckerJK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BruckerHW97,
author = {Peter Brucker and
Johann L. Hurink and
Frank Werner},
title = {Improving Local Search Heuristics for some Scheduling Problems. Part
{II}},
journal = {Discret. Appl. Math.},
volume = {72},
number = {1-2},
pages = {47--69},
year = {1997},
url = {https://doi.org/10.1016/S0166-218X(96)00036-4},
doi = {10.1016/S0166-218X(96)00036-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BruckerHW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BruckerHJW97,
author = {Peter Brucker and
Johann L. Hurink and
Bernd Jurisch and
Birgit W{\"{o}}stmann},
title = {A Branch {\&} Bound Algorithm for the Open-shop Problem},
journal = {Discret. Appl. Math.},
volume = {76},
number = {1-3},
pages = {43--59},
year = {1997},
url = {https://doi.org/10.1016/S0166-218X(96)00116-3},
doi = {10.1016/S0166-218X(96)00116-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BruckerHJW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/MartiRDB97,
author = {Kurt Marti and
Chandrasekharan Rajendran and
Joachim R. Daduna and
Peter Brucker},
title = {Book reviews},
journal = {Math. Methods Oper. Res.},
volume = {45},
number = {1},
pages = {161--166},
year = {1997},
url = {https://doi.org/10.1007/BF01194254},
doi = {10.1007/BF01194254},
timestamp = {Thu, 07 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/MartiRDB97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/OnnWB97,
author = {Shmuel Onn and
Robert Weismantel and
Peter Brucker},
title = {Book reviews},
journal = {Math. Methods Oper. Res.},
volume = {46},
number = {2},
pages = {281--284},
year = {1997},
url = {https://doi.org/10.1007/BF01217696},
doi = {10.1007/BF01217696},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/OnnWB97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BruckerHW96,
author = {Peter Brucker and
Johann L. Hurink and
Frank Werner},
title = {Improving Local Search Heuristics for Some Scheduling Problems-I},
journal = {Discret. Appl. Math.},
volume = {65},
number = {1-3},
pages = {97--122},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(95)00030-U},
doi = {10.1016/0166-218X(95)00030-U},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BruckerHW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/BruckerK96,
author = {Peter Brucker and
Mikhail Y. Kovalyov},
title = {Single machine batch scheduling to minimize the weighted number of
late jobs},
journal = {Math. Methods Oper. Res.},
volume = {43},
number = {1},
pages = {1--8},
year = {1996},
url = {https://doi.org/10.1007/BF01303431},
doi = {10.1007/BF01303431},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/BruckerK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/BruckerK95,
author = {Peter Brucker and
Andreas Kr{\"{a}}mer},
title = {Shop scheduling problems with multiprocessor tasks on dedicated processors},
journal = {Ann. Oper. Res.},
volume = {57},
number = {1},
pages = {13--27},
year = {1995},
url = {https://doi.org/10.1007/BF02099688},
doi = {10.1007/BF02099688},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/BruckerK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BeinBPP95,
author = {Wolfgang W. Bein and
Peter Brucker and
James K. Park and
Pramod K. Pathak},
title = {A Monge Property for the D-dimensional Transportation Problem},
journal = {Discret. Appl. Math.},
volume = {58},
number = {2},
pages = {97--109},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(93)E0121-E},
doi = {10.1016/0166-218X(93)E0121-E},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BeinBPP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Brucker95,
author = {Peter Brucker},
title = {Efficient Algorithms for Some Path Partitioning Problems},
journal = {Discret. Appl. Math.},
volume = {62},
number = {1-3},
pages = {77--85},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00146-5},
doi = {10.1016/0166-218X(94)00146-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Brucker95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/BruckerJK94,
author = {Peter Brucker and
Bernd Jurisch and
Andreas Kr{\"{a}}mer},
title = {The job-shop problem and immediate selection},
journal = {Ann. Oper. Res.},
volume = {50},
number = {1},
pages = {73--114},
year = {1994},
url = {https://doi.org/10.1007/BF02085636},
doi = {10.1007/BF02085636},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/BruckerJK94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/BruckerN94,
author = {Peter Brucker and
L. Nordmann},
title = {The\emph{k}-track assignment problem},
journal = {Computing},
volume = {52},
number = {2},
pages = {97--122},
year = {1994},
url = {https://doi.org/10.1007/BF02238071},
doi = {10.1007/BF02238071},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/BruckerN94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BruckerJS94,
author = {Peter Brucker and
Bernd Jurisch and
Bernd Sievers},
title = {A Branch and Bound Algorithm for the Job-Shop Scheduling Problem},
journal = {Discret. Appl. Math.},
volume = {49},
number = {1-3},
pages = {107--127},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90204-6},
doi = {10.1016/0166-218X(94)90204-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BruckerJS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AlbersB93,
author = {Susanne Albers and
Peter Brucker},
title = {The Complexity of One-Machine Batching Problems},
journal = {Discret. Appl. Math.},
volume = {47},
number = {2},
pages = {87--107},
year = {1993},
url = {https://doi.org/10.1016/0166-218X(93)90085-3},
doi = {10.1016/0166-218X(93)90085-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AlbersB93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/BruckerJJ93,
author = {Peter Brucker and
Bernd Jurisch and
Marion Jurisch},
title = {Open shop problems with unit time operations},
journal = {{ZOR} Methods Model. Oper. Res.},
volume = {37},
number = {1},
pages = {59--73},
year = {1993},
url = {https://doi.org/10.1007/BF01415528},
doi = {10.1007/BF01415528},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/BruckerJJ93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/Brucker93,
author = {Peter Brucker},
title = {Book review},
journal = {{ZOR} Methods Model. Oper. Res.},
volume = {37},
number = {2},
pages = {206},
year = {1993},
url = {https://doi.org/10.1007/BF01414157},
doi = {10.1007/BF01414157},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/Brucker93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BeinBH93,
author = {Wolfgang W. Bein and
Peter Brucker and
Alan J. Hoffman},
title = {Series parallel composition of greedy linear programming problems},
journal = {Math. Program.},
volume = {62},
pages = {1--14},
year = {1993},
url = {https://doi.org/10.1007/BF01585157},
doi = {10.1007/BF01585157},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/BeinBH93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BruckerJTW93,
author = {Peter Brucker and
Bernd Jurisch and
Thomas Tautenhahn and
Frank Werner},
title = {Scheduling unit time open shops to minimize the weighted number of
late jobs},
journal = {Oper. Res. Lett.},
volume = {14},
number = {5},
pages = {245--250},
year = {1993},
url = {https://doi.org/10.1016/0167-6377(93)90088-X},
doi = {10.1016/0167-6377(93)90088-X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BruckerJTW93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/BeinBS91,
author = {Wolfgang W. Bein and
Peter Brucker and
Matthias F. M. Stallmann},
title = {A characterization of network representable polymatroids},
journal = {{ZOR} Methods Model. Oper. Res.},
volume = {35},
number = {4},
pages = {267--272},
year = {1991},
url = {https://doi.org/10.1007/BF01417514},
doi = {10.1007/BF01417514},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/BeinBS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icra/Brucker91,
author = {Peter Brucker},
title = {Scheduling problems in connection with flexible production systems},
booktitle = {Proceedings of the 1991 {IEEE} International Conference on Robotics
and Automation, Sacramento, CA, USA, 9-11 April 1991},
pages = {1778--1783},
publisher = {{IEEE} Computer Society},
year = {1991},
url = {https://doi.org/10.1109/ROBOT.1991.131880},
doi = {10.1109/ROBOT.1991.131880},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icra/Brucker91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/BruckerS90,
author = {Peter Brucker and
Rainer Schlie},
title = {Job-shop scheduling with multi-purpose machines},
journal = {Computing},
volume = {45},
number = {4},
pages = {369--375},
year = {1990},
url = {https://doi.org/10.1007/BF02238804},
doi = {10.1007/BF02238804},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/BruckerS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/BruckerK90,
author = {Peter Brucker and
Ulrich Kathmann},
title = {Pattern scheduling},
journal = {{ZOR} Methods Model. Oper. Res.},
volume = {34},
number = {5},
pages = {381--394},
year = {1990},
url = {https://doi.org/10.1007/BF01416228},
doi = {10.1007/BF01416228},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/BruckerK90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/BeinB89,
author = {Wolfgang W. Bein and
Peter Brucker},
title = {An\emph{O} (\emph{n} log\emph{n})-algorithm for solving a special
class of linear programs},
journal = {Computing},
volume = {42},
number = {4},
pages = {309--313},
year = {1989},
url = {https://doi.org/10.1007/BF02243226},
doi = {10.1007/BF02243226},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/BeinB89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/Brucker88,
author = {Peter Brucker},
title = {An efficient algorithm for the job-shop problem with two jobs},
journal = {Computing},
volume = {40},
number = {4},
pages = {353--359},
year = {1988},
url = {https://doi.org/10.1007/BF02276919},
doi = {10.1007/BF02276919},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/Brucker88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BruckerM88,
author = {Peter Brucker and
Wolfgang Meyer},
title = {Scheduling two irregular polygons},
journal = {Discret. Appl. Math.},
volume = {20},
number = {2},
pages = {91--100},
year = {1988},
url = {https://doi.org/10.1016/0166-218X(88)90056-X},
doi = {10.1016/0166-218X(88)90056-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BruckerM88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/BruckerM87,
author = {Peter Brucker and
Wolfgang Meyer},
title = {Approximation of a set of points by points of a grid},
journal = {Computing},
volume = {38},
number = {4},
pages = {341--345},
year = {1987},
url = {https://doi.org/10.1007/BF02278711},
doi = {10.1007/BF02278711},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/BruckerM87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/GrauerCRDBSB87,
author = {Manfred Grauer and
Colhourn and
Ludger R{\"{u}}schendorf and
M. L. Dowling and
Adi Ben{-}Israel and
D. Schweigert and
Peter Brucker},
title = {Book review},
journal = {Z. Oper. Research},
volume = {31},
number = {5},
year = {1987},
url = {https://doi.org/10.1007/BF02109598},
doi = {10.1007/BF02109598},
timestamp = {Mon, 18 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/GrauerCRDBSB87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BeinB86,
author = {Wolfgang W. Bein and
Peter Brucker},
title = {Greedy concepts for network flow problems},
journal = {Discret. Appl. Math.},
volume = {15},
number = {2-3},
pages = {135--144},
year = {1986},
url = {https://doi.org/10.1016/0166-218X(86)90037-5},
doi = {10.1016/0166-218X(86)90037-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BeinB86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/BruckerH86,
author = {Peter Brucker and
Johann L. Hurink},
title = {A railway scheduling problem},
journal = {Z. Oper. Research},
volume = {30},
number = {5},
year = {1986},
url = {https://doi.org/10.1007/BF01919290},
doi = {10.1007/BF01919290},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/BruckerH86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BruckerP85,
author = {Peter Brucker and
W. Papenjohann},
title = {An out-of-kilter method for the algebraic circulation problem},
journal = {Discret. Appl. Math.},
volume = {10},
number = {1},
pages = {1--18},
year = {1985},
url = {https://doi.org/10.1016/0166-218X(85)90055-1},
doi = {10.1016/0166-218X(85)90055-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BruckerP85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BeinBT85,
author = {Wolfgang W. Bein and
Peter Brucker and
Arie Tamir},
title = {Minimum cost flow algorithms for series-parallel networks},
journal = {Discret. Appl. Math.},
volume = {10},
number = {2},
pages = {117--124},
year = {1985},
url = {https://doi.org/10.1016/0166-218X(85)90006-X},
doi = {10.1016/0166-218X(85)90006-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BeinBT85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/BaumSAZNBHTJH85,
author = {D. Baum and
K. Schittkowski and
Manfred Armbrust and
J. Zowe and
K. Nickel and
Peter Brucker and
G. H{\"{u}}bner and
G. Trenkler and
Johannes Jahn and
T. Hanschke},
title = {Book reviews},
journal = {Z. Oper. Research},
volume = {29},
number = {7},
pages = {317--324},
year = {1985},
url = {https://doi.org/10.1007/BF01918765},
doi = {10.1007/BF01918765},
timestamp = {Sun, 01 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/BaumSAZNBHTJH85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/Brucker84,
author = {Peter Brucker},
title = {An\emph{O (n)}-algorithm for LP-knapsacks with a fixed number of {GUB}
constraints},
journal = {Z. Oper. Research},
volume = {28},
number = {1},
pages = {29--40},
year = {1984},
url = {https://doi.org/10.1007/BF01919085},
doi = {10.1007/BF01919085},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/Brucker84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/AvenhausBLMRKBU83,
author = {Rudolf Avenhaus and
Peter Brucker and
Alfred Luhmer and
Rolf H. M{\"{o}}hring and
Franz Josef Radermacher and
Klaus{-}Peter Kistner and
Volker Brandenburg and
G{\"{o}}tz Uebe},
title = {Book reviews},
journal = {Z. Oper. Research},
volume = {27},
number = {1},
pages = {67--72},
year = {1983},
url = {https://doi.org/10.1007/BF01916902},
doi = {10.1007/BF01916902},
timestamp = {Wed, 20 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/AvenhausBLMRKBU83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/BruckerH83,
author = {Peter Brucker and
Wilhelm Hummeltenberg},
title = {Book reviews},
journal = {Z. Oper. Research},
volume = {27},
number = {1},
pages = {176},
year = {1983},
url = {https://doi.org/10.1007/BF01916913},
doi = {10.1007/BF01916913},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/BruckerH83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/BruckerSMFZGBBS83,
author = {Peter Brucker and
G. Seeber and
K. Mosler and
Gustav Feichtinger and
G{\"{u}}nther Z{\"{a}}pfel and
D. Greiner and
Michael Bastian and
Fred Alois Behringer and
Peter Stahlknecht and
Hartmut Wiedey and
P. H. van Leeuwen and
J. M. R. Verbon{-}Huisman and
R. Abele and
Lothar Streitferdt},
title = {Buchbesprechungen},
journal = {Z. Oper. Research},
volume = {27},
number = {1},
year = {1983},
url = {https://doi.org/10.1007/BF01916944},
doi = {10.1007/BF01916944},
timestamp = {Wed, 20 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/BruckerSMFZGBBS83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/LorscheiderHSMR83,
author = {U. Lorscheider and
K.{-}D. Hackbarth and
Ch. Scholz and
Rolf H. M{\"{o}}hring and
Franz Josef Radermacher and
Alfred Luhmer and
Peter Brucker and
Bernd Schiemenz and
Gustav Feichtinger},
title = {Book reviews},
journal = {Z. Oper. Research},
volume = {27},
number = {1},
pages = {211--216},
year = {1983},
url = {https://doi.org/10.1007/BF01916918},
doi = {10.1007/BF01916918},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/LorscheiderHSMR83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/UebeB83,
author = {G{\"{o}}tz Uebe and
Peter Brucker},
title = {Buchbesprechungen},
journal = {Z. Oper. Research},
volume = {27},
number = {1},
year = {1983},
url = {https://doi.org/10.1007/BF01916946},
doi = {10.1007/BF01916946},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/UebeB83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Brucker83,
author = {Peter Brucker},
title = {Linear and Combinatorial Optimization in Ordered Algebraic Structures,
by U. Zimmermann, North-Holland, Amsterdam, 1981, 380 pp. Price: {\textdollar}61.00},
journal = {Networks},
volume = {13},
number = {3},
pages = {451},
year = {1983},
url = {https://doi.org/10.1002/net.3230130312},
doi = {10.1002/NET.3230130312},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Brucker83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Brucker82,
author = {Peter Brucker},
editor = {Hans J{\"{u}}rgen Schneider and
Herbert G{\"{o}}ttler},
title = {Network Flows in Trees and Knapsack Problems with Nested Constraints},
booktitle = {Proceedings of the 8th Conference Graphtheoretic Concepts in Computer
Science {(WG} '82), Neuenkirchen (near Erlangen), Germany},
pages = {25--36},
publisher = {Hanser, Munich},
year = {1982},
timestamp = {Thu, 04 Feb 2021 13:01:49 +0100},
biburl = {https://dblp.org/rec/conf/wg/Brucker82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/Brucker81,
author = {Peter Brucker},
title = {Minimizing maximum lateness in a two-machine unit-time job shop},
journal = {Computing},
volume = {27},
number = {4},
pages = {367--370},
year = {1981},
url = {https://doi.org/10.1007/BF02277185},
doi = {10.1007/BF02277185},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/Brucker81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/JaegerHSUDBJ81,
author = {A. Jaeger and
R. K. Huber and
Bernd Schiemenz and
G{\"{o}}tz Uebe and
Ulrich Derigs and
Peter Brucker and
Johannes Jahn},
title = {Buchbesprechungen},
journal = {Z. Oper. Research},
volume = {25},
number = {2},
year = {1981},
url = {https://doi.org/10.1007/BF01919915},
doi = {10.1007/BF01919915},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/JaegerHSUDBJ81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/BruckerSOEZSFDO80,
author = {Peter Brucker and
Bernd Schiemenz and
G. C. Ovuworie and
Th. Eisele and
Hans{-}J{\"{u}}rgen Zimmermann and
Jochen Schwarze and
T. Fischer and
H. Dellwing and
Dietrich Ohse},
title = {Book reviews},
journal = {Z. Oper. Research},
volume = {24},
number = {7},
pages = {274--280},
year = {1980},
url = {https://doi.org/10.1007/BF01919907},
doi = {10.1007/BF01919907},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/BruckerSOEZSFDO80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Brucker80,
author = {Peter Brucker},
editor = {Hartmut Noltemeier},
title = {The Chinese Postman Problem for Mixed Graphs},
booktitle = {Graphtheoretic Concepts in Computer Science, Proceedings of the International
Workshop {WG} '80, Bad Honnef, Germany, June 15-18, 1980},
series = {Lecture Notes in Computer Science},
volume = {100},
pages = {354--366},
publisher = {Springer},
year = {1980},
url = {https://doi.org/10.1007/3-540-10291-4\_26},
doi = {10.1007/3-540-10291-4\_26},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/Brucker80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/Brucker79,
author = {Peter Brucker},
title = {\emph{NP}-Complete operations research problems and approximation
algorithms},
journal = {Z. Oper. Research},
volume = {23},
number = {3},
pages = {73--94},
year = {1979},
url = {https://doi.org/10.1007/BF01951543},
doi = {10.1007/BF01951543},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/Brucker79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/BruckerGJ77,
author = {Peter Brucker and
Michael R. Garey and
David S. Johnson},
title = {Scheduling Equal-Length Tasks Under Treelike Precedence Constraints
to Minimize Maximum Lateness},
journal = {Math. Oper. Res.},
volume = {2},
number = {3},
pages = {275--284},
year = {1977},
url = {https://doi.org/10.1287/moor.2.3.275},
doi = {10.1287/MOOR.2.3.275},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/BruckerGJ77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/Brucker74,
author = {Peter Brucker},
title = {A decomposition algorithm for shortest paths in a network with many
strongly connected components},
journal = {Z. Oper. Research},
volume = {18},
number = {5},
pages = {177--180},
year = {1974},
url = {https://doi.org/10.1007/BF02026598},
doi = {10.1007/BF02026598},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/Brucker74.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/Brucker72,
author = {Peter Brucker},
title = {{\(\mathfrak{R}\)}-Netzwerke und Matrixalgorithmen},
journal = {Computing},
volume = {10},
number = {3},
pages = {271--283},
year = {1972},
url = {https://doi.org/10.1007/BF02316913},
doi = {10.1007/BF02316913},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/Brucker72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 02:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
