生产排程问题的派工法则(1)

零DispatchingRulesforPracticalJobShopSchedulingaa林a龍ba立116北路64TEL:[phone],b立116北路64TEL:[phone],87086e-mail:[e-mail];[e-mail]不力例(ERP)理(SCM)都(ShopFloorControl)零理論零異異零不流零理數異零兩1不數2’數’’不數’率異12不狀7量16不狀’不數’’不數’異異理不狀不論理論都零論年來路了行了(e-Business)來益(ERP)來切理(SCM)拓度都(ShopFloorControl)都(Scheduling)不料都不不流異ERPSupplyChain金不不來理利(Appoldetal.1993)80%90%零零年來易(DispatchingRules)年來零理論零零異異零都不流理數都JobShop理數異不JobShop異理論零更零論不2.1(jobs)行了(schedulingproblem)(Conway1967)行了(when)(where)什(what)(Parunak1991)數年流行(heuristics)(parameters)(operation)易理度Blockstoneetal.(1982)類(processtime)(duedate)狀兩兩都量良量(Conway1965;Rochette&Sadowski1976;Blackstoneet.al.1982)量來例了SPT不不量理Conway(1965)16SIPTFIFOFRO(thefewestnumberofremainingoperations)量(work-in-processinventory)SIPTSLACK/ROHershauerEbert(1975)了13(337)論(1)SIPT(2)cost-per-order量SIPT(3)SLACK/RO來BlackstorePhilipsHogg(1982)論SIPT(1)(duedates)(2)(”tight”duedates6理)(3)(”loose”duedates7理)流(greatcongestion)Dar-EIWysk(1982)零6來行RMS(rootmeansquare)量SIPTRMS來WINQFIFOSLACK/ROSIPTChangToshiyukiRobert(1996)3750數42行論不(1)率SIPTSIPTSPIT/TWKSPIT/TWKR(2)數(slack)(operation)來EDDSLACKSLACK/TWKSLACK/TWKRHolthausRajendran(1997)了更不度率流PT+WIJNQPT+WINQ+ATPT+WINQ+AT+SLPT+WINQ+SLPT+WINQ/TISSPTFIFOCOVERTRRWINQ行量論(1)PT+WINQSPT(2)異量PT+WINQ+ATPT+WINQ+AT+SL兩量兩不(3)率SPT(4)RR更率不不Liu(1998)力不理行FIFO更率論Rajendran&Holthaus(1999)兩更流零不行PT+WINQ流AT-RPT流流異不PT+WINQ+SL了異量RR率率良量不(PT+WINQ)/TISPT/TIS流量了不2.2Wilbrecht&Prescott數6JobShop數10JobShop都不都率數量210(Uniformdistribution)149立數TWK(TotalWork)Di=ri+c*TWKi(allowancefactor)不2~8(HolthausandRajendran,19971999Barrettetal.,1999)數c=46不()數來率λ(數參數)85%95%兩率行(replication)20行2000RajendranandHolthaus(1997)501狀(steadystate)行250050125002000行42率*2理FIFO(firstin,firstout)FIFO來行異Zij=rijrijAT(arrivaltime)異Zij=riEDD(earliestdue-date)異良Zij=diS/OPN(slackperremainingoperation)量si(si=di–t–rki)COVERT(costovertime)(valueofslack)來Ci(penalityfunction)理來量不Zij=ci/PijWi′DAWT(dynamicaveragewaitingtime)來(Russelletal.,1993)RR(rulebyRaghuandRajendran,1993)流量Zij=(si*exp(–U)*Pij)/rki+exp(U)*Pij+U率ΠW理rki理SPT(ShortestProcessingTime)理來行Zij=PijPij理si/(rpi-j+1)ifsiZij=si*(rpi-j+1)ifsi0.PT+WINQ(ProcessTime+WorkInNextQueue)HolthausandRajendran(1997)流不Zij=Pij+ΠWPT+WINQ+AT(ProcessTime+WorkInNextQueue+ArrivalTime)HolthausandRajendran(1997)流流異量(Wi′-si)/Wi′,if0siWi′,ci=0,ifsiWi′,1,ifsi0.Zij=Pij+ΠW+riPT+WINQ+SL(ProcessTime+WorkInNextQueue+NegativeSlack)HolthausandRajendran(1997)異量不Zij=Pij+ΠW+min{si;0}((PT+WINQ)/TIS)TIS(time-in-shop)數留不更異Zij=(Pij+ΠW)/(tri)PT/TIS類Zij=Pij/(tri)AT-RPTTime-In-Shop異Zij=rirpirpii參論13列4量行流(MeanflowtimeF)流(MaximumflowtimeFmax.)率(Proportionoftardyjobs%T)(MeantardinessT)不(率量)51~4*流RRPT+WINQSPTRRPT+WINQ率率SPT率理論PT+WINQRRAT_RPT良PT+WINQ+SL率理論AT_RPTPT+WINQ+SL不理論來1流Ug(%)cF理論804P+W*P+W*SPT*SPT*P+W+SRRRRP+W+SCOVERTCOVERT806P+W*P+W*P+W+S*SPT*SPT*P+W+S*COVERT*RR(P+W)/TIS(P+W)/TIS954RR*P+W*P+WRRSPTSPTP+W+S(P+W)/TIS(P+W)/TISP+W+S956RR*RR*P+W+SP+WP+WP+W+SSPTSPT(P+W)/TIS(P+W)/TIS2流Ug(%)cFmax理論804AT_RPT*AT_RPT*P+W+AATATP+W+APT/TISPT/TISRR(P+W)/TIS806AT_RPT*AT_RPT*P+W+AAT_RPTATP+W+APT/TISPT/TIS(P+W)/TIS(P+W)/TIS954P+W+S*AT_RPT*AT_RPTATP+W+AP+W+AATP+W+SPT/TISPT/TIS956AT_RPT*AT_RPT*P+W+A*ATP+W+S*P+W+AATPT/TISPT/TISP+W+S3率Ug(%)c%T理論804RR*RR*COVERT*COVERTS/OPNSPTPT/TISS/OPNSPTP+W806RR*RR*S/OPN*S/OPN*EDD*COVERT*COVERT*EDDPT/TISSPT954SPT*SPT*P+WP+WRRCOVERTCOVERT(P+W)/TIS(P+W)/TISRR956SPT*SPT*RRP+WP+WRRCOVERTCOVERT(P+W)/TIS(P+W)/TIS4Ug(%)cT理論804RR*RR*COVERT*COVERT*S/OPNS/OPNPT/TISP+W+SPT/TISP+W+S(P+W)/TIS806RR*RR*S/OPN*S/OPN*EDD*COVERT*COVERT*EDDPT/TISP+W+S954RR*RR*P+W+SP+WCOVERT(P+W)/TISP+WP+W+S(P+W)/TISCOVERT956RR*RR*COVERTP+W+SP+W+SRRPT/TIS(P+W)/TIS(P+W)/TISPT/TIS率了率理論PT/TISSPTSPT理論類RR理論異度理論參參[1].Appold,S.J.Harrison,B.andKelley,M.R.,“Spatiallyproximateinter-organizationalnetworks,agglomerationeconomics,andtechnologicalperformanceinU.S.manufacturing,”AnnualmeetingoftheassociationofAmericangeographers1993.[2].Blackstone,J.H.Philips,D.T.andHogg,G.L.,“Astate-of-the-artsurveyofdispatchingrulesformanufacturingjobshopoperations,”InternationalJournalofProductionResearchVol.201982,pp:27-45.[3].Chang,Yih-long,Sueyoshi,T.,andSullivan,R.S.,“Rankingdispatchingrulesbydataenvelopmentanalysisinajobshopenvironment,”IIETransactionsVol.281996,pp:631-642.[4].Conway,R.W.,“Prioritydispatchingandwork-in-processinventoryinajobshop,”JournalofIndustrialEngineeringVol.161965,pp:123-130andpp:228-237.[5].Dar-El,E.M.andR.A.Wysk,“JobShopScheduling-ASystematicApproach,”JournalofManufacturingSystems1982,Vol.1pp:77-88.[6].Liu,K.C.“Dispatchingrulesforstochasticfinitecapacityscheduling,”ComputersandIndustrialEngineering(35:1)1998,pp:113-116.[7].Montazeri,M.andVanWassenhove,L.N.,“Schedulingrulesformanufacturingsystems,”Workingpaper86-01,AfdelingIndustrialBeleid,K.U.Leuvan,Leuyen,Belgium1986.[8].Parunak,H.V.D.,“CharacterizingtheManufacturingSchedulingProblem”,JournalofManufacturingSystemsVol.101991,pp:241-259.[9].Rajendran,C.andHolthaus,O.,“Acomparativestudyofdispatchingrulesindynamicflowshopsandjobshops,”EuropeanJournalofOperationalResearchVol.1161999.pp:156-