Web-Books
in the Austria-Forum
Austria-Forum
Web-Books
Informatik
Algorithms for Scheduling Problems
Page - 12 -
  • User
  • Version
    • full version
    • text only version
  • Language
    • Deutsch - German
    • English

Page - 12 - in Algorithms for Scheduling Problems

Image of the Page - 12 -

Image of the Page - 12 - in Algorithms for Scheduling Problems

Text of the Page - 12 -

Algorithms 2018,11, 18 Table1.TheTOUtariffsusedforall instances. PeriodType ElectricityPrice (CNY/kwh) TimePeriods On-peak 1.2473 8:00–11:30 18:30–23:00 Mid-peak 0.8451 7:00–8:00 11:30–18:30 Off-peak 0.4430 23:00–7:00 CmaxandCBdenote thegivenmakespanandthetotalprocessingtimesofall the jobs, respectively. Theparameter e=Cmax/CB (e≥1) isusedtomeasure thedegreeof timetightness. In these instances, Cmax can be obtained by the formulaCmax = e×CB as long as the parameter e is set. Obviously, as e increases,Cmax increases.Note that bm+1 is calculated by bm+1 = Cmax/24) ×24. LetTECF andTECHbethe totalelectricitycostcalculatedbyouralgorithm(GIH-F)andCheetal.’salgorithm (GIH), respectively. Theruntimesof the twoalgorithmsarerepresentedbyCTF andCTH, respectively. ThegapsbetweenTECFandTECHarerepresentedbyG,G=(TECF−TECH)/TECH×100%.Theratio ofCTH/CTF is representedbyR. 4.1.ARealCaseStudy TheMILPmodelandtheproposedalgorithmareapplied toaverticalmachiningcenter (SMTCL VMC1600P) fromamachinerymanufacturingcompanyshowninFigure8. In this real-life instance, the company receives someorders of processing rectangular partswith threeproductmodels for continuouscastingmachinesof thesteelplants. Figure9 is thepictureof the rectangularpart, and thecomplexcavitysurfaces including theplanes, cambersurfaces, andspherical surfacesare tobe processed on theVMC. Thepower consumptionper hour required by theVMC is related to the materialof the job, cuttingdepth, feedspeed,andsoon. Toobtain theaveragepowerconsumption rateof themachine,apowermeasurement isperformedusingapowermeter (UNI-TUT232), andthe measurementdata ispresentedbyTable2. Inaddition, theorderquantityof the threemodels is15,35, and10parts, respectively. Figure8.Verticalmachiningcenter. Figure9.Thegeometryof therectangularpart. 12
back to the  book Algorithms for Scheduling Problems"
Algorithms for Scheduling Problems
Title
Algorithms for Scheduling Problems
Authors
Frank Werner
Larysa Burtseva
Yuri Sotskov
Editor
MDPI
Location
Basel
Date
2018
Language
English
License
CC BY 4.0
ISBN
978-3-03897-120-7
Size
17.0 x 24.4 cm
Pages
212
Keywords
Scheduling Problems in Logistics, Transport, Timetabling, Sports, Healthcare, Engineering, Energy Management
Categories
Informatik
Technik
Web-Books
Library
Privacy
Imprint
Austria-Forum
Austria-Forum
Web-Books
Algorithms for Scheduling Problems