2012
DOI: 10.1007/978-3-642-33587-7_10
|View full text |Cite
|
Sign up to set email alerts
|

Multi-item Simultaneous Lot Sizing and Storage Allocation with Production and Warehouse Capacities

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
3
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 12 publications
0
3
0
Order By: Relevance
“…Considering a multi-item dynamic lot sizing strategy with production and warehouse capacities with different storage allocation policies, a mathematical model of the related problem was detailed, and dominance properties were presented separately for each storage allocation policy [36]. Based on no-shortage policy, the proposed algorithm utilized transfer of lots between consecutive periods.…”
Section: Introductionmentioning
confidence: 99%
“…Considering a multi-item dynamic lot sizing strategy with production and warehouse capacities with different storage allocation policies, a mathematical model of the related problem was detailed, and dominance properties were presented separately for each storage allocation policy [36]. Based on no-shortage policy, the proposed algorithm utilized transfer of lots between consecutive periods.…”
Section: Introductionmentioning
confidence: 99%
“…This study was motivated by a need of semiconductor company in Korea that produces memory chips and adopts make-to-order strategy. The order-lot matching problem is different from the lot sizing problem [1,2] in that lot sizes are not to be determined but fixed. Since order sizes are usually larger than lot sizes, an order is met with multiple lots.…”
Section: Introductionmentioning
confidence: 99%
“…Note that S(1, 2, 2) = {1}, S(4, 4, 2) = {4}, S(1, 4, 2) = {1, 4}, C({1, 2}, 0) = 30, and C({1, 4, 2}, 0) = 40. Since T(S(1, 4, 2), 0) ≥ 0, T(S(1,4,3), 0) = 10. Thus, we obtain T(S(1, 4, 0), 0) = 50 when an optimal order sequence is 1, 2, 4, 3.…”
mentioning
confidence: 99%