調(diào)度：原理算法和系統(tǒng)（第2版影印版國(guó)外大學(xué)優(yōu)秀教材）

定　價(jià)：￥58.00

作　者：	（美）平多
出版社：	清華大學(xué)出版社
叢編項(xiàng)：	工業(yè)工程系列
標(biāo)　簽：	算法

購(gòu)買這本書(shū)可以去

ISBN：	9787302120438	出版時(shí)間：	2005-10-01	包裝：	平裝
開(kāi)本：	16開(kāi)	頁(yè)數(shù)：	586	字?jǐn)?shù)：

內(nèi)容簡(jiǎn)介

　　本書(shū)以生產(chǎn)調(diào)度的基本理論及其應(yīng)用為主，介紹了與調(diào)度相關(guān)的若干基本算法模型及其在實(shí)際中的應(yīng)用。內(nèi)容涵蓋了確定性調(diào)度模型、隨機(jī)調(diào)度模型、調(diào)度理論的應(yīng)用等三部分。內(nèi)容及難度適合工業(yè)工程、物流工程、企業(yè)管理等專業(yè)的高年級(jí)本科生或研究生及相關(guān)的工程技術(shù)人員。...

作者簡(jiǎn)介

暫缺《調(diào)度：原理算法和系統(tǒng)（第2版影印版國(guó)外大學(xué)優(yōu)秀教材）》作者簡(jiǎn)介

圖書(shū)目錄

PREFACE
1INTRODUCTION.
1.1TheRoleofScheduling
1.2TheSchedulingFunctioninanEnterprise
1.3OutlineoftheBook
Part1DeterministicModels
2DETERMINISTICMODELS:PRELIMINARIES
2.1FrameworkandNotation
2.2Examples
2.3ClassesofSchedules
2.4ComplexityHierarchy
3SINGLEMACHINEMODELS(DETERMINISTIC)
3.1TheTotalWeightedCompletionTune
3.2TheMaximumLateness
3.3TheNumberofTardyJobs
3.4TheTotalTardiness
3.5TheTotalWeightedTardiness
3.6Discussion
4MOREADVANCEDSINGLEMACHINEMODELS(DETERMINISTIC)
4.1TheTotalTardiness:AnApproximationScheme
4.2TheTotalEarlinessandTardiness
4.3PrimaryandSecondaryObjectives
4.4MultipleObjectives:AParametricAnalysis
4.5TheMakespanwithSequence-DependentSetupTimes
4.6Discussion
5PARALLELMACHINEMODELS(DETERMINISTIC)
5.1TheMakespanwithoutPreemptions
5.2TheMakespanwithPreemptions
5.3TheTotalCompletionTunewithoutPreemptions
5.4TheTotalCompletionTunewithPreemptions
5.5DueDate-RelatedObjectives
5.6Discussion
6FLOWSHOPSANDFLEXIBLEFLOWSHOPS(DETERMINISTIC)
6.1FlowShopswithUnlimitedIntermediateStorage
6.2FlowShopswithLimitedIntermediateStorage
6.3FlexibleFlowShopswithUnlimitedIntermediateStorage
7JOBSHOPS(DETERMINISTIC)
7.1DisjunctiveProgrammingandBranchandBound
7.2TheShiftingBottleneckHeuristicandtheMakespan
7.3TheShiftingBottleneckHeuristicandtheTotalWeightedTardiness
7.4Discussion
8OPENSHOPS(DETERMINISTIC)
8.1TheMakespanwithoutPreemptions
8.2TheMakespanwithPreemptions
8.3TheMaximumLatenesswithoutPreemptions
8.4TheMaximumLatenesswithPreemptions
8.5TheNumberofTardyJobs
8.6Discussion
Part2StochasticModels
9STOCHASTICMODELS:PRELIMINARIES
9.1FrameworkandNotation
9.2DistributionsandClassesofDistributions
9.3StochasticDominance
9.4ImpactofRandomnessonFixedSchedules
9.5ClassesofPolicies
10SINGLEMACHINEMODELS(STOCHASTIC)
10.1ArbitraryDistributionswithoutPreemptions
10.2ArbitraryDistributionswithPreemptions:TheGittinsIndex
10.3LikelihoodRa6oOrderedDistributions
10.4ExponentialDistributions
11SINGLEMACHINEMODELSWITHRELEASEDATES(STOCHASTIC)
11.1ArbitraryReleasesandArbitraryProcessingTimes
11.2PriorityQueues,WorkConservation,andPoissonReleases
11.3ArbitraryReleasesandExponentialProcessingTimes
11.4PoissonReleasesandArbitraryProcessingTimes
11.5Discussion..
12PARALLELMACHINEMODELS(STOCHASTIC)
12.1TheMakespanwithoutPreemptions
12.2TheMakespanandTotalCompletionTimewithPreemptions
12.3DueDate-RelatedObjectives
13FLOWSHOPS,JOBSHOPS,ANDOPENSHOPS(STOCHASTIC)
13.1StochasticFlowShopswithUnlimitedIntermediateStorage
13.2StochasticFlowShopswithBlocking
13.3StochasticJobShops
13.4StochasticOpenShops
Part3SchedulinginPractice
14GENERALPURPOSEPROCEDURESFORSCHEDULINGINPRACTICE
14.1DispatchingRules
14.2CompositeDispatchingRules
14.3FilteredBeamSearch
14.4LocalSearch:SimulatedAnnealingandTabu-Search
14.5LocalSearch:GeneticAlgorithms
14.6Discussion
15MOREADVANCEDGENERALPURPOSEPROCEDURES
15.1DecompositionMethodsandRollingHorizonProcedures
15.2ConstraintGuidedHeuristicSearch
15.3Market-BasedandAgent-BasedProcedures
15.4ProceduresforSchedulingProblemswithMultipleObjectives
15.5Discussion
16MODELINGANDSOLVINGSCHEDULINGPROBLEMSINPRACTICE
16.1SchedulingProblemsinPractice
16.2CyclicSchedulingofaFlowLine
16.3FlexibleFlowLinewithLimitedBuffersandBypass
16.4FlexibleFlowLinewithUnlimitedBuffersandSetups
16.5BankofParallelMachineswithReleaseDatesandDueDates
16.6Discussion
17DESIGN,DEVELOPMENT,ANDIMPLEMENTATIONOFSCHEDULINGSYSTEMS
17.1SystemsArchitecture
17.2DatabasesandKnowledge-Bases
17.3ScheduleGenerationIssues
17.4UserInterfacesandInteractiveOptimization
17.5GenericSystemsVersusApplication-SpecificSystems
17.6ImplementationandMaintenanceIssues
18ADVANCEDCONCEPTSINSCHEDULINGSYSTEMDESIGN
18.1RobustnessandReactiveScheduling
18.2MachineLearningMechanisms
18.3DesignofSchedulingEnginesandAlgorithmLibraries
18.4ReconfigurableSystems
18.5SchedulingSystemsontheIntemet
18.6Discussion
19EXAMPLESOFSYSTEMDESIGNSANDIMPLEMENTATIONS
19.1TheSAP-APOSystem
19.2IBM'sIndependentAgentsArchitecture
19.3i2'sTradeMatrixProductionScheduler
19.4AnImplementationofCybertec'sCyberplan
19.5Synquest'sV'trtualProductionEngine
19.6TheLEKINSystemforResearchandTeaching
19.7Discussion
20WHATLIESAHEAD?
20.1TheoreticalResearch
20.2AppliedResearch
20.3SystemsDevelopmentandIntegration
APPENDIXES
AMATHEMATICALPROGRAMMING:FORMULATIONSANDAPPLICATIONS
A.1LinearProgrammingFormulations
A.2IntegerProgrammingFormulations
A.3DisjunctiveProgrammingFormulations
BDETERMINISTICANDSTOCHASTICDYNAMICPROGRAMMING
B.1DeterministicDynamicProgramming
B.2StochasticDynamicProgramming
CCOMPLEXITYTHEORY
C.1Preliminaries
C.2PolynomialTuneSolutionsVersusNP-Hardness
C.3Examples
DCOMPLEXITYCLASSIFICATIONOFDETERMINISTICSCHEDULINGPROBLEMS
EOVERVIEWOFSTOCHASTICSCHEDULINGPROBLEMS
FSELECTEDSCHEDULINGSYSTEMS...
REFERENCES
NAMEINDEX
SUBJECTINDEX