The Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem

Publisher Website
Google Scholar
Abstract
In this paper, we deal with the two-product, single-machine, static demand, infinite horizon lot scheduling problem. After a quick review of the literature, the necessary and sufficient conditions for feasibility are derived without imposing any preliminary requirements. Then, an optimal solution algorithm is presented. Finally, we show that a necessary condition for the feasibility of N-product schedules is that each cycle time be an integer multiple of some basic cycle time.

This publication has 0 references indexed in Scilit: