摘要
Amodifiedbottleneck-based(MB)heuristicforlarge-scalejob-shopschedulingproblemswithawell-definedbottleneckissuggested,whichissimplerbutmoretailoredthantheshiftingbottleneck(SB)procedure.Inthisalgorithm,thebottleneckisfirstscheduledoptimallywhilethenon-bottleneckmachinesaresubordinatedaroundthesolutionsofthebottleneckschedulebysomeeffectivedispatchingrules.ComputationalresultsindicatethattheMBheuristiccanachieveabettertradeoffbetweensolutionqualityandcomputationaltimecomparedtoSBprocedureformedium-sizeproblems.Furthermore,itcanobtainagoodsolutioninashorttimeforlarge-scalejob-shopschedulingproblems.
出版日期
2007年03月13日（中国期刊网平台首次上网日期，不代表论文的发表时间）
