Results 261 to 270 of about 8,360 (304)
Single item lot sizing problems
European Journal of Operational Research, 2006 International audienceA state-of-the-art of a particular planning problem, the Single Item Lot Sizing Problem (SILSP), is given for its uncapacitated and capacitated versions. First classes of lot sizing problems are briefly surveyed.
Nadjib Brahimi +2 more
exaly +1 more source
Lot sizing is a decision made in productive systems operation, where a batch size or order quantity is selected critically to optimise the process in terms of specified characteristics and such that costs are minimised and demand requirements meet. The optimal decision is the Economic Lot Size (ELS) or the Economic Order Quantity (EOQ).
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2017
In this chapter, we discuss lot-sizing heuristics that can be used to manage inventory of a single item whose demand varies from period to period. Because the demand is not constant the classical EOQ formula cannot be applied. Several heuristics are found in literature.
Dinesh Shenoy, Roberto Rosas
openaire +1 more source
In this chapter, we discuss lot-sizing heuristics that can be used to manage inventory of a single item whose demand varies from period to period. Because the demand is not constant the classical EOQ formula cannot be applied. Several heuristics are found in literature.
Dinesh Shenoy, Roberto Rosas
openaire +1 more source
Computing Optimal Lot Sizes in the Economic Lot Scheduling Problem
Operations Research, 1991This paper treats a version of the Economic Lot Scheduling Problem (ELSP) in which items may be produced several times in different amounts during a cycle. We show how to compute the optimal lot sizes and cycle length, given the sequence of items in a cycle. This requires solving a parametric quadratic program, plus a few EOQ calculations.
openaire +1 more source
Genetic algorithms in lot sizing decisions
Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), 2003This paper presents a genetic algorithm approach for the lot sizing problem. The lot sizing problem is defined as obtaining the order quantities for an uncapacitated, no shortages allowed, single-item, and single-level case. Experimentation was conducted to evaluate how different aspects of the genetic algorithm affect the results. In particular it was
William Hernandez, Gürsel A. Süer
openaire +1 more source
A lot-sizing problem in an automated foundry
European Journal of Operational Research, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Elisangela dos Santos-Meza +2 more
openaire +2 more sources
Interfaces, 1995
In attempting to implement a simple, computational lot-sizing procedure in a factory producing automobile parts, I met substantial resistance, even though the company is renowned for using high technology in its products. I recommended a multiple-item economic order quantity model but was prevented from implementing it by interdepartmental politics. I
openaire +1 more source
In attempting to implement a simple, computational lot-sizing procedure in a factory producing automobile parts, I met substantial resistance, even though the company is renowned for using high technology in its products. I recommended a multiple-item economic order quantity model but was prevented from implementing it by interdepartmental politics. I
openaire +1 more source
Heuristics for Multilevel Lot-Sizing with a Bottleneck
Management Science, 1986In this paper we present a heuristic method, based on Lagrangian relaxation, for multilevel lot-sizing when there is a single bottleneck facility. A series of Lagrangian relaxations (one for each item in the product structure) is imbedded in a branch and bound procedure.
Peter J. Billington +2 more
openaire +2 more sources
Capacitated lot-sizing with extensions: a review
4OR, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kuhn, Heinrich, Quadt, Daniel
openaire +1 more source
On the power of lookahead in online lot-sizing
Operations Research Letters, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Schumacher, André +3 more
openaire +3 more sources