logo

EbookBell.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link:  https://ebookbell.com/faq 


We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.


For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookBell Team

Complex Scheduling Gorpublications 1st Edition Peter Brucker

  • SKU: BELL-2165010
Complex Scheduling Gorpublications 1st Edition Peter Brucker
$ 31.00 $ 45.00 (-31%)

4.4

12 reviews

Complex Scheduling Gorpublications 1st Edition Peter Brucker instant download after payment.

Publisher: Springer
File Extension: PDF
File size: 2.35 MB
Pages: 292
Author: Peter Brucker, Sigrid Knust,
ISBN: 3540295453, 9783540295457
Language: English
Year: 2006
Edition: 1

Product desciption

Complex Scheduling Gorpublications 1st Edition Peter Brucker by Peter Brucker, Sigrid Knust, 3540295453, 9783540295457 instant download after payment.

This book presents models and algorithms for complex scheduling problems. Besides resource-constrained project scheduling problems with applications also job-shop problems with flexible machines, transportation or limited buffers are discussed. Discrete optimization methods like linear and integer programming, constraint propagation techniques, shortest path and network flow algorithms, branch-and-bound methods, local search and genetic algorithms, and dynamic programming are presented. They are used in exact or heuristic procedures to solve the introduced complex scheduling problems. Furthermore, methods for calculating lower bounds are described. Most algorithms are formulated in detail and illustrated with examples.

Related Products