简介:Ajobshopschedulingproblemwithacombinationprocessingincomplexproductionenvironmentisproposed.Basedonthedefiningof'non-elasticcombinationprocessingrelativity'and'virtualprocess',theproblemcanbesimplifiedandtransformedtoatraditionalone.Onthebasisofthedispatchingrulesselectengineandconsideredfactorsofcomplexproductionenvironment,aheuristicmethodisdesigned.ThealgorithmhasbeenappliedtoamouldenterpriseinShenzhenforhalfayear.Thepracticeshowedthatbyusingthemethodsuggestedthenumberofdelayedorderswasdecreasedabout20%andtheproductivitywasincreasedby10to20%.
简介:Inflexiblejob-shopbatchschedulingproblem,theoptimallot-sizeofdifferentprocessisnotalwaysthesamebecauseofdifferentprocessingtimeandset-uptime.Evenforthesameprocessofthesameworkpiece,thechoiceofmachinealsoaffectstheoptimallot-size.Inaddition,differentchoicesoflot-sizebetweentheconstrainedprocesseswillimpactthemanufactureefficiency.Consideringthateachprocesshasitsownappropriatelot-size,weputforwardtheconceptofschedulingwithlot-splittingbasedonprocessandsetuptheschedulingmodeloflot-splittingtocriticalpathprocessasthecore.Themodelcouldupdatethesetofbatchprocessandmachineselectionstrategydynamicallytodetermineprocessingrouteandarrangeproperlot-sizefordifferentprocesses,toachievethepurposeofoptimizingthemakespanandreducingtheprocessingbatcheseffectively.Theexperimentresultsshowthat,comparingwithlot-splittingschedulingschemebasedonworkpiece,thismodeloptimizesthemakespanandimprovestheutilizationefficiencyofthemachine.Italsogreatlydecreasesthemachinedbatches(42%)andreducesthecomplexityofshopschedulingproductionmanagement.