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.

Linked References

1. W. B. Crowston, M. Wagner, and F. Williams, “Economic lot size determination in multi-stage assembly systems,” Management Science, vol. 19, pp. 517–527, 1973. View at Zentralblatt MATH
2. P. A. Jensen and H. A. Khan, “Scheduling in a multistage production system with set-up and inventory costs,” AIIE Transactions, vol. 4, no. 2, pp. 126–133, 1972.
3. B. A. Kalymon, “A decomposition algorithm for arborescence inventory systems,” Operations Research, vol. 20, pp. 860–874, 1972. View at Zentralblatt MATH · View at MathSciNet
4. A. M. Ornek and P. Collier, “The determination of in-process inventory and manufacturing lead time in multi-stage production systems,” International Journal of Operations & Production Management, vol. 8, no. 1, pp. 74–80, 1988.
5. A. M. Ornek and O. Cengiz, “Capacitated lot sizing with alternative routings and overtime decisions,” International Journal of Production Research, vol. 44, no. 24, pp. 5363–5389, 2006. View at Publisher · View at Google Scholar
6. L. B. Schwarz and L. Schrage, “Optimal and system myopic policies for multi-echelon production/inventory assembly systems,” Management Science, vol. 21, no. 11, pp. 1285–1294, 1975. View at Zentralblatt MATH · View at MathSciNet
7. A. Z. Szendrovits, “Manufacturing cycle time determination for a multi-stage economic production quantity model,” Management Science, vol. 22, no. 3, pp. 298–308, 1975. View at Zentralblatt MATH
8. P. L. Jackson, W. L. Maxwell, and J. A. Muckstadt, “Determining optimal reorder intervals in capacitated production-distribution systems,” Management Science, vol. 34, no. 8, pp. 938–958, 1988. View at Zentralblatt MATH · View at MathSciNet
9. W. L. Maxwell and J. A. Muckstadt, “Establishing consistent and realistic reorder intervals in production-distribution systems,” Operations Research, vol. 33, no. 6, pp. 1316–1341, 1985. View at Zentralblatt MATH
10. J. A. Muckstadt and R. O. Roundy, “Analysis of multi-stage production systems,” in Logistics of Production and Inventory, S. Graves, A. H. G. Rinnooy Kan, and P. Zipkin, Eds., vol. 4 of Handbook in Operations Research and Management Sci., pp. 59–131, North-Holland, Amsterdam, The Netherlands, 1993.
11. J. Ouenniche and F. F. Boctor, “The multi-product, economic lot-sizing problem in flow shops: the powers-of-two heuristic,” Computers & Operations Research, vol. 28, no. 12, pp. 1165–1182, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
12. P. Jackson, W. Maxwell, and J. Muckstadt, “The joint replenishment problem with a powers-of-two restriction,” IIE Transactions, vol. 17, no. 1, pp. 25–32, 1985.
13. R. Roundy, “$98\%$-effective integer-ratio lot-sizing for one-warehouse multi-retailer systems,” Management Science, vol. 31, no. 11, pp. 1416–1430, 1985. View at Zentralblatt MATH
14. J. A. Muckstadt and R. O. Roundy, “Multi-item, one-warehouse, multi-retailer distribution systems,” Management Science, vol. 33, no. 12, pp. 1613–1621, 1987.
15. D. Atkins, M. Queyranne, and D. Sun, “Lot sizing policies for finite production rate assembly systems,” Operations Research, vol. 40, no. 1, pp. 126–141, 1992. View at Zentralblatt MATH · View at MathSciNet
16. D. Atkins and D. Sun, “$98\%$-effective lot sizing for series inventory systems with backlogging,” Operations Research, vol. 43, no. 2, pp. 335–345, 1995. View at Zentralblatt MATH · View at MathSciNet
17. M. K. El-Najdawi, “A job-splitting heuristic for lot-size scheduling in multi-stage, multi-product production processes,” European Journal of Operational Research, vol. 75, no. 2, pp. 365–377, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
18. M. K. El-Najdawi, “Multi-cyclic flow shop scheduling: an application in multi-stage, multi-product production processes,” International Journal of Production Research, vol. 35, no. 12, pp. 3323–3332, 1997. View at Publisher · View at Google Scholar
19. J. Ouenniche and F. F. Boctor, “The G-group heuristic to solve the multi-product, sequencing, lot sizing and scheduling problem in flow shops,” International Journal of Production Research, vol. 39, no. 1, pp. 81–98, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
20. J. Ouenniche and F. F. Boctor, “The two-group heuristic to solve the multi-product, economic lot sizing and scheduling problem in flow shops,” European Journal of Operational Research, vol. 129, no. 3, pp. 539–554, 2001. View at Publisher · View at Google Scholar · View at MathSciNet
21. M.-J. Yao and S. E. Elmaghraby, “The economic lot scheduling problem under power-of-two policy,” Computers & Mathematics with Applications, vol. 41, no. 10-11, pp. 1379–1393, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
22. F.-C. Lee and M.-J. Yao, “A global optimum search algorithm for the joint replenishment problem under power-of-two policy,” Computers & Operations Research, vol. 30, no. 9, pp. 1319–1333, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
23. J. Ouenniche, F. F. Boctor, and A. Martel, “The impact of sequencing decisions on multi-item lot sizing and scheduling in flow shops,” International Journal of Production Research, vol. 37, no. 10, pp. 2253–2270, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH