Title of article
Group shopsschedulingwithmakespancriterionsubjecttorandomreleasedatesand processing times
Author/Authors
Fardin Ahmadizar، نويسنده , , MehdiGhazanfarib، نويسنده , , SeyyedMohammadTaghiFatemiGhomic، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
11
From page
152
To page
162
Abstract
This paperdealswithastochasticgroupshopschedulingproblem.Thegroupshopschedulingproblem
is ageneralformulationthatincludestheothershopschedulingproblemssuchastheflowshop,thejob
shop andtheopenshopschedulingproblems.Boththereleasedateofeachjobandtheprocessingtime
of eachjoboneachmachinearerandomvariableswithknowndistributions.Theobjectiveistofindajob
schedule whichminimizestheexpectedmakespan.First,theproblemisformulatedinaformofstochastic
programming andthenalowerboundontheexpectedmakespanisproposedwhichmaybeusedasa
measure forevaluatingtheperformanceofasolutionwithoutsimulating.Tosolvethestochasticproblem
efficiently, asimulationoptimizationapproachisdevelopedthatisahybridofanantcolonyoptimization
algorithm andaheuristicalgorithmtogenerategoodsolutionsandadiscreteeventsimulationmodel
to evaluatetheexpectedmakespan.Theproposedapproachistestedoninstanceswheretherandom
variables arenormally,exponentiallyoruniformlydistributedandgivespromisingresults.
Keywords
Makespan , Ant colony algorithm , simulation , Group shop scheduling problem , Random processing times , Random release dates
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927631
Link To Document