An improved algorithm for solving the economic lot size problem (ELSP)

Davis, Samuel G.

doi:10.1080/00207549508930191

Cited by 12 publications

(6 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The sequence-dependent ELSP Ever since the ELSP was first introduced by Rogers (1958), a large number of heuristics, among them the socalled common-cycle, basic-period, and varying-lot-sizes approaches, have been proposed (see, e.g., the reviews given in Elmaghraby, 1978;Davis, 1995;and Carstensen, 1999). Although sequence-dependent setup times and costs are reported to be prevalent in most practical applications (see, e.g., Monkman et al, 2008 andMehrotra et al, 2011), the vast majority of the ELSP-related research concentrates on the special case of sequence-independent setup times and costs.…”

Section: Related Literaturementioning

confidence: 99%

A price-directed heuristic for the economic lot scheduling problem

Adelman

Barz

2014

IIE Transactions

View full text Add to dashboard Cite

The article formulates the well-known economic lot scheduling problem (ELSP) with sequence-dependent setup times and costs as a semi-Markov decision process. Using an affine approximation of the bias function, a semi-infinite linear program is obtained and a lower bound for the minimum average total cost rate is determined. The solution of this problem is directly used in a price-directed, dynamic heuristic to determine a good cyclic schedule. As the state space of the ELSP is non-trivial for the multi-product setting with setup times, the authors further illustrate how a lookahead version of the price-directed, dynamic heuristic can be used to construct and dynamically improve an approximation of the state space. Numerical results show that the resulting heuristic performs competitively with one reported in the literature.

show abstract

Section: Related Literaturementioning

confidence: 99%

A price-directed heuristic for the economic lot scheduling problem

Adelman

Barz

2014

IIE Transactions

View full text Add to dashboard Cite

show abstract

“…Furthermore, Equations (8) require that the machine at the end of period t and, consequently, at the beginning of the next period t + 1 is set up for a product i. The setup flow condition is presented in Equation (9). For instance, if a setup operation is performed from product j to product k, thus j∈M δ sd jkt = 1, ∀ k, t, or the setup state for product k is carried over in period t, i.e., δ k,t−1 = 1, then the setup state for product k is carried to period t + 1, i.e., δ kt = 1 or a setup from product k to a product j is done in period t, i.e., i∈M δ sd kit = 1 ∀ k, t. In other words, if the machine is set up for product k in period t, then product k is the last product scheduled in period t (δ kt = 1) or an additional setup operation from product k to product j is performed; see, e.g., [22].…”

Section: A Clsd With Depreciationmentioning

confidence: 99%

“…This might be due to complexity reduction of models (see [12]), so that they are applicable to real world problems which might be a good compromise because of insignificant setup times and costs and/or due to the application of static models, such as the economic order quantity formula. Relaxing the assumption of zero setup times and costs in (aggregate) lot sizing models implies scheduling decisions where a great body of work exists even for the static case, e.g., the economic lot scheduling problem; see, e.g., [9], [13], [15], [26], [42], [48], [53].…”

Section: B Integration Of Sequence-dependent Setup Times and Costs Imentioning

confidence: 99%

Discrete Lot-Sizing and Scheduling with Sequence-Dependent Setup Times and Costs Including Deterioration and Perishability Constraints

Pahl

Voß

Woodruff

2011

2011 44th Hawaii International Conference on System Sciences

View full text Add to dashboard Cite

Deterioration and perishability constraints force organizations to carefully plan their production in cooperation with their supply chain partners up-and downstream. This is important because waiting times due to suboptimal planning give rise to increasing lead times and, consequently, to depreciation of parts and products while waiting and, thus, decreasing quality of items, so that, in the worst case, they cannot be used. Increased costs are only one problem. A more troubling aspect is unsatisfied customers waiting for their products or being concerned about quality. It is well known that reducing lot sizes leads to lower inventory holding costs, but also to increased setup costs. Therefore, lot size planning seeks to weigh the tradeoff of setup costs and costs of inventory holding. The limits of lifetimes of parts and products in the production process increase the complexity of planning, especially if setup times and costs are dependent on the sequence of items. We analyze lot sizing models with sequence-dependent setup times and costs extending them to depreciation effects.

show abstract

“…An extension of the EPQ problem is the economic lot scheduling problem (ELSP) that not only seeks to ® nd production quantity/cycle length, but also the production sequence (Silver et al 1998). There exists a large amount of research on this problem with representative work done by Dobson (1987), Zipkin (1991), Davis (1995) and Moon et al (1998).…”

Section: Literature Reviewmentioning

confidence: 99%

An integrated material flow system approach for determining the economic production quantity (EPQ)

Choi¹,

Noble²

2000

International Journal of Production Research

View full text Add to dashboard Cite

Traditionally, the analysis of material¯ow systems has focused on each of the individual components of the system separately (i.e. material handling, production lot size, unit load size,¯ow path, layout, space, etc). Even though each component is di cult to address on its own, it is imperative that they be addressed concurrently due to their interactions. This paper explores the relationships between the components in the material¯ow system with respect to determining the economic production quantity (EPQ). This is in contrast to the traditional EPQ model, which considers only set-up cost, inventory cost, and demand, while ignoring other material¯ow system issues. A multi-item economic production quantity model under a storage space limit is considered with respect to material handling equipment selection and requirements, unit load size, and ow path selection. The integrated material¯ow system problem is mathematically formulated as a large scale, nonlinear integer programming model, and a heuristic solution procedure is developed. The impact of using an integrated approach to determine the EPQ is illustrated and solutions are compared to both a lower bound and a traditional sequential approach. It is found that an integrated approach provides consistent and signi® cant improvement in the overall solution quality.

show abstract

An improved algorithm for solving the economic lot size problem (ELSP)

Cited by 12 publications

References 10 publications

A price-directed heuristic for the economic lot scheduling problem

A price-directed heuristic for the economic lot scheduling problem

Discrete Lot-Sizing and Scheduling with Sequence-Dependent Setup Times and Costs Including Deterioration and Perishability Constraints

An integrated material flow system approach for determining the economic production quantity (EPQ)

Contact Info

Product

Resources

About