《Detailed Table of ContentsTuck.doc》由会员分享，可在线阅读，更多相关《Detailed Table of ContentsTuck.doc（5页珍藏版）》请在三一办公上搜索。
1、TABLE OF CONTENTSFront MatterChapters1.Introduction1.1.Introduction to Sequencing and Scheduling1.2.Scheduling Theory1.3.Philosophy and Coverage of the Book2.Single-Machine Sequencing2.1.Introduction2.2.Preliminaries2.3.Problems without Due Dates: Elementary Results2.3.1Flowtime and Inventory2.3.2Mi
2、nimizing Total Flowtime2.3.3Minimizing Total Weighted Flowtime2.4.Problems with Due Dates: Elementary Results2.4.1Lateness Criteria2.4.2Minimizing the Number of Tardy Jobs2.4.3Minimizing Total Tardiness2.4.4Due Dates as Decisions2.5.Summary3.Optimization Methods for the Single-Machine Problem3.1.Int
3、roduction3.2.Adjacent Pairwise Interchange Methods3.3.A Dynamic Programming Approach3.4.Dominance Properties3.5.A Branch and Bound Approach3.6.Summary4.Heuristic Methods for the Single-Machine Problem4.1.Introduction4.2.Dispatching and Construction Procedures4.3.Random Sampling4.4.Neighborhood Searc
4、h Techniques4.5.Tabu Search4.6.Simulated Annealing4.7.Genetic Algorithms4.8.The Evolutionary Solver4.9.Summary5.Earliness and Tardiness Costs5.1.Introduction5.2.Minimizing Deviations from a Common Due Date5.2.1.Four Basic Results5.2.2.Due Dates as Decisions5.3.The Restricted Version5.4.Asymmetric Ea
5、rliness and Tardiness Costs5.5.Quadratic Costs5.6.Job-Dependent Costs5.7.Distinct Due Dates5.8.Summary6.Sequencing for Stochastic Scheduling6.1.Introduction6.2Basic Stochastic Counterpart Models6.3.The Deterministic Counterpart 6.4.Minimizing the Maximum Cost 6.5.The Jensen Gap6.6.Stochastic Dominan
6、ce and Association6.7.Using Risk Solver6.8.Summary7.Safe Scheduling7.1Introduction7.2Meeting Service-Level Targets7.3Trading Off Tightness and Tardiness7.4The Stochastic E/T Problem7.5Setting Release Dates7.6The Stochastic U-problem: A Service-Level Approach7.7The Stochastic U-problem: An Economic A
7、pproach7.8Summary8.Extensions of the Basic Model8.1.Introduction8.2.Nonsimultaneous Arrivals8.2.1.Minimizing the Makespan8.2.2.Minimizing Maximum Tardiness8.2.3.Other Measures of Performance8.3.Related Jobs8.3.1.Minimizing Maximum Tardiness8.3.2.Minimizing Total Flowtime with Strings8.3.3.Minimizing
8、 Total Flowtime with Parallel Chains8.4.Sequence-Dependent Setup Times8.4.1.Dynamic Programming Solutions8.4.2.Branch and Bound Solutions8.4.3.Heuristic Solutions8.5.Stochastic Models with Sequence-Dependent Setup Times8.5.1.Setting Tight Due Dates8.5.2.Revisiting the Tightness-Tardiness Trade Off8.
9、6.Summary9.Parallel-Machine Models9.1.Introduction9.2.Minimizing the Makespan9.2.1.Nonpreemptable Jobs9.2.2.Nonpreemptable Related Jobs9.2.3.Preemptable Jobs9.3.Minimizing Total Flowtime9.4.Stochastic Models9.4.1.The Makespan Problem with Exponential Processing Times9.4.2.Safe Scheduling with Parall
10、el Machines9.5.Summary10.Flow Shop Scheduling10.1.Introduction10.2.Permutation Schedules10.3.The Two-Machine Problem10.3.1.Johnsons Rule10.3.2.A Proof of Johnsons Rule10.3.3.The Model with Time Lags10.3.4.The Model with Setups10.4.Special Cases of the Three-Machine Problem10.5.Minimizing the Makespa
11、n10.5.1.Branch and Bound Solutions10.5.2.Heuristic Solutions10.6.Variations of the m-Machine Model10.6.1.Ordered Flow Shops10.6.2.Flow Shops with Blocking10.6.3.No-Wait Flow Shops10.7.Summary11.Stochastic Flow Shop Scheduling11.1.Introduction11.2.Stochastic Counterpart Models11.3.Safe Scheduling Mod
12、els with Stochastic Independence11.4.Flow Shops with Linear Association11.5.Empirical Observations11.6.Summary12.Lot Streaming Procedures for the Flow Shop12.1.Introduction12.2.The Basic Two-Machine Model12.2.1.Preliminaries12.2.2.The Continuous Version12.2.3.The Discrete Version12.2.4.Models with S
13、etups12.3.The Three-Machine Model with Consistent Sublots12.3.2.The Continuous Version12.3.3.The Discrete Version12.4.The Three-Machine Model with Variable Sublots12.4.1.Item and Batch Availability12.4.2.The Continuous Version12.4.3.The Discrete Version12.5.The m-Machine Model with Consistent Sublot
14、s12.5.1.The Two-Sublot Solution12.5.2.A Heuristic Procedure for s Sublots12.6.Summary13.Scheduling Groups of Jobs13.1.Introduction13.2.Scheduling Job Families13.2.1.Minimizing Total Weighted Flowtime13.2.2.Minimizing Maximum Lateness13.2.3.Minimizing Makespan in the Two-Machine Flow Shop13.3.Schedul
15、ing with Batch Availability13.4.Scheduling with a Batch Processor13.4.1.Minimizing the Makespan with Dynamic Arrivals13.4.2.Minimizing Makespan in the Two-Machine Flow Shop13.4.3.Minimizing Total Flowtime with Dynamic Arrivals13.4.4.Batch Dependent Processing Times13.5.Summary14.The Job Shop Problem
16、14.1.Introduction14.2.Types of Schedules14.3.Schedule Generation 14.4.The Shifting Bottleneck Procedure 14.4.1.Bottleneck Machines 14.4.2.Heuristic and Optimal Solutions14.5.Neighborhood Search Heuristics14.6.Summary15.Simulation Models for the Dynamic Job Shop15.1.Introduction15.2.Model Elements15.
17、3.Types of Dispatching Rules 15.4.Reducing Mean Flowtime15.5.Meeting Due Dates15.5.1.Background15.5.2.Some Clarifying Experiments15.5.3.Experimental Results15.6.Summary16.Network Methods for Project Scheduling16.1.Introduction16.2.Logical Constraints and Network Construction16.3.Temporal Analysis of
18、 Networks16.4.The Time/Cost Trade-off16.5.Traditional Probabilistic Network Analysis16.5.1.The PERT Method16.5.2.Theoretical Limitations of PERT16.6Summary17.Resource-Constrained Project Scheduling17.1.Introduction17.2.Extending the Job Shop Model17.3.Extending the Project Model17.4Heuristic Constru
19、ction and Search Algorithms17.4.1.Construction Heuristics17.4.2.Neighborhood Search Improvement Schemes17.4.3.Selecting Priority Lists and Tie-Breakers17.5Summary18.Safe Scheduling for Projects18.1.Introduction18.2.Stochastic Balance Principles for Activity Networks18.2.1.The Assembly Coordination M
20、odel 18.2.2.Balancing General Project Networks18.2.3.Additional Examples18.2.4.Hierarchical Balancing18.3.Crashing Stochastic Activities18.4.SummaryAppendicesA.Practical Processing Time DistributionsA.1.Important Processing Time DistributionsA.1.1The Uniform DistributionA.1.2The Exponential Distribu
21、tionA.1.3The Normal DistributionA.1.4The Lognormal DistributionA.1.5The Parkinson DistributionA.2.Increasing and Decreasing Completion RatesA.3.Stochastic DominanceA.4.Linearly-Associated Processing TimesB.The Critical Ratio RuleB.1.A Basic Trade-Off ProblemB.2.Optimal Policy for Discrete Probabilit
22、y ModelsB.3.A Special Discrete Case: Equally-likely OutcomesB.4.Optimal Policy for Continuous Probability ModelsB.5.A Special Continuous Case: The Normal DistributionB.6.Calculating d + E(T) for the Normal DistributionC.Integer Programming Models for SequencingC.1.IntroductionC.2.The Single-Machine ModelC.2.1Sequence-position DecisionsC.2.2Precedence DecisionsC.2.3Time-indexed DecisionsC.3.The Flow Shop ModelIndex
