Title of article
Schedulingcrossdockingoperationsunderfull,partialandnoinformation on inboundarrivals
Author/Authors
Rim Larbi، نويسنده , , G¨ ulg ¨un Alpan ، نويسنده , , PierreBaptiste، نويسنده , , BernardPenz ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
12
From page
889
To page
900
Abstract
Crossdockingisalogistictechniquewhichseekstoreducetheinventoryholding,orderpicking,
transportationcostsanddeliverytime.Littleattentionhasbeengiventothetransshipmentoperations
insideacrossdock.Inthisarticle,westudythetransshipmentschedulingprobleminasinglereceiving
and asingleshippingdoorcrossdockunderthreeschedulingpolicies:Inthefirstpolicy,weassumeto
have completeinformationontheorderofarrivalsandthecontentsofallinboundtrucks.Thesecondand
the thirdpoliciesassumetheavailabilityofpartialandnoinformationonthesequenceofupcoming
trucks.Anoptimalgraphbasedmodelisproposedforthefullinformationcase,andapolynomialtime
algorithmisgiven.Heuristicsaredevelopedfortheothertwocases.Thecomparisonofthecosts
associatedtoeachpolicyhelpsevaluatingthevalueofinformationincrossdockschedulingproblems.
Keywords
Logistics , Cross docking , Scheduling , Value of information , Heuristics
Journal title
Computers and Operations Research
Serial Year
2011
Journal title
Computers and Operations Research
Record number
927910
Link To Document