Web-Books
in the Austria-Forum
Austria-Forum
Web-Books
Informatik
Algorithms for Scheduling Problems
Page - 129 -
  • User
  • Version
    • full version
    • text only version
  • Language
    • Deutsch - German
    • English

Page - 129 - in Algorithms for Scheduling Problems

Image of the Page - 129 -

Image of the Page - 129 - in Algorithms for Scheduling Problems

Text of the Page - 129 -

Algorithms 2018,11, 54 maximize the totalprofitof thefirm,byoptimallydecidingwhere to locate thecommoncomponent manufacturing setup, andalso the individual transportationquantities. This situation is analyzed usingtheNewsvendorModel. The notion of bounded rationality in operationmanagementwas taken from the economics literature. Initially, the “bounded rationality” termwas introduced by Simon [2] to denote the decision-makingbehaviorswherethedecisionmakerfindsthealternatives. Later, scholarsconstructed diversemodel frameworks to cover agents’ bounded rationality by the quantal responsemodel. Toaccount for the limitations in thenormativeapproachadoptedbyatraditionalNewsvendorModel, which assumes that decisionmakers areperfect optimizers, thedescriptive approachof bounded rationality is incorporated. Thedecisionmodelofboundedrationality isbasicallybasedonclassical quantal choice theory [3]. Consideringallpossibleutilitygeneratingalternatives tobe thecandidates forselection,decisionmakers try tochoosemuchcaptivatingalternatives (obtaininggreaterutility) because theirprobabilityof selection ishigh. For thispurpose, theanalyticallyconvenient logit choice modelcanbeusedwhereselectionprobabilityofalternate j isproportional toexp(uj) [4]. Thequantal choicemodels take intoaccount thatdecisionmakersmaycommiterrors. It isnotnecessary thatone alwaysmakes thebestdecisions;betterdecisionsaremadefrequently. Thus,weformulate theproblemwith the frameworkofboundedrationality for themulti-market network design. The resulting formulation leads to a quadratic objective function with linear constraints. Since theconstraintsarenotall equalityconstraints, it isnot simple toreduce theproblem into linear systemof equations. Theproblem is solved throughanovel approachof Frank-Wolfe linearization method along with Generalized Benders’ Decomposition method. The results are comparedwithstandardgradientsearchmethodandthesuperiorconvergence isempiricallyproved. The remainingpartof the text is organizedas follows. InSection2, the literature is reviewed. Themodel andmethodology are described in Section 3. Section 4 discusses the test results and comparativeanalysis. Someconcludingremarksalongwith futureworkaregiven inSection5. 2. LiteratureReview AbroadreviewhasbeenpresentedbySnyder[5]onstochasticandrobust facility locationmodels, illustrating theoptimizationtechniques thathaveevolved in thisarea.HayesandWheelwright [6] describe several approaches such as geographical network analysis, physical facilities analysis, functional analysis and organizational mission analysis, and product-process analysis for the formulationofmulti-plant facility strategy. Skinner [7] proposes the concept of operational focus usingtheproduct-processapproach,andVanMieghem[8]models theapproachofproduct-process focus for amulti-market scenario. CohenandLee [9] are thepioneers towards formulatingglobal manufacturing strategyasamathematicalprogrammingproblemaccounting factors suchas local demand, sourcingconstraintsandtaxations. Organizationsmayselect fordeveloping their facility withrespect toproduct,volumes,orprocess. Luetal. [1]analyzesuchscenariosunderknowndemand andincorporatingscaleeconomies. Theirmodel includes twoproductswithdistinctdemandfeatures, twogeographicallydisjointedmarketswithdiverseeconomicfeatures,andtwoprocesseswithdistinct goalscomprisesofcommoncomponentmanufacturinganddedicatedassembly.Multi-productfirms frequentlyusage thecommonalityof fosterflexibility for theirprocessnetworks. Inanother study, the trade-offs between risk pooling and logistics costwith respect to two extreme configurations suchasprocess andproducthasbeen investigated for commonality inamulti-plantnetwork [10]. Melkoteetal. [11]developsanoptimizationmodel for facility locationandtransportationnetwork designproblem. Rationalityrefers toperfectoptimizationfor thegivenscenario.Onthecontrary, theconceptof boundedrationality identifies the intrinsic imperfections inhumandecisionmaking.Chenetal. [12] describedutilityfunctionsforthedecisionmakerandinferredstochasticprobabilities. Su[13]modeled theboundedrationality includingstochasticelements in thedecisionprocess.Despiteselectingthe utility-maximizingalternativeconstantly,decisionmakersembraceaprobabilisticoptingrulesuch 129
back to the  book Algorithms for Scheduling Problems"
Algorithms for Scheduling Problems
Title
Algorithms for Scheduling Problems
Authors
Frank Werner
Larysa Burtseva
Yuri Sotskov
Editor
MDPI
Location
Basel
Date
2018
Language
English
License
CC BY 4.0
ISBN
978-3-03897-120-7
Size
17.0 x 24.4 cm
Pages
212
Keywords
Scheduling Problems in Logistics, Transport, Timetabling, Sports, Healthcare, Engineering, Energy Management
Categories
Informatik
Technik
Web-Books
Library
Privacy
Imprint
Austria-Forum
Austria-Forum
Web-Books
Algorithms for Scheduling Problems