Aimed at graduate students and practitioners, this text covers both theoretical and applied aspects of the scheduling of resources in the manufacturing and service industries. Drawing upon his experience in developing courses at Columbia U., Pinedo discusses deterministic and stochastic models for parallel machine models, flexible flow shops, and open shops. The second edition also features five new chapters on such topics as single machine scheduling with release dates and rolling horizon procedures. Annotation c. Book News, Inc., Portland, OR (booknews.com)

zlibzh/no-category/（美）平多（MICHAELPINEDO）著, 美]Michael Pinedo著, 平多, Nedo Pi/调度 原理、算法和系统_30341920.pdf

Scheduling: Theory, Algorithms, and Systems (2nd Edition)

调度 : 原理, 算法和系统 : [英文本

Globe Fearon Educational Publishing

Tsinghua University Press

Qinghua University Press

Longman Publishing

Prentice Hall

Cengage Gale

Prentice-Hall international series in industrial and systems engineering, 2nd ed, Upper Saddle, N.J, ©2002

Guo wai da xue you xiu jiao cai. gong ye gong cheng xi lie, Ying yin ban, Beijing, 2005

2. ed., English repr. ed, Upper Saddle River, NJ, 2005

2nd ed., Upper Saddle, N.J, New Jersey, July 15, 1994

United States, United States of America

2nd ed, Upper Saddle River, N.J, ©2002

China, People's Republic, China

2 edition, July 15, 1994

国外大学优秀教材, Beijing, 2005

Subsequent, PT, 2001

2, 2001-08-08

Bookmarks: p1 (p1): 1 INTRODUCTION
p1-1 (p1): 1.1 The Role of Scheduling
p1-2 (p4): 1.2 The Scheduling Function in an Enterprise
p1-3 (p6): 1.3 Outline of the Book
p2 (p11): Part 1 Deterministic Models
p2-1 (p13): 2 DETERMINISTIC MODELS:PRELIMINARIES
p2-1-1 (p14): 2.1 Framework and Notation
p2-1-2 (p20): 2.2 Examples
p2-1-3 (p21): 2.3 Classes of Schedules
p2-1-4 (p26): 2.4 Complexity Hierarchy
p2-2 (p33): 3 SINGLE MACHINE MODELS(DETERMINISTIC）
p2-2-1 (p34): 3.1 The Total Weighted Completion Time
p2-2-2 (p40): 3.2 The Maximum Lateness
p2-2-3 (p46): 3.3 The Number of Tardy Jobs
p2-2-4 (p49): 3.4 The Total Tardiness
p2-2-5 (p53): 3.5 The Total Weighted Tardiness
p2-2-6 (p57): 3.6 Discussion
p2-3 (p62): 4 MORE ADVANCED SINGLE MACHINE MODELS(DETERMINISTIC）
p2-3-1 (p63): 4.1 The Total Tardiness:An Approximation Scheme
p2-3-2 (p66): 4.2 The Total Earliness and Tardiness
p2-3-3 (p74): 4.3 Primary and Secondary Objectives
p2-3-4 (p76): 4.4 Multiple Objectives:A Parametric Analysis
p2-3-5 (p79): 4.5 The Makespan with Sequence-Dependent Setup Times
p2-3-6 (p88): 4.6 Discussion
p2-4 (p93): 5 PARALLEL MACHINE MODELS(DETERMINISTIC)
p2-4-1 (p94): 5.1 The Makespan without Preemptions
p2-4-2 (p105): 5.2 The Makespan with Preemptions
p2-4-3 (p112): 5.3 The Total Completion Time without Preemptions
p2-4-4 (p116): 5.4 The Total Completion Time with Preemptions
p2-4-5 (p119): 5.5 Due Date-Related Objectives
p2-4-6 (p121): 5.6 Discussion
p2-5 (p129): 6 FLOW SHOPS AND FLEXIBLE FLOW SHOPS(DETERMINISTIC)
p2-5-1 (p130): 6.1 Flow Shops with Unlimited Intermediate Storage
p2-5-2 (p142): 6.2 Flow Shops with Limited Intermediate Storage
p2-5-3 (p150): 6.3 Flexible Flow Shops with Unlimited Intermediate Storage
p2-6 (p156): 7 JOB SHOPS(DETERMINISTIC)
p2-6-1 (p157): 7.1 Disjunctive Programming and Branch and Bound
p2-6-2 (p167): 7.2 The Shifting Bottleneck Heuristic and the Makespan
p2-6-3 (p174): 7.3 The Shifting Bottleneck Heuristic and the Total Weighted Tardiness
p2-6-4 (p181): 7.4 Discussion
p2-7 (p186): 8 OPEN SHOPS(DETERMINISTIC)
p2-7-1 (p187): 8.1 The Makespan without Preemptions
p2-7-2 (p191): 8.2 The Makespan with Preemptions
p2-7-3 (p193): 8.3 The Maximum Lateness without Preemptions
p2-7-4 (p198): 8.4 The Maximum Lateness with Preemptions
p2-7-5 (p203): 8.5 The Number of Tardy Jobs
p2-7-6 (p204): 8.6 Discussion
p3 (p209): Part 2 Stochastic Models
p3-1 (p211): 9 STOCHASTIC MODELS:PRELIMINARIES
p3-1-1 (p212): 9.1 Framework and Notation
p3-1-2 (p212): 9.2 Distributions and Classes of Distributions
p3-1-3 (p217): 9.3 Stochastic Dominance
p3-1-4 (p220): 9.4 Impact of Randomness on Fixed Schedules
p3-1-5 (p223): 9.5 Classes of Policies
p3-2 (p231): 10 SINGLE MACHINE MODELS(STOCHASTIC)
p3-2-1 (p231): 10.1 Arbitrary Distributions without Preemptions
p3-2-2 (p238): 10.2 Arbitrary Distributions with Preemptions:The Gittins Index
p3-2-3 (p243): 10.3 Likelihood Ratio Ordered Distributions
p3-2-4 (p247): 10.4 Exponential Distributions
p3-3 (p258): 11 SINGLE MACHINE MODELS WITH RELEASE DATES(STOCHASTIC)
p3-3-1 (p259): 11.1 Arbitrary Releases and Arbitrary Processing Times
p3-3-2 (p261): 11.2 Priority Queues,Work Conservation,and Poisson Releases
p3-3-3 (p266): 11.3 Arbitrary Releases and Exponential Processing Times
p3-3-4 (p272): 11.4 Poisson Releases and Arbitrary Processing Times
p3-3-5 (p278): 11.5 Discussion
p3-4 (p283): 12 PARALLEL MACHINE MODELS(STOCHASTIC)
p3-4-1 (p284): 12.1 The Makespan without Preemptions
p3-4-2 (p293): 12.2 The Makespan and Total Completion Time with Preemptions
p3-4-3 (p302): 12.3 Due Date-Related Objectives
p3-5 (p308): 13 FLOW SHOPS,JOB SHOPS,AND OPEN SHOPS(STOCHASTIC)
p3-5-1 (p309): 13.1 Stochastic Flow Shops with Unlimited Intermediate Storage
p3-5-2 (p316): 13.2 Stochastic Flow Shops with Blocking
p3-5-3 (p321): 13.3 Stochastic Job Shops
p3-5-4 (p322): 13.4 Stochastic Open Shops
p4 (p333): Part 3 Scheduling in Practice
p4-1 (p335): 14 GENERAL PURPOSE PROCEDURES FOR SCHEDULING IN PRACTICE
p4-1-1 (p336): 14.1 Dispatching Rules
p4-1-2 (p338): 14.2 Composite Dispatching Rules
p4-1-3 (p342): 14.3 Filtered Beam Search
p4-1-4 (p345): 14.4 Local Search:Simulated Annealing and Tabu-Search
p4-1-5 (p352): 14.5 Local Search:Genetic Algorithms
p4-1-6 (p353): 14.6 Discussion
p4-2 (p359): 15 MORE ADVANCED GENERAL PURPOSE PROCEDURES
p4-2-1 (p360): 15.1 Decomposition Methods and Rolling Horizon Procedures
p4-2-2 (p364): 15.2 Constraint Guided Heuristic Search
p4-2-3 (p373): 15.3 Market-Based and Agent-Based Procedures
p4-2-4 (p380): 15.4 Procedures for Scheduling Problems with Multiple Objectives
p4-2-5 (p386): 15.5 Discussion
p4-3 (p391): 16 MODELING AND SOLVING SCHEDULING PROBLEMS IN PRACTICE
p4-3-1 (p392): 16.1 Scheduling Problems in Practice
p4-3-2 (p396): 16.2 Cyclic Scheduling of a Flow Line
p4-3-3 (p401): 16.3 Flexible Flow Line with Limited Buffers and Bypass
p4-3-4 (p407): 16.4 Flexible Flow Line with Unlimited Buffers and Setups
p4-3-5 (p413): 16.5 Bank of Parallel Machines with Release Dates and Due Dates
p4-3-6 (p414): 16.6 Discussion
p4-4 (p419): 17 DESIGN,DEVELOPMENT,AND IMPLEMENTATION OF SCHEDULING SYSTEMS
p4-4-1 (p420): 17.1 Systems Architecture
p4-4-2 (p421): 17.2 Databases and Knowledge-Bases
p4-4-3 (p426): 17.3 Schedule Generation Issues
p4-4-4 (p429): 17.4 User Interfaces and Interactive Optimization
p4-4-5 (p435): 17.5 Generic Systems Versus Application-Specific Systems
p4-4-6 (p438): 17.6 Implementation and Maintenance Issues
p4-5 (p444): 18 ADVANCED CONCEPTS IN SCHEDULING SYSTEM DESIGN
p4-5-1 (p445): 18.1 Robustness and Reactive Scheduling
p4-5-2 (p450): 18.2 Machine Learning Mechanisms
p4-5-3 (p455): 18.3 Design of Scheduling Engines and Algorithm Libraries
p4-5-4 (p459): 18.4 Reconfigurable Systems
p4-5-5 (p461): 18.5 Scheduling Systems on the Internet
p4-5-6 (p464): 18.6 Discussion
p4-6 (p468): 19 EXAMPLES OF SYSTEM DESIGNS AND IMPLEMENTATIONS
p4-6-1 (p469): 19.1 The SAP-APO System
p4-6-2 (p472): 19.2 IBM's Independent Agents Architecture
p4-6-3 (p476): 19.3 i2's TradeMatrix Production Scheduler
p4-6-4 (p483): 19.4 An Implementation of Cybertec's Cyberplan
p4-6-5 (p488): 19.5 Synquest's Virtual Production Engine
p4-6-6 (p493): 19.6 The LEKIN System for Research and Teaching
p4-6-7 (p500): 19.7 Discussion
p4-7 (p502): 20 WHAT LIES AHEAD?
p4-7-1 (p503): 20.1 Theoretical Research
p4-7-2 (p505): 20.2 Applied Research
p4-7-3 (p507): 20.3 Systems Development and Integration
p5 (p511): APPENDIXES
p5-1 (p513): A MATHEMATICAL PROGRAMMING:FORMULATIONS AND APPLICATIONS
p5-1-1 (p513): A.1 Linear Programming Formulations
p5-1-2 (p518): A.2 Integer Programming Formulations
p5-1-3 (p522): A.3 Disjunctive Programming Formulations
p5-2 (p525): B DETERMINISTIC AND STOCHASTIC DYNAMIC PROGRAMMING
p5-2-1 (p525): B.1 Deterministic Dynamic Programming
p5-2-2 (p529): B.2 Stochastic Dynamic Programming
p5-3 (p533): C COMPLEXITY THEORY
p5-3-1 (p533): C.1 Preliminaries
p5-3-2 (p536): C.2 Polynomial Time Solutions Versus NP-Hardness
p5-3-3 (p539): C.3 Examples
p5-4 (p543): D COMPLEXITY CLASSIFICATION OF DETERMINISTIC SCHEDULING PROBLEMS
p5-5 (p547): E OVERVIEW OF STOCHASTIC SCHEDULING PROBLEMS
p5-6 (p551): F SELECTED SCHEDULING SYSTEMS
p6 (p555): REFERENCES
p7 (p577): NAME INDEX
p8 (p582): SUBJECT INDEX

related_files:
filepath:调度 原理、算法和系统 第2版 影印本=SCHEDULING THEORY,ALGORITHMS,AND SYSTEMS SECOND EDITION_13666838.zip — md5:2e80236e4c4dbfcae783488cdc14abf7 — filesize:108859975
filepath:调度 原理、算法和系统 第2版 影印本=SCHEDULING THEORY,ALGORITHMS,AND SYSTEMS SECOND EDITION_13666838.zip — md5:2a58c8d7a48db815088fbf73a9754934 — filesize:108859975
filepath:/读秀/读秀4.0/读秀/4.0/数据库11-2/调度 原理、算法和系统 第2版 影印本=SCHEDULING THEORY,ALGORITHMS,AND SYSTEMS SECOND EDITION_13666838.zip
filepath:_13666838.zip — md5:c5c02244e376a00f55680d52ba68c88c — filesize:108658490
filepath:_13666838.zip — md5:a2aa03bc020794d43be9271798ccc092 — filesize:108658490
filepath:13666838.zip — md5:dc511349faec9e4768673b7312846048 — filesize:108582212
filepath:13666838.rar — md5:197a4a02f500dff506899d53b1a2e596 — filesize:108696940
filepath:13666838.rar — md5:bd85957cab359a69cfff214c4a499eb4 — filesize:108693948
filepath:13666838.zip — md5:fbcfdb205lfadea613a7252fe1ccf69c — filesize:108582212
filepath:/读秀/读秀3.0/读秀/3.0/3.0补充/第四部分/其余书库等多个文件/e路有你3/93/13666838.zip

Includes bibliographical references (p. 555-576) and indexes.

Focusing on theory and applications of scheduling, the applications are drawn primarily from production and manufacturing environments, but state principles that are relevant to other settings as well. The broad range of topics includes deterministic and stochastic models

This book is the result of the development of courses in scheduling theory and applications at Columbia University. This book deals primarily with machine scheduling models.

本书以生产调度的基本理论及其应用为主, 介绍了与调度相关的若干基本算法模型及其在实际中的应用

2024-06-13