Title of article
Single CNCmachineschedulingwithcontrollableprocessingtimes to minimizetotalweightedtardiness
Author/Authors
M. SelimAkturk ، نويسنده , , TaylanIlhan، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
11
From page
771
To page
781
Abstract
Advancedmanufacturingtechnologies,suchasCNCmachines,requiresignificantinvestments,butalso
offer newcapabilitiestothemanufacturers.OneoftheimportantcapabilitiesofaCNCmachineisthe
controllableprocessingtimes.Byusingthiscapability,theduedaterequirementsofcustomerscanbe
satisfiedmuchmoreeffectively.ProcessingtimesofthejobsonaCNCmachinecanbeeasilycontrolled
via machiningconditionssuchthattheycanbeincreasedordecreasedattheexpenseoftoolingcost.
Since schedulingdecisionsareverysensitivetotheprocessingtimes,wesolvetheprocessplanningand
schedulingproblemssimultaneously.Inthisstudy,weconsidertheproblemofschedulingasetofjobs
on asingleCNCmachinetominimizethesumoftotalweightedtardiness,toolingandmachiningcosts.
We formulatedthejointproblem,whichisNP-hardsincethetotalweightedtardinessproblem(with
fixed processingtimes)isstronglyNP-hardalone,asanonlinearmixedintegerprogram.Weproposeda
DP-basedheuristictosolvetheproblemforagivensequenceanddesignedalocalsearchalgorithmthat
usesitasabaseheuristic.
Keywords
Single machine scheduling , Weighted tardiness , Tool management , Controllable processing time
Journal title
Computers and Operations Research
Serial Year
2011
Journal title
Computers and Operations Research
Record number
927900
Link To Document