A Branch and Bound Algorithm Based on DC Programming and DCA for Strategic Capacity Planning in Supply Chain Design for a New Market Opportunity

Nguyen Canh Nam (), Thi Hoai An () and Pham Dinh Tao ()
Additional contact information
Nguyen Canh Nam: National Institute for Applied Sciences
Thi Hoai An: Metz University
Pham Dinh Tao: National Institute for Applied Sciences

A chapter in Operations Research Proceedings 2006, 2007, pp 515-520 from Springer

Abstract: Abstract Supply chain network are considered as solution for effectively meeting customer requirements such as low cost, high product variety, quality and shorter lead times. The success of a supply chain lies in good strategic and tactical planning and monitoring at the operational level. Strategic planning is long term planning and usually consists in selecting providers and distributors, location and capacity planning of manufacturing/servicing units, among others.

Keywords: Supply Chain Network; Exact Penalty; Supply Chain Design; Trust Region Subproblem; High Product Variety (search for similar items in EconPapers)
Date: 2007
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-540-69995-8_82

Ordering information: This item can be ordered from
http://www.springer.com/9783540699958

DOI: 10.1007/978-3-540-69995-8_82

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().