Share This Article:

Heuristics for Production Allocation and Ordering Policies in Multi-Plants with Capacity

Abstract Full-Text HTML Download Download as PDF (Size:119KB) PP. 16-22
DOI: 10.4236/jssm.2010.31002    5,276 Downloads   8,690 Views  
Author(s)    Leave a comment


Joint decisions in production allocation and ordering policies for single and multiple products in a production-distribution network system consisting of multiple plants are discussed, production capacity constraints of multi-plants and unit production capacity for producing a product are considered. Based on the average total cost in unit time, the decisive model is established. It tries to determine the production cycle length, delivery frequency in a cycle from the warehouse to the retailer and the economic production allocation. The approach hinges on providing an optimized solution to the joint decision model through the heuristics methods. The heuristic algorithms are proposed to solve the single-product joint decision model and the multi-products decision problem. Simulations on different sizes of problems have shown that the heuristics is effective, and in general more effective than Quasi-Newton method (QNM).

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

J. Zang and J. Tang, "Heuristics for Production Allocation and Ordering Policies in Multi-Plants with Capacity," Journal of Service Science and Management, Vol. 3 No. 1, 2010, pp. 16-22. doi: 10.4236/jssm.2010.31002.


[1] R. H. King and R. R. Love, “Coordinating decisions for increased profits,” Interfaces, Vol. 10, pp. 4–19, 1980.
[2] J. F. Williams, “Heuristic techniques for simultaneous scheduling of production and distribution multi-echelons structures: Theory and empirical comparisons,” Manage- ment Science, Vol. 27, pp. 336–352, 1981.
[3] R. M. Hill, “The single-manufacturer single-retailer integrated production-inventory model with a generalized policy,” European Journal of Operational Research, Vol. 97, pp. 493–499, 1997.
[4] I. David and M. Eben-Chaime, “How far should JIT vendor– buyer relationships go?” International Journal of Production Economic, Vol. 81, pp. 361–368, 2003.
[5] T. Kim, Y. Hong, and J. Lee, “Joint economic production allocation and ordering policies in a supply chain consisting of multiple plants and a single retailer,” Inter- national Journal of Production Research, Vol. 43, pp. 3619–3632, 2005.
[6] T. Kim and Y. Hong, “Technical note: Production allocation, lot-sizing, and shipment policies for multiple items in multiple production lines,” International Journal of Production Research, Vol. 46, pp. 289–294, 2008.
[7] R. W. Hall, “On the integration of production and distribution: Economic order and production quantity implications,” Transportation Research, Part B, Vol. 30, pp. 387–403, 1996.
[8] J. Hahm and C. A. Yano, “The economic lot and delivery scheduling problem: The single item case,” International Journal Production Econom, Vol. 28, pp. 238–252, 1992.
[9] J. Benjamin, “An analysis of inventory and trans- portation costs in a constrained network,” Transportation Science, Vol. 23, pp. 177–183, 1989.
[10] D. E. Blumenfeld, L. D. Burns, and C. F. Daganzo, “Synchronizing production and transportation schedules,” Transportation Research, Vol. 25, pp. 23–37, 1991.
[11] F. Fumero and C. Vercellis, “Synchronized development of production, inventory and distribution schedule,” Transportation Science, Vol. 33, pp. 330–340, 1999.
[12] J. F. Tang, K. L. Yung, and A. W. H. Ip., “Heuristics based integrated decisions for logistics network systems,” Journal Manufacturing Systems, Vol. 23 , pp. 1–13, 2004.
[13] K. L. Yung, J. F. Tang, A. W. H. Ip., and D. W. Wang, “Heuristics for joint decisions in production, transpor- tation, and order quantity,” Transportation Science, Vol. 40, pp. 99–116, 2006.
[14] S. Sahni, “Computationally related problems,” SIAM Journal on Computing, Vol. 3, pp. 262–279, 1974.

comments powered by Disqus

Copyright © 2018 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.