Title of article
Machine schedulingwithjobclasssetupanddeliveryconsiderations
Author/Authors
T.C.E.Cheng ، نويسنده , , XiuliWang ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
6
From page
1123
To page
1128
Abstract
Westudymachineschedulingproblemsinwhichthejobsbelongtodifferentjobclassesandtheyneed
to bedeliveredtocustomersafterprocessing.Asetuptimeisrequiredforajobifitisthefirstjobtobe
processed onamachineoritsprocessingonamachinefollowsajobthatbelongstoanotherclass.
Processed jobsaredeliveredinbatchestotheirrespectivecustomers.Thebatchsizeislimitedbythe
capacityofthedeliveryvehiclesandeachshipmentincursatransportcostandtakesafixedamountof
time. Theobjectiveistominimizetheweightedsumofthelastarrivaltimeofjobstocustomersandthe
delivery(transportation)cost.Fortheproblemofprocessingjobsonasinglemachineanddelivering
them tomultiplecustomers,wedevelopadynamicprogrammingalgorithmtosolvetheproblem
optimally.Fortheproblemofprocessingjobsonparallelmachinesanddeliveringthemtoasingle
customer,weproposeaheuristicandanalyzeitsperformancebound.
Keywords
Transportation , Machine scheduling , Algorithms , Job class setup
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927721
Link To Document