000 03525nam a22005415i 4500
001 978-3-642-23929-8
003 DE-He213
005 20140220083302.0
007 cr nn 008mamaa
008 110927s2012 gw | s |||| 0|eng d
020 _a9783642239298
_9978-3-642-23929-8
024 7 _a10.1007/978-3-642-23929-8
_2doi
050 4 _aHD30.23
072 7 _aKJT
_2bicssc
072 7 _aKJMD
_2bicssc
072 7 _aBUS049000
_2bisacsh
082 0 4 _a658.40301
_223
100 1 _aBrucker, Peter.
_eauthor.
245 1 0 _aComplex Scheduling
_h[electronic resource] /
_cby Peter Brucker, Sigrid Knust.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2012.
300 _aX, 342 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aGOR-Publications
505 0 _aScheduling Models -- Algorithms and Complexity -- Resource-Constrained Project Scheduling -- Complex Job-Shop Scheduling.
520 _aReihentext: GOR   The German Society of Operations Research - and its members provide numerous significant contributions to Operations Research/Management Science, with respect to both theory and practice. In order to demonstrate the high standards of these contributions and to make them more easily available, in particular to researchers and practitioners from outside the German-speaking countries, GOR has created this book series. It publishes high-quality monographs and collections of papers on all aspects of Operations Research/Management Science, which deal with a single topic of current interest and originate from or are related to the activities of GOR. Back cover copy text: This book presents models and algorithms for complex schedul- ing problems. Besides resource-constrained project scheduling problems with applications also job-shop problems with flexible machines, transportation or limited buffers are discussed. Dis- crete optimization methods like linear and integer program- ming, constraint propagation techniques, shortest path and net- work flow algorithms, branch-and-bound methods, local search and genetic algorithms, and dynamic programming are present- ed. They are used in exact or heuristic procedures to solve the introduced complex scheduling problems. Furthermore, meth- ods for calculating lower bounds are described. Most algorithms are formulated in detail and illustrated with examples. In this second edition some errors were corrected, some parts were explained in more detail, and new material has been added. In particular, further generalizations of the RCPSP, additional practical applications and some more algorithms were integrated.
650 0 _aEconomics.
650 0 _aComputer software.
650 0 _aAlgorithms.
650 0 _aComputer science.
650 0 _aMathematical optimization.
650 1 4 _aEconomics/Management Science.
650 2 4 _aOperations Research/Decision Theory.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aAlgorithms.
650 2 4 _aOptimization.
650 2 4 _aComputational Science and Engineering.
700 1 _aKnust, Sigrid.
_eauthor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642239281
830 0 _aGOR-Publications
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-23929-8
912 _aZDB-2-SBE
999 _c102241
_d102241