Title of article
On solvingtheassemblylineworkerassignmentandbalancingproblemvia beam search
Author/Authors
Christian Blum، نويسنده , , CristobalMiralles ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
12
From page
328
To page
339
Abstract
Certain typesofmanufacturingprocessescanbemodelledbyassemblylinebalancingproblems.Inthis
work wedealwithaspecificassemblylinebalancingproblemthatisknownastheassemblyline
worker assignmentandbalancingproblem(ALWABP).Thisproblemappearsinsettingswheretasks
must beassignedtoworkers,andworkerstoworkstations.Taskprocessingtimesareworkerspecific,
and workersmightevenbeincompatiblewithcertaintasks.TheALWABPwasintroducedtomodel
assemblylinestypicalforshelteredworkcentersfortheDisabled.
In thispaperweintroduceanalgorithmbasedonbeamsearchforsolvingtheALWABPwiththe
objectiveofminimizingthecycletimewhengivenafixednumberofworkstations,respectively,
workers.ThisproblemversionisdenotedasALWABP-2.Theexperimentalresultsshowthatour
algorithmiscurrentlyastate-of-the-artmethodfortheALWABP-2.Incomparisontoresultsfromthe
literature,ouralgorithmobtainsbetterorequalresultsinallcases.Moreover,thealgorithmisvery
robust forwhatconcernstheapplicationtoprobleminstancesofdifferentcharacteristics.
Keywords
Beam search , Assembly line worker assignment and balancing
Journal title
Computers and Operations Research
Serial Year
2011
Journal title
Computers and Operations Research
Record number
927859
Link To Document