Title of article
The distributedpermutationflowshopschedulingproblem
Author/Authors
B. Naderi a، نويسنده , , RubénRuizb، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
15
From page
754
To page
768
Abstract
This paperstudiesanewgeneralizationoftheregularpermutationflowshopschedulingproblem(PFSP)
referred toasthedistributedpermutationflowshopschedulingproblemorDPFSP.Underthisgeneral-
ization, weassumethatthereareatotalof F identical factoriesorshops,eachonewith m machines
disposed inseries.Asetof n available jobshavetobedistributedamongthe F factories andthenapro-
cessing sequencehastobederivedforthejobsassignedtoeachfactory.Theoptimizationcriterionisthe
minimization ofthemaximumcompletiontimeormakespanamongthefactories.Thisproductionsetting
is necessaryintodayʹsdecentralizedandglobalizedeconomywhereseveralproductioncentersmightbe
available forafirm.WecharacterizetheDPFSPandproposesixdifferentalternativemixedintegerlinear
programming (MILP)modelsthatarecarefullyandstatisticallyanalyzedforperformance.Wealsopropose
two simplefactoryassignmentrulestogetherwith14heuristicsbasedondispatchingrules,effective
constructive heuristicsandvariableneighborhooddescentmethods.Acomprehensivecomputationaland
statistical analysisisconductedinordertoanalyzetheperformanceoftheproposedmethods.
Keywords
Distributed Scheduling , Variable neighborhood descent , Mixed Integer Linear Programming , Permutation flowshop
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927687
Link To Document