简介:Amodifiedbottleneck-based(MB)heuristicforlarge-scalejob-shopschedulingproblemswithawell-definedbottleneckissuggested,whichissimplerbutmoretailoredthantheshiftingbottleneck(SB)procedure.Inthisalgorithm,thebottleneckisfirstscheduledoptimallywhilethenon-bottleneckmachinesaresubordinatedaroundthesolutionsofthebottleneckschedulebysomeeffectivedispatchingrules.ComputationalresultsindicatethattheMBheuristiccanachieveabettertradeoffbetweensolutionqualityandcomputationaltimecomparedtoSBprocedureformedium-sizeproblems.Furthermore,itcanobtainagoodsolutioninashorttimeforlarge-scalejob-shopschedulingproblems.