برای استفاده از امکانات سیستم، گزینه جاوا اسکریپت در مرورگر شما باید فعال باشد
صفحه
از
0
Scheduling : Theory, Algorithms, and Systems
Pinedo, Michael L.
اطلاعات کتابشناختی
Scheduling : Theory, Algorithms, and Systems
Author :
Pinedo, Michael L.
Publisher :
Springer,
Pub. Year :
2016
Subjects :
Operations research. Management science. Industrial engineering. Production...
Call Number :
TS 157 .5 .P56 2016a
جستجو در محتوا
ترتيب
شماره صفحه
امتياز صفحه
فهرست مطالب
Preface
(8)
Preface to the First Edition
(8)
Preface to the Second Edition
(9)
Preface to the Third Edition
(10)
Preface to the Fourth Edition
(11)
Preface to the Fifth Edition
(13)
Contents
(14)
Supplementary Electronic Material
(20)
1 Introduction
(22)
1.1 The Role of Scheduling
(22)
1.2 The Scheduling Function in an Enterprise
(25)
1.3 Outline of the Book
(28)
Part I Deterministic Models
(32)
2 Deterministic Models: Preliminaries
(33)
2.1 Framework and Notation
(33)
2.2 Examples
(40)
2.3 Classes of Schedules
(41)
2.4 Complexity Hierarchy
(45)
3 Single Machine Models (Deterministic)
(53)
3.1 The Total Weighted Completion Time
(54)
3.2 The Maximum Lateness
(60)
3.3 The Number of Tardy Jobs
(65)
3.4 The Total Tardiness - Dynamic Programming
(69)
3.5 The Total Tardiness - An Approximation Scheme
(73)
3.6 The Total Weighted Tardiness
(76)
3.7 Online Scheduling
(79)
3.8 Discussion
(84)
4 Advanced Single Machine Models (Deterministic)
(90)
4.1 The Total Earliness and Tardiness
(91)
4.2 Primary and Secondary Objectives
(98)
4.3 Multiple Objectives: A Parametric Analysis
(100)
4.4 The Makespan with Sequence Dependent SetupTimes
(103)
4.5 Job Families with Setup Times
(112)
4.6 Batch Processing
(119)
4.7 Discussion
(125)
5 Parallel Machine Models (Deterministic)
(131)
5.1 The Makespan without Preemptions
(132)
5.2 The Makespan with Preemptions
(142)
5.3 The Total Completion Time without Preemptions
(149)
5.4 The Total Completion Time with Preemptions
(153)
5.5 Due Date Related Objectives
(155)
5.6 Online Scheduling
(157)
5.7 Discussion
(161)
6 Flow Shops and Flexible Flow Shops (Deterministic)
(169)
6.1 Flow Shops with Unlimited Intermediate Storage
(170)
6.2 Flow Shops with Limited Intermediate Storage
(180)
6.3 Proportionate Flow Shops with Unlimited and Limited Intermediate Storage
(186)
6.4 Flexible Flow Shops with Unlimited Intermediate Storage
(192)
6.5 Discussion
(194)
7 Job Shops (Deterministic)
(200)
7.1 Disjunctive Programming and Branch-and-Bound
(200)
7.2 The Shifting Bottleneck Heuristic and the Makespan
(210)
7.3 The Shifting Bottleneck Heuristic and the Total Weighted Tardiness
(218)
7.4 Constraint Programming and the Makespan
(224)
7.5 Discussion
(231)
8 Open Shops (Deterministic)
(238)
8.1 The Makespan without Preemptions
(238)
8.2 The Makespan with Preemptions
(242)
8.3 The Maximum Lateness without Preemptions
(245)
8.4 The Maximum Lateness with Preemptions
(249)
8.5 The Number of Tardy Jobs
(254)
8.6 Discussion
(255)
Part II Stochastic Models
(260)
9 Stochastic Models: Preliminaries
(261)
9.1 Framework and Notation
(261)
9.2 Distributions and Classes of Distributions
(262)
9.3 Stochastic Dominance
(266)
9.4 Impact of Randomness on Fixed Schedules
(269)
9.5 Classes of Policies
(273)
10 Single Machine Models (Stochastic)
(280)
10.1 Arbitrary Distributions without Preemptions
(280)
10.2 Arbitrary Distributions with Preemptions: the Gittins Index
(287)
10.3 Likelihood Ratio Ordered Distributions
(292)
10.4 Exponential Distributions
(295)
10.5 Discussion
(302)
11 Single Machine Models with Release Dates (Stochastic)
(307)
11.1 Arbitrary Release Dates and Arbitrary Processing Times without Preemptions
(308)
11.2 Priority Queues, Work Conservation, and Poisson Releases
(310)
11.3 Arbitrary Releases and Exponential Processing Times with Preemptions
(314)
11.4 Poisson Releases and Arbitrary Processing Times without Preemptions
(320)
11.5 Discussion
(326)
12 Parallel Machine Models (Stochastic)
(332)
12.1 The Makespan and Total Completion Time withoutPreemptions
(333)
12.2 The Makespan and Total Completion Time with Preemptions
(342)
12.3 Due Date Related Objectives
(352)
12.4 Bounds Obtained through Online Scheduling
(353)
12.5 Discussion
(356)
13 Flow Shops, Job Shops and Open Shops (Stochastic)
(362)
13.1 Stochastic Flow Shops with Unlimited Intermediate Storage
(363)
13.2 Stochastic Flow Shops with Blocking
(369)
13.3 Stochastic Job Shops
(374)
13.4 Stochastic Open Shops
(375)
13.5 Discussion
(381)
Part III Scheduling in Practice
(386)
14 General Purpose Procedures for Deterministic Scheduling
(387)
14.1 Dispatching Rules
(388)
14.2 Composite Dispatching Rules
(389)
14.3 Local Search: Simulated Annealing and Tabu-Search
(394)
14.4 Local Search: Genetic Algorithms
(401)
14.5 Ant Colony Optimization
(403)
14.6 Discussion
(405)
15 More Advanced General Purpose Procedures
(411)
15.1 Beam Search
(412)
15.2 Decomposition Methods and Rolling Horizon Procedures
(414)
15.3 Constraint Programming
(419)
15.4 Market-Based and Agent-Based Procedures
(423)
15.5 Procedures for Scheduling Problems with Multiple Objectives
(430)
15.6 Discussion
(436)
16 Modeling and Solving Scheduling Problems in Practice
(442)
16.1 Scheduling Problems in Practice
(443)
16.2 Cyclic Scheduling of a Flow Line
(446)
16.3 Scheduling of a Flexible Flow Line with Limited Buffers and Bypass
(451)
16.4 Scheduling of a Flexible Flow Line with Unlimited Buffers and Setups
(456)
16.5 Scheduling a Bank of Parallel Machines with Jobs having Release Dates and Due Dates
(463)
16.6 Discussion
(465)
17 Design and Implementation of Scheduling Systems: Basic Concepts
(470)
17.1 Systems Architecture
(471)
17.2 Databases, Object Bases, and Knowledge-Bases
(473)
17.3 Modules for Generating Schedules
(478)
17.4 User Interfaces and Interactive Optimization
(481)
17.5 Generic Systems vs. Application-Specific Systems
(487)
17.6 Implementation and Maintenance Issues
(490)
18 Design and Implementation of Scheduling Systems: More Advanced Concepts
(495)
18.1 Robustness and Reactive Decision-Making
(496)
18.2 Machine Learning Mechanisms
(501)
18.3 Design of Scheduling Engines and AlgorithmLibraries
(506)
18.4 Reconfigurable Systems
(510)
18.5 Web-Based Scheduling Systems
(512)
18.6 Discussion
(515)
19 Examples of System Designs and Implementations
(519)
19.1 SAP's Production Planning and Detailed Scheduling System
(520)
19.2 IBM's Independent Agents Architecture
(524)
19.3 Real Time Dispatching and Agent Scheduling at AMD
(527)
19.4 ASPROVA Advanced Planning and Scheduling
(533)
19.5 Preactor Planning and Scheduling Systems
(537)
19.6 ORTEMS' Agile Manufacturing Suite
(542)
19.7 LEKIN - A System Developed in Academia
(546)
19.8 Discussion
(553)
20 What Lies Ahead?
(555)
20.1 Theoretical Research
(555)
20.2 Applied Research
(558)
20.3 Systems Development
(561)
Appendices
(565)
Mathematical Programming: Formulations and Applications
(566)
A.1 Linear Programming Formulations
(566)
A.2 Integer Programming Formulations
(570)
A.3 Bounds, Approximations, and Heuristics Based on Linear Programming
(574)
A.4 Disjunctive Programming Formulations
(576)
Deterministic and Stochastic Dynamic Programming
(579)
B.1 Deterministic Dynamic Programming
(579)
B.2 Stochastic Dynamic Programming
(583)
Constraint Programming
(585)
C.1 Constraint Satisfaction
(585)
C.2 Constraint Programming
(587)
C.3 An Example of a Constraint Programming Language
(589)
C.4 Constraint Programming vs. Mathematical Programming
(590)
Complexity Theory
(593)
D.1 Preliminaries
(593)
D.2 Polynomial Time Solutions versus NP-Hardness
(596)
D.3 Examples
(599)
D.4 Approximation Algorithms and Schemes
(602)
Complexity Classification of Deterministic SchedulingProblems
(607)
Overview of Stochastic Scheduling Problems
(611)
Selected Scheduling Systems
(616)
The Lekin System
(619)
H.1 Formatting of Input and Output Files
(619)
H.2 Linking Scheduling Programs
(621)
References
(626)
Author Index
(662)
Subject Index
(669)
