Economic Lot Scheduling for Multiple Products on Parallel Identical Processors

Jose Juan Carreno
Additional contact information
Jose Juan Carreno: Dpto. de Ingenieria Industrial Tecnologico de Celaya, Mexico

Management Science, 1990, vol. 36, issue 3, 348-358

Abstract: This paper deals with an identical multiprocessor, multiproduct, lot-size scheduling problem under deterministic conditions. The problem is an extension of the single-processor ELSP problem. The objective is to minimize the average production and inventory costs per unit time subject to constraints of no shortages and no interference among the products. A mathematical formulation for the problem is given. A heuristic procedure, which extends the Common Cycle approach for a single processor, is suggested and computational results are reported. Upper and Lower bounds are developed and used to measure the effectiveness of the procedure.

Keywords: inventory/production; deterministic models; heuristics; multiprocessors; lot-sizing; scheduling (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (17)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.36.3.348 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:36:y:1990:i:3:p:348-358

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().