Abstract
The economic lot scheduling problem (ELSP) has received much attention recently. The general version of the problem has a non-convex objective function, so it is difficult to find truly optimal solutions. We examine the three most popular heuristic approaches to the fixed-sequence ELSP. Each approach imposes one or both of these simplifying constraints: the zero-switch constraint (production of a part is started only when its inventory is depleted) and the equal-lot constraint (the lot size of a given part is constant through time). We provide a formulation that clarifies the relationships between the general problem and the three constrained versions, and compare their performances in a computational study.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
