Seite - 14 - in Algorithms for Scheduling Problems

Algorithms 2018,11, 18 Finally, jobs3and4areassignedtohigh-price layer3,andtheybothsatisfyCondition6.Afinal completeschedulingdiagramisgiven inFigure10c. (a) Computational process diagram 1 (b) Computational process diagram 2 (c) Computational process diagram 3 Figure10. Illustrationof thecomputationalprocessofGIH-F. Returningto thereal-life instance, letusnowtalkabout theefficiencyof theMILPmodelandthe proposedalgorithm.Currently, thecompanyplans toproduce70-Model,40-Model,and100-Model rectangularparts in7,3, and2daysrespectively. That is,fivepartsare tobeproducedeverydayfrom 8:00 to24:00. Thissuggests that itneeds12days toprocessall thepartsandthetotalelectricitycost (TEC) canbecomputedas follows: TEC70=4.7×(3.5×1.2473+7×0.8451+2.5×1.2473)×7=440.8CNY; TEC40=4.4×(3.5×1.2473+7×0.8451+1.5×1.2473)×3=160.4CNY; TEC100=5.3×(3.5×1.2473+7×0.8451+4.5×1.2473+0.5×0.4430)×2=170.8CNY; TEC=TEC70+TEC40+TEC100=772.0CNY. Figure11 is theschedulingresultdiagramof thereal-life instance. It canbeseenfromFigure11 thatwithourscheduling, the totalelectricitycost forprocessingall theparts is447.9CNY,whichcan bereducedby42.0%. 14