Results 211 to 220 of about 3,288 (260)

Lot-Sizing on a Tree [PDF]

open access: possibleSSRN Electronic Journal, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
DI SUMMA, MARCO, L. A. Wolsey
openaire   +1 more source

On the Wagner-Whitin Lot-Sizing Polyhedron [PDF]

open access: possibleMathematics of Operations Research, 2001
We study a family of unbounded polyhedra arising in the study of uncapacitated lot-sizing problems with Wagner-Whitin costs. We present a new proof of integrality based on completely characterizing the bounded faces of maximal dimension, and in particular showing that they are integral.
PEREIRA, Olivier, WOLSEY, Laurence
openaire   +2 more sources

Algorithms and reformulations for lot sizing problems [PDF]

open access: possible, 1995
In this paper we give a "personal" survey of the research on the polyhedral approach to lot-sizing problems developed over the last ten years. Most results concern the formulation and reformulations of single-item problems which can be used to tighten the formulation of practical multi-item and multi-stage problems.
POCHET, Yves, WOLSEY , Laurence
openaire   +1 more source

Lot sizing in the forging industry considering lot size dependent tool wear

Production Engineering, 2017
Lot sizing is an important task of production planning and control: basis of lot sizes are order change costs and costs for storage. Models for lot sizing do not consider lot size dependent maintenance costs. However, for a forging company the tool wear is very important, because the tooling costs represent a major part in the production cost.
Henrik Prinzhorn   +4 more
openaire   +1 more source

Lot Sizing with Randomly Graded Yields

Operations Research, 1997
We consider a single inventory item that is graded into one of two quality levels after production. The proportion of grade one units produced in a lot is a random variable assumed to follow the lognormal distribution. Demands for grade 2 may be filled with grade 1 product, but not vice versa.
Steven Nahmias, Kamran Moinzadeh
openaire   +1 more source

Economic Lot-Sizing [PDF]

open access: possible
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

Lot-Sizing Heuristics

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

Genetic algorithms in lot sizing decisions

Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), 2003
This 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, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Elisangela dos Santos-Meza   +2 more
openaire   +2 more sources

The Politics of Lot Sizing

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

Home - About - Disclaimer - Privacy