New algorithm for Economic Lot Scheduling Problem

This paper uses time-varying lot size approach to solve Economic Lot Scheduling Problem (ELSP) and offers an efficient algorithm. The new algorithm, by defining and finding out obstacle items (the item with longer average production time is taken as obstacle item), and loading items to bins (obstacle items are loaded preferencially), can offer high quality solutions. Tested by Bomberger´s example, the solution shows that the new algorithm is better than previous algorithms.