Title of article
A newmodelforthepreemptiveearliness–tardinessschedulingproblem
Author/Authors
Nina Runge، نويسنده , , FrancisSourdb، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2009
Pages
8
From page
2242
To page
2249
Abstract
This paperaddressesanewmodelfortheone-machineearliness–tardinessschedulingproblemwhere
jobs canbeinterrupted.Somedominancerulesandalowerboundarederived.Anewtimingalgorithm
is alsopresentedandalocalsearchalgorithmbasedonthistimingalgorithmpermitsthecomputation
of goodfeasiblesolutions.Weexperimentallycompareourtimingalgorithmwithapreviouslypublished
timing algorithm.Thetestsshowthattheexecutiontimeofthenewtimingalgorithmissignificantly
faster, especiallyforlargeinstances.Thevaluesofthesolutionsarecomparedtothelowerbound.
Keywords
Timing algorithm , Local search , Lower bound , Preemption , Earliness–tardiness , Scheduling
Journal title
Computers and Operations Research
Serial Year
2009
Journal title
Computers and Operations Research
Record number
927609
Link To Document