Complex Scheduling (Record no. 102241)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03525nam a22005415i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-642-23929-8 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | DE-He213 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20140220083302.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 110927s2012 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9783642239298 |
| -- | 978-3-642-23929-8 |
| 024 7# - OTHER STANDARD IDENTIFIER | |
| Standard number or code | 10.1007/978-3-642-23929-8 |
| Source of number or code | doi |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | HD30.23 |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | KJT |
| Source | bicssc |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | KJMD |
| Source | bicssc |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | BUS049000 |
| Source | bisacsh |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 658.40301 |
| Edition number | 23 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Brucker, Peter. |
| Relator term | author. |
| 245 10 - TITLE STATEMENT | |
| Title | Complex Scheduling |
| Medium | [electronic resource] / |
| Statement of responsibility, etc | by Peter Brucker, Sigrid Knust. |
| 264 #1 - | |
| -- | Berlin, Heidelberg : |
| -- | Springer Berlin Heidelberg, |
| -- | 2012. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | X, 342 p. |
| Other physical details | online resource. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 490 1# - SERIES STATEMENT | |
| Series statement | GOR-Publications |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Scheduling Models -- Algorithms and Complexity -- Resource-Constrained Project Scheduling -- Complex Job-Shop Scheduling. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | Reihentext: 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 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Economics. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer software. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Algorithms. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Mathematical optimization. |
| 650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Economics/Management Science. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Operations Research/Decision Theory. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Algorithm Analysis and Problem Complexity. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Algorithms. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Optimization. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computational Science and Engineering. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Knust, Sigrid. |
| Relator term | author. |
| 710 2# - ADDED ENTRY--CORPORATE NAME | |
| Corporate name or jurisdiction name as entry element | SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY | |
| Title | Springer eBooks |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Printed edition: |
| International Standard Book Number | 9783642239281 |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| Uniform title | GOR-Publications |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://dx.doi.org/10.1007/978-3-642-23929-8 |
| 912 ## - | |
| -- | ZDB-2-SBE |
No items available.