Economic Lot Scheduling for Multiple Products on Parallel Identical Processors

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.inventory/production, deterministic models, heuristics, multiprocessors, lot-sizing, scheduling

A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines

“…In the DLSP only one item can be produced per machine and per period and, if so, production uses the full capacity. Carreno (1990) proposes a heuristic for the economic lot scheduling problem (ELSP) for identical parallel machines with setup times. The ELSP is a continuous time and infinite horizon model with constant demand rate for each item.…”

A genetic algorithm for lot sizing and scheduling under capacity constraints and allowing backorders

“…Leachman and Gascon (1988) develop an heuristic for the case of time-varying, stochastic demands. Carreno (1990) suggests a heuristic procedure which applies a single-machine common cycle approach to the case of multiple machines. Zipkin (1991) presents an improved computational procedure for Dobson's formulation that uses a parametric quadratic programming approach.…”

GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem

“…The machines can have different production and setup costs, and can as well be capacitated. This problem has been studied by Lasdon and Terjung (1971), Carreno (1990), and Toledo and Armentano (2006).…”