On the feasibility of sequence-dependent economic lot scheduling problem

In this paper, we develop a formulation for the economic lot scheduling problem (ELSP) wherein products with sequence-dependent setups are to be scheduled on a single facility to minimise the average sum of inventory holding and setup costs. We show that our formulation, based on the time varying lo...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of production research Vol. 49; no. 10; pp. 2925 - 2939
Main Authors Shirodkar, Vinay A., Madhusudanan Pillai, V., Sridharan, R.
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis Group 15.05.2011
Taylor & Francis
Taylor & Francis LLC
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:In this paper, we develop a formulation for the economic lot scheduling problem (ELSP) wherein products with sequence-dependent setups are to be scheduled on a single facility to minimise the average sum of inventory holding and setup costs. We show that our formulation, based on the time varying lot size approach, always provides feasible schedules for any given sequence and is independent of the setups being sequence-independent or sequence-dependent. We compare our schedule with the schedule proposed by Dobson ( 1992 ) and reveal the infeasibility associated with Dobson's formulation. A numerical example evaluating schedules with both cases of setups: sequence-independent and sequence-dependent, demonstrates our assertion.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0020-7543
1366-588X
DOI:10.1080/00207541003738899