A Distributed Constraint Satisfaction Approach for Supply Chain Capable-to-Promise Coordination

Conference paper
First Online:

Abstract

Order promising starts with the available-to-promise (ATP) quantities. The short is then promised by capable-to-promise (CTP) quantities. Supply chain CTP coordination can be viewed as a distributed constraint satisfaction problem (DCSP) composed of a series of constraints about slack capacity, materials and orders distributed among supply chain members. To solve this problem, supply chain members should consider and resolve their intra- and inter-constraints via supply chain coordination. This research has proposed a DCSP approach for supply chain CTP coordination. With this approach, supply chain members can collaboratively determine a feasible integral supply chain CTP production plan.

Keywords

Order promising Capable-to-promise Available-to-promise Supply chain coordination Distributed constraint satisfaction problem 
This is a preview of subscription content, log in to check access.

Notes

Acknowledgments

The authors gratefully acknowledge the funding support by National Science Council, ROC through project No. NSC 99-2221-E-131-025.

References

  1. Chen K, Ji P (2007) A mixed integer programming model for advanced planning and scheduling (APS). Eur J Oper Res 181:515–522MathSciNetMATHCrossRefGoogle Scholar
  2. Hirayama K, Yokoo M (1997) Distributed partial constraint satisfaction problem. In: Proceedings of 3rd international conference on principles and practice of constraint programming, pp 222–336Google Scholar
  3. Kim DS (2006) Process chain: a new paradigm of collaborative commerce and synchronized supply chain. Bus Horizons 49:359–367CrossRefGoogle Scholar
  4. Lin JT, Chen JH (2005) Enhance order promising with ATP allocation planning considering material and capacity constraints. J Chin Inst Ind Eng 22:282–292CrossRefGoogle Scholar
  5. Min H, Zhou G (2002) Supply chain modeling: past, present and future. Comput Ind Eng 43:231–249CrossRefGoogle Scholar
  6. Stadtler H (2005) Supply chain management and advanced planning: basics, overview and challenges. Eur J Oper Res 163:575–588MATHCrossRefGoogle Scholar
  7. Yokoo M (1993) Constraint relaxation in distributed constraint satisfaction problem. In: Proceedings of 5th international conference on tools with artificial intelligence, pp 56–63Google Scholar
  8. Yokoo M (1995) Asynchronous weak-commitment search for solving distributed constraint satisfaction problems. In: Proceedings of 1st international conference on principles and practice of constraint programming, pp 88–102Google Scholar
  9. Yokoo M, Hirayama K (1996) Distributed breakout algorithm for solving distributed constraint satisfaction problems. In: Proceedings of 2nd international conference on Multiagent systems, pp 401–408Google Scholar
  10. Yokoo M, Hirayama K (1998) Distributed constraint satisfaction algorithm for complex local problems. In: Proceedings of 3rd international conference on Multiagent systems, pp 372–379Google Scholar
  11. Yokoo M, Hirayama K (2000) Algorithms for distributed constraint satisfaction: a review. Auton Agent Multi-Ag 3:185–207CrossRefGoogle Scholar
  12. Yokoo M, Durfee EH, Ishida T, Kuwabara K (1992) Distributed constraint satisfaction for formalizing distributed problem solving. In: Proceedings of 12th IEEE international conference on distributed computing systems, pp 614–621Google Scholar
  13. Yokoo M, Durfee EH, Ishida T, Kuwabara K (1998) The distributed constraint satisfaction problem: formalization and algorithms. IEEE T Knowl Data En 10:673–685CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Singapore 2013

Authors and Affiliations

  1. 1.Department of Industrial Engineering and ManagementMing Chi University of TechnologyNew TaipeiTaiwan
  2. 2.Department of Industrial Engineering and Management InformationHuafan UniversityNew TaipeiTaiwan

Personalised recommendations