Title of article
Jackson’s semi-preemptiveschedulingonasinglemachine
Author/Authors
Anis Gharbi، نويسنده , , MohamedLabidi ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
7
From page
2082
To page
2088
Abstract
We proposeaneffectiveimprovementofthewell-knownJackson’spreemptiveschedulelowerbound
for thesinglemachineschedulingproblemwithheadsandtails.Thesemi-preemptivescheduling
concept roughlyconsistsinreducingthepreemptionimpactbyconstrainingsomeparticularjobparts
to beprocessedinreducedtimeintervals.Theimpactofsemi-preemptiveschedulingistwofold:it
yields alowerboundwhichdominatesthepreemptiveone,andenablesmoreeffectiveadjustmentsof
the headsandtails.Ourexperimentalstudyrevealedthatsuitablyembeddingourprocedurewithin
Carlier’salgorithmmakesfeasibletosolveallofthehardinstanceswhichcouldnotbesolvedbyits
originalvariant.
Keywords
Cell formation problem , Iteratively local search , Ant colony optimization , Metaheuristic
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927812
Link To Document