Title of article
A branchandboundalgorithmforminimizingmakespanonasinglemachine with unequalreleasetimesunderlearningeffectanddeterioratingjobs
Author/Authors
M. DuranToksar?، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
5
From page
1361
To page
1365
Abstract
We presentasingle-machineproblemwiththeunequalreleasetimesunderlearningeffectand
deterioratingjobswhentheobjectiveisminimizingthemakespan.Inthisstudy,weintroduceda
schedulingmodelwithunequalreleasetimesinwhichbothjobdeteriorationandlearningexist
simultaneously.Bytheeffectsoflearninganddeterioration,wemeanthattheprocessingtimeofajobis
definedbyincreasingfunctionofitsexecutionstarttimeandpositioninthesequence.Abranch-and-
boundalgorithmincorporatingwithseveraldominancepropertiesandlowerboundsisdevelopedto
derivetheoptimalsolution.Aheuristicalgorithmisproposedtoobtainanear-optimalsolution.The
computationalexperimentsshowthatthebranch-and-boundalgorithmcansolveinstancesupto30jobs,
and theaverageerrorpercentageoftheproposedheuristicislessthan0.16%.
Keywords
Release times , Scheduling , Single machine scheduling , Learning effect , Makespan , Deterioration jobs
Journal title
Computers and Operations Research
Serial Year
2011
Journal title
Computers and Operations Research
Record number
927953
Link To Document