Journal of Applied Mathematics and Decision Sciences
Volume 2007 (2007), Article ID 53606, 18 pages
Research Article

A Heuristic Approach for Determining Lot Sizes and Schedules Using Power-of-Two Policy

Esra Ekinci and Arslan M. Ornek

Industrial Engineering Depatment, Dokuz Eylul University, Bornova, Izmir 35100, Turkey

Received 17 August 2006; Revised 18 December 2006; Accepted 18 January 2007

Academic Editor: John Bell

Copyright © 2007 Esra Ekinci and Arslan M. Ornek. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


We consider the problem of determining realistic and easy-to-schedule lot sizes in a multiproduct, multistage manufacturing environment. We concentrate on a specific type of production, namely, flow shop type production. The model developed consists of two parts, lot sizing problem and scheduling problem. In lot sizing problem, we employ binary integer programming and determine reorder intervals for each product using power-of-two policy. In the second part, using the results obtained of the lot sizing problem, we employ mixed integer programming to determine schedules for a multiproduct, multistage case with multiple machines in each stage. Finally, we provide a numerical example and compare the results with similar methods found in practice.