加入VIP
  • 专属下载特权
  • 现金文档折扣购买
  • VIP免费专区
  • 千万文档免费下载

上传资料

关闭

关闭

关闭

封号提示

内容

首页 Baker,Trietsch(2009).Principles of Sequencing an…

Baker,Trietsch(2009).Principles of Sequencing and Scheduling[510s].pdf

Baker,Trietsch(2009).Principles…

xiu_zhijun
2011-04-17 0人阅读 举报 0 0 暂无简介

简介:本文档为《Baker,Trietsch(2009).Principles of Sequencing and Scheduling[510s]pdf》,可适用于高等教育领域

PRINCIPLESOFSEQUENCINGANDSCHEDULINGPRINCIPLESOFSEQUENCINGANDSCHEDULINGKennethRBakerTuckSchoolofBusinessDartmouthCollegeHanover,NewHampshireDanTrietschCollegeofEngineeringAmericanUniversityofArmeniaYerevan,ArmeniaAJOHNWILEYSONS,INCPUBLICATIONCopyrightC©byJohnWileySons,IncAllrightsreservedPublishedbyJohnWileySons,Inc,Hoboken,NewJerseyPublishedsimultaneouslyinCanadaNopartofthispublicationmaybereproduced,storedinaretrievalsystem,ortransmittedinanyformorbyanymeans,electronic,mechanical,photocopying,recording,scanning,orotherwise,exceptaspermittedunderSectionoroftheUnitedStatesCopyrightAct,withouteitherthepriorwrittenpermissionofthePublisher,orauthorizationthroughpaymentoftheappropriatepercopyfeetotheCopyrightClearanceCenter,Inc,RosewoodDrive,Danvers,MA,(),fax(),oronthewebatwwwcopyrightcomRequeststothePublisherforpermissionshouldbeaddressedtothePermissionsDepartment,JohnWileySons,Inc,RiverStreet,Hoboken,NJ,(),fax(),oronlineathttp:wwwwileycomgopermissionsLimitofLiabilityDisclaimerofWarranty:Whilethepublisherandauthorhaveusedtheirbesteffortsinpreparingthisbook,theymakenorepresentationsorwarrantieswithrespecttotheaccuracyorcompletenessofthecontentsofthisbookandspecificallydisclaimanyimpliedwarrantiesofmerchantabilityorfitnessforaparticularpurposeNowarrantymaybecreatedorextendedbysalesrepresentativesorwrittensalesmaterialsTheadviceandstrategiescontainedhereinmaynotbesuitableforyoursituationYoushouldconsultwithaprofessionalwhereappropriateNeitherthepublishernorauthorshallbeliableforanylossofprofitoranyothercommercialdamages,includingbutnotlimitedtospecial,incidental,consequential,orotherdamagesForgeneralinformationonourotherproductsandservicesorfortechnicalsupport,pleasecontactourCustomerCareDepartmentwithintheUnitedStatesat(),outsidetheUnitedStatesat()orfax()WileyalsopublishesitsbooksinavarietyofelectronicformatsSomecontentthatappearsinprintmaynotbeavailableinelectronicformatsFormoreinformationaboutWileyproducts,visitourwebsiteatwwwwileycomLibraryofCongressCataloginginPublicationData:Baker,KennethR,–PrinciplesofsequencingandschedulingKennethRBaker,DanTrietschpcmIncludesbibliographicalreferencesandindexISBN(cloth)ProductionschedulingITrietsch,DanIITitleTSB′–dcPrintedintheUnitedStatesofAmericaCONTENTSPrefacexiiiIntroductionIntroductiontoSequencingandScheduling,SchedulingTheory,PhilosophyandCoverageoftheBook,References,SingleMachineSequencingIntroduction,Preliminaries,ProblemsWithoutDueDates:ElementaryResults,FlowtimeandInventory,MinimizingTotalFlowtime,MinimizingTotalWeightedFlowtime,ProblemswithDueDates:ElementaryResults,LatenessCriteria,MinimizingtheNumberofTardyJobs,MinimizingTotalTardiness,DueDatesasDecisions,Summary,References,Exercises,vviCONTENTSOptimizationMethodsfortheSingleMachineProblemIntroduction,AdjacentPairwiseInterchangeMethods,ADynamicProgrammingApproach,DominanceProperties,ABranchandBoundApproach,Summary,References,Exercises,HeuristicMethodsfortheSingleMachineProblemIntroduction,DispatchingandConstructionProcedures,RandomSampling,NeighborhoodSearchTechniques,TabuSearch,SimulatedAnnealing,GeneticAlgorithms,TheEvolutionarySolver,Summary,References,Exercises,EarlinessandTardinessCostsIntroduction,MinimizingDeviationsfromaCommonDueDate,FourBasicResults,DueDatesasDecisions,TheRestrictedVersion,AsymmetricEarlinessandTardinessCosts,QuadraticCosts,JobDependentCosts,DistinctDueDates,Summary,References,Exercises,SequencingforStochasticSchedulingIntroduction,BasicStochasticCounterpartModels,TheDeterministicCounterpart,MinimizingtheMaximumCost,TheJensenGap,StochasticDominanceandAssociation,CONTENTSviiUsingRiskSolver,Summary,References,Exercises,SafeSchedulingIntroduction,MeetingServiceLevelTargets,TradingOffTightnessandTardiness,TheStochasticETProblem,SettingReleaseDates,TheStochasticUProblem:AServiceLevelApproach,TheStochasticUProblem:AnEconomicApproach,Summary,References,Exercises,ExtensionsoftheBasicModelIntroduction,NonsimultaneousArrivals,MinimizingtheMakespan,MinimizingMaximumTardiness,OtherMeasuresofPerformance,RelatedJobs,MinimizingMaximumTardiness,MinimizingTotalFlowtimewithStrings,MinimizingTotalFlowtimewithParallelChains,SequenceDependentSetupTimes,DynamicProgrammingSolutions,BranchandBoundSolutions,HeuristicSolutions,StochasticModelswithSequenceDependentSetupTimes,SettingTightDueDates,RevisitingtheTightnessTardinessTradeoff,Summary,References,Exercises,ParallelMachineModelsIntroduction,MinimizingtheMakespan,NonpreemptableJobs,NonpreemptableRelatedJobs,PreemptableJobs,viiiCONTENTSMinimizingTotalFlowtime,StochasticModels,TheMakespanProblemwithExponentialProcessingTimes,SafeSchedulingwithParallelMachines,Summary,References,Exercises,FlowShopSchedulingIntroduction,PermutationSchedules,TheTwoMachineProblem,Johnson’sRule,AProofofJohnson’sRule,TheModelwithTimeLags,TheModelwithSetups,SpecialCasesofTheThreeMachineProblem,MinimizingtheMakespan,BranchandBoundSolutions,HeuristicSolutions,VariationsofthemMachineModel,OrderedFlowShops,FlowShopswithBlocking,NoWaitFlowShops,Summary,References,Exercises,StochasticFlowShopSchedulingIntroduction,StochasticCounterpartModels,SafeSchedulingModelswithStochasticIndependence,FlowShopswithLinearAssociation,EmpiricalObservations,Summary,References,Exercises,LotStreamingProceduresfortheFlowShopIntroduction,TheBasicTwoMachineModel,Preliminaries,TheContinuousVersion,CONTENTSixTheDiscreteVersion,ModelswithSetups,TheThreeMachineModelwithConsistentSublots,TheContinuousVersion,TheDiscreteVersion,TheThreeMachineModelwithVariableSublots,ItemandBatchAvailability,TheContinuousVersion,TheDiscreteVersion,ComputationalExperiments,TheFundamentalPartition,DefiningtheFundamentalPartition,AHeuristicProcedureforsSublots,Summary,References,Exercises,SchedulingGroupsofJobsIntroduction,SchedulingJobFamilies,MinimizingTotalWeightedFlowtime,MinimizingMaximumLateness,MinimizingMakespanintheTwoMachineFlowShop,SchedulingwithBatchAvailability,SchedulingwithaBatchProcessor,MinimizingtheMakespanwithDynamicArrivals,MinimizingMakespanintheTwoMachineFlowShop,MinimizingTotalFlowtimewithDynamicArrivals,BatchDependentProcessingTimes,Summary,References,Exercises,TheJobShopProblemIntroduction,TypesofSchedules,ScheduleGeneration,TheShiftingBottleneckProcedure,BottleneckMachines,HeuristicandOptimalSolutions,xCONTENTSNeighborhoodSearchHeuristics,Summary,References,Exercises,SimulationModelsfortheDynamicJobShopIntroduction,ModelElements,TypesofDispatchingRules,ReducingMeanFlowtime,MeetingDueDates,Background,SomeClarifyingExperiments,ExperimentalResults,Summary,References,NetworkMethodsforProjectSchedulingIntroduction,LogicalConstraintsandNetworkConstruction,TemporalAnalysisofNetworks,TheTimeCostTradeoff,TraditionalProbabilisticNetworkAnalysis,ThePERTMethod,TheoreticalLimitationsofPERT,Summary,References,Exercises,ResourceConstrainedProjectSchedulingIntroduction,ExtendingtheJobShopModel,ExtendingtheProjectModel,HeuristicConstructionandSearchAlgorithms,ConstructionHeuristics,NeighborhoodSearchImprovementSchemes,SelectingPriorityLists,Summary,References,Exercises,SafeSchedulingforProjectsIntroduction,StochasticBalancePrinciplesForActivityNetworks,TheAssemblyCoordinationModel,BalancingaGeneralProjectNetwork,CONTENTSxiAdditionalExamples,HierarchicalBalancing,CrashingStochasticActivities,Summary,References,Exercises,AppendixAPracticalProcessingTimeDistributionsAImportantProcessingTimeDistributions,ATheUniformDistribution,ATheExponentialDistribution,ATheNormalDistribution,ATheLognormalDistribution,ATheParkinsonDistribution,AIncreasingandDecreasingCompletionRates,AStochasticDominance,ALinearlyAssociatedProcessingTimes,References,AppendixBTheCriticalRatioRuleBABasicTradeoffProblem,BOptimalPolicyforDiscreteProbabilityModels,BASpecialDiscreteCase:EquallyLikelyOutcomes,BOptimalPolicyforContinuousProbabilityModels,BASpecialContinuousCase:TheNormalDistribution,BCalculatingdγE(T)fortheNormalDistribution,References,AppendixCIntegerProgrammingModelsforSequencingCIntroduction,CTheSingleMachineModel,CSequencePositionDecisions,CPrecedenceDecisions,CTimeIndexedDecisions,CTheFlowShopModel,References,NameIndexSubjectIndexPREFACEThistextbookprovidesanintroductiontotheconcepts,methods,andresultsofschedulingtheoryItiswrittenforgraduatestudentsandadvancedundergraduateswhoarestudyingscheduling,aswellasforpractitionerswhoareinterestedintheknowledgebaseonwhichmodernschedulingapplicationshavebeenbuiltThecoverageassumesnobackgroundinscheduling,andforstochasticschedulingtopics,weassumeonlyafamiliaritywithbasicprobabilityconceptsAmongotherthings,ourfirstappendixsummarizestheimportantpropertiesoftheprobabilitydistributionsweuseWeviewschedulingtheoryaspracticaltheory,andwehavemadesuretoemphasizethepracticalaspectsofourtopiccoverageThus,weprovidealgorithmsthatimplementsomeofthesolutionconceptswedescribe,andwecovertheuseofspreadsheetmodelstocalculatesolutionstoschedulingproblemsEspeciallywhentacklingstochasticschedulingproblems,wemustbalancetheneedfortractabilityandtheneedforrealismThus,westressheuristicsandsimulationbasedapproacheswhenoptimizationmethodsandanalytictoolsfallshortWealsoprovidemanyexamplesinthetextalongwithcomputationalexercisesamongourendofchapterproblemsCoverageoftheTextThematerialinthisbookcansupportavarietyofcoursedesignsAnintroductorylevelcoursecoveringonlydeterministicschedulingcandrawfromChapters–,–,–,,andAonequartercoursethatcoversbothdeterministicandstochastictopicscanuseChapters–andpossiblyOurownexperiencesuggeststhattheentirebookcansupportatwoquartersequence,especiallywithsupplementarymaterialweprovideontheInternetxiiixivPREFACEThebookcontainsthreeappendicesThefirstreviewsthesalientpropertiesofwellknownprobabilitydistributions,asbackgroundforourcoverageofstochasticmodelsItalsocoverssomespecializedtopicsonwhichsomeofouradvancedcoverageisbasedThesecondappendixincludesbackgroundderivationsrelatedtothe“criticalratiorule,”whicharisesfrequentlyinsafeschedulingmodelsOurthirdappendixisanintroductiontotheformulationofsequencingmodelsasintegerprograms,whichrepresentsalongneglectedsubjectthatoughttoberevisitedintheresearchliteratureOurcoverageissubstantialcomparedtootherschedulingtextbooks,butitisnotencyclopedicOurgoalistoenablethereadertodelveintotheresearchliterature(orinsomecases,theconsultingliterature)withenoughbackgroundtoappreciatethecontributionsofstateoftheartpapersForthereaderwhoisinterestedinamorecomprehensivelinktotheresearchliteraturethanourtextcovers,weprovideasetofWebbasedResearchNotesTheResearchNotesrepresentuniquematerialthatexpandsthebook’scoverageandbuildsanintellectualbridgetotheresearchliteratureonsequencingandschedulingInorganizingthetext,wewantedtoproceedfromsimpletocomplexandtomaintaintechnologicalorderAsmuchaspossible,eachnewresultisbasedonlyonpreviouscoverageAsasecondaryguidingprinciple,thetextminimizesanydiscussionofconnectionsbetweenmodels,thuskeepingthestructuresimpleSchedulingtheorydidnotdevelopalongthesesamelines,however,soresearchorientedreadersmaywishtolookatthebiggerpicturewithoutadheringtotheseprincipleswiththesamefidelityOnepurposeofourResearchNotesistooffersuchapictureAnotherpurposeistoprovidesomehistoricalbackgroundWealsomentionopenresearchquestionsthatwebelieveshouldbeaddressedbyfutureresearchOccasionally,weprovidemoredepthontopicsthatarenotsufficientlycentraltojustifyinclusioninthetextitselfFinally,forreaderswhowillbereadingresearchpapersdirectlyfromthesource,weoccasionallyneedtodiscusstopicsthataren’tcrucialtothetextbutthatarisefrequentlyintheliteratureHistoricalBackgroundThisbookisanupdatedversionofBaker’stext,sosomehistoricalbackgroundisappropriateattheoutsetIntroductiontoSequencingandScheduling(ISS)waspublishedbyJohnWileySonsinandbecamethedominanttextbookinschedulingtheoryAgenerationofinstructorsandgraduatestudentsreliedonthatbookasthekeysourceofinformationforadvancedworkinsequencingandschedulingLaterbooksstayedabreastofdevelopmentsinthefield,butasreferencesinjournalarticleswouldindicate,mostofthosebookswerenevertreatedasfundamentaltothestudyofschedulingSalesofISSslowedby,andWileyeventuallygaveupthecopyrightAlthoughtheyfoundapublishinghouseinterestedinbuyingthetitle,BakertookbackthecopyrightForseveralyears,heprovidedgenerousphotocopyingprivilegestoinstructorswhowerestillinterestedinusingthematerial,eventhoughsomeofithadbecomeoutdatedFinally,intheearlys,BakerrevisedthebookThesequelwasPREFACExvElementsofSequencingandScheduling(ESS),selfpublishedinandexpandedinLessencyclopedicthanitspredecessor,ESSwasrewrittentobereadableandaccessibletothestudentwhilestillprovidinganintellectualspringboardtothefieldofschedulingtheoryWithoutadvertisingsalesreps,andwithoutanyassociationwithatextbookpublishinghouse,ESSsoldseveralhundredcopiesinpaperbackthroughAnothergenerationofadvancedundergraduateandgraduatestudentsusedthebookincourses,whileothergraduatestudentsweresimplyassignedthebookasrequiredreadingforindependentstudiesorqualifyingexamsCurrentresearcharticlesinschedulingcontinuetociteISSandorESSasthesourceofbasicknowledgeonwhichtoday’sresearchisbeingbuiltPerhapsthemostimportanttopicnotcoveredinESSwasstochasticschedulingWiththeexceptionofthechapteronthejobshopsimulations,almostallthecoverageinESSdealtwithdeterministicmodelsInthelastyears,researchhasfocusedasmuchonstochasticmodelsasondeterministicmodels,andstochasticschedulinghasbecomeasignificantpartofthefieldButtraditionalapproachestostochasticschedulinghavetheirlimitations,andnewapproachesarecurrentlybeingdevelopedOneimportantlineofworkintroducesthenotionofsafescheduling,anapproachpioneeredbyTrietschandothers,morerecentlyextendedinjointworkbyBakerandTrietschThisbookupdatesthecoverageofESSandaddscoverageofsafeschedulingaswellastraditionalstochasticschedulingBecausethenewmaterialcomesfromactiveresearchers,thebooksurpassescompetingtextsintermsofitstimelinessAndbecausethebookretainsthereadabilityofitsearlierversions,itshouldbethetextbookofchoiceforinstructorsofschedulingcoursesFinally,itstitlereinforcestheexperiencesoftwogenerationsofstudentsandscholars,providingathreadthatestablishesthisvolumeasthelatestupdateofaclassictextAcknowledgmentsWewishtoacknowledgeLilitMazmanyanoftheAmericanUniversityofArmeniaforherassistancewithmanydetailedaspectsofthebook’spreparationWealsowishtoacknowledgeasetofreviewerswhoprovidedguidancetooureditorsaswellasanonymouscommentsandsuggestionstousThissetincludesEdwinCheng(TheHongKongPolytechnicUniversity),ZhiLongChen(UniversityofMaryland),ChungYeeLee(HongKongUniversityofScienceandTechnology),MichaelMagazine(UniversityofCincinnati),StephenPowell(DartmouthCollege),andScottWebster(SyracuseUniversity)KennethRBakerDanTrietschHanover,NewHampshireYerevan,ArmeniaINTRODUCTIONINTRODUCTIONTOSEQUENCINGANDSCHEDULINGSchedulingisaterminoureverydayvocabulary,althoughwemaynotalwayshaveagooddefinitionoftheterminmindActually,it’snotschedulingthatisacommonconceptinoureverydaylife,ratheritisschedulesAscheduleisatangibleplanordocument,suchasabusscheduleoraclassscheduleAscheduleusuallytellsuswhenthingsaresupposedtohappenitshowsusaplanforthetimingofcertainactivitiesandanswersthequestio

用户评价(0)

关闭

新课改视野下建构高中语文教学实验成果报告(32KB)

抱歉,积分不足下载失败,请稍后再试!

提示

试读已结束,如需要继续阅读或者下载,敬请购买!

文档小程序码

使用微信“扫一扫”扫码寻找文档

1

打开微信

2

扫描小程序码

3

发布寻找信息

4

等待寻找结果

我知道了
评分:

/49

Baker,Trietsch(2009).Principles of Sequencing and Scheduling[510s]

仅供在线阅读

VIP

在线
客服

免费
邮箱

爱问共享资料服务号

扫描关注领取更多福利