Use coupon code “SUMMER20” for a 20% discount on all items! Valid until 2024-08-31

Site Logo
Search Suggestions

      Royal Mail  express delivery to UK destinations

      Regular sales and promotions

      Stock updates every 20 minutes!

      Complex Scheduling

      Out of stock

      Firm sale: non returnable item
      SKU 9783642269578 Categories ,
      This book presents models and algorithms for complex scheduling problems. 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 progra...

      £109.99

      Buy new:

      Delivery: UK delivery Only. Usually dispatched in 1-2 working days.

      Shipping costs: All shipping costs calculated in the cart or during the checkout process.

      Standard service (normally 2-3 working days): 48hr Tracked service.

      Premium service (next working day): 24hr Tracked service – signature service included.

      Royal mail: 24 & 48hr Tracked: Trackable items weighing up to 20kg are tracked to door and are inclusive of text and email with ‘Leave in Safe Place’ options, but are non-signature services. Examples of service expected: Standard 48hr service – if ordered before 3pm on Thursday then expected delivery would be on Saturday. If Premium 24hr service used, then expected delivery would be Friday.

      Signature Service: This service is only available for tracked items.

      Leave in Safe Place: This option is available at no additional charge for tracked services.

      Description

      Product ID:9783642269578
      Product Form:Paperback / softback
      Country of Manufacture:DE
      Series:GOR-Publications
      Title:Complex Scheduling
      Authors:Author: Peter Brucker, Sigrid Knust
      Page Count:342
      Subjects:Management decision making, Management decision making, Operational research, Numerical analysis, Optimization, Algorithms and data structures, Operational research, Numerical analysis, Optimization, Algorithms & data structures
      Description:This book presents models and algorithms for complex scheduling problems. 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.

      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.

      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.


      Imprint Name:Springer-Verlag Berlin and Heidelberg GmbH & Co. K
      Publisher Name:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
      Country of Publication:GB
      Publishing Date:2013-11-27

      Additional information

      Weight540 g
      Dimensions156 × 234 × 21 mm