Page - 141 - in Algorithms for Scheduling Problems
Image of the Page - 141 -
Text of the Page - 141 -
Algorithms 2018,11, 54
Figure6.Differentpossiblescenariosofproductionallocationfordualmarketcase.
Figure7.Graphical comparisonof the twoalgorithmsforscenario1.
Table7.ProfitresultsofScenario1.
Scenario1 CaseofDeterministicDemand CaseofUniformDemandDistributionD∼
[1000,200]
v1> v2> v3> v4
ct,1>Δcm ct,2>Δcm p1=100 x1=D1 x1=1565
p2=80 x2=0 x2=0
cm,1=40 x3=0 x3=0
cm,2=65 x4=D2 x4=1142
ct,1=30 D=D1=D2 T.P
T.P.=105,951.9ct,2=25
1000 85,000
2000 170,000
1500 127,500
141
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