{"product_id":"9781461370932","title":"Operations Research\/Computer Science Interfaces Series","description":"\u003ch1\u003eOperations Research\/Computer Science Interfaces Series\u003c\/h1\u003e \u003ch2\u003eKlein, Robert\u003c\/h2\u003e \u003cp\u003eProject management has become a widespread instrument enabling  organizations to efficiently master the challenges of steadily  shortening product life cycles, global markets and decreasing profit  margins. With projects increasing in size and complexity, their  planning and control represents one of the most crucial management  tasks. This is especially true for scheduling, which is concerned with  establishing execution dates for the sub-activities to be performed in  order to complete the project. The ability to manage projects where  resources must be allocated between concurrent projects or even  sub-activities of a single project requires the use of commercial  project management software packages. However, the results yielded by  the solution procedures included are often rather unsatisfactory.  \u003cem\u003eScheduling of Resource-Constrained Projects\u003c\/em\u003e develops more  efficient procedures, which can easily be integrated into software  packages by incorporated programming languages, and thus should be of  great interest for practitioners as well as scientists working in the  field of project management. \u003cbr\u003e  The book is divided into two parts. In Part I, the project management  process is described and the management tasks to be accomplished  during project planning and control are discussed. This allows for  identifying the major scheduling problems arising in the planning  process, among which the resource-constrained project scheduling  problem is the most important. Part II deals with efficient  computer-based procedures for the resource-constrained project  scheduling problem and its generalized version. Since both problems  are NP-hard, the development of such procedures which yield  satisfactory solutions in a reasonable amount of computation time is  very challenging, and a number of new and very promising approaches  are introduced. This includes heuristic procedures based on priority  rules and tabu search as well as lower bound methods and branch and  bound procedures which can be applied for computing optimal solutions.\u003c\/p\u003e \u003ch3\u003eDetails\u003c\/h3\u003e \u003cp\u003ePublished by: Springer\u003c\/p\u003e \u003cp\u003ePublication Date: 2012-10-11\u003c\/p\u003e \u003cp\u003eFormat: Paperback\u003c\/p\u003e \u003cp\u003eISBN-13: 9781461370932\u003c\/p\u003e \u003cp\u003eDOI: 10.1007\/978-1-4615-4629-0\u003c\/p\u003e \u003cp\u003eDimensions: 235cm x155cm\u003c\/p\u003e \u003cp\u003ePages: 369\u003c\/p\u003e ","brand":"Springer US","offers":[{"title":"Default Title","offer_id":44358934397068,"sku":"9781461370932","price":197.99,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0710\/9545\/1788\/files\/9781461370932.jpg?v=1775704481","url":"https:\/\/lateknightbooks.com\/products\/9781461370932","provider":"Late Knight Books and Services, LLC","version":"1.0","type":"link"}