Integer Programming for Discrete Optimization of the Agile Supply Chain Configuration Problem

Simple item page
dc.contributor.advisorAmeri, Farhad
dc.contributor.authorBeauchamp, Hayden D.
dc.contributor.committeeMemberNovoa, Clara
dc.contributor.committeeMemberSriraman, Vedaraman
dc.date.accessioned2013-06-03T19:43:14Z
dc.date.available2013-06-03T19:43:14Z
dc.date.issued2013-06
dc.description.abstractIn order to keep manufacturing operations in lockstep with current market trends, businesses must continue to incorporate agility into their supply chains. This includes the ability to assess and select new suppliers quickly. The Digital Manufacturing Market (DMM) and Manufacturing Service Description Language (MSDL) have been devised previously as the necessary IT components for improving the intelligence of the supply chain configuration process. The objective of this research is to enhance the performance of the DMM's search engine by incorporating combinatorial optimization techniques. In particular, this research is aimed at creating an integer programming formulation to efficiently and effectively solve the supply chain configuration problem by maximizing the technological competencies of the assigned suppliers, while meeting capacity and distance constraints. The column generation approach is adopted to resolve the issue of limited scalability of the traditional LP formulation. Vendor cuts are proposed as a method to constrain distance inside the supply chain network. The proposed column generation formulation successfully enables transition from a computationally prohibitive methodology to a fully scalable model that maintains functionality at very large sizes. The results also show that it is possible to achieve an economy of distance with little effect on match compatibility.
dc.description.departmentEngineering Technology
dc.formatText
dc.format.extent126 pages
dc.format.medium1 file (.pdf)
dc.identifier.citationBeauchamp, H. D. (2013). <i>Integer programming for discrete optimization of the agile supply chain configuration problem</i> (Unpublished thesis). Texas State University-San Marcos, San Marcos, Texas.
dc.identifier.urihttps://hdl.handle.net/10877/4614
dc.language.isoen
dc.subjectDiscrete optimization
dc.subjectInteger programming
dc.subjectSupplier selection problem
dc.subjectGeneralized assignment problem
dc.subjectColumn generation
dc.subject.lcshMathematical optimizationen_US
dc.subject.lcshInformation technology--Managementen_US
dc.subject.lcshIndustrial management--Technological innovationsen_US
dc.subject.lcshBusiness logisticsen_US
dc.titleInteger Programming for Discrete Optimization of the Agile Supply Chain Configuration Problem
dc.typeThesis
thesis.degree.departmentEngineering Technology
thesis.degree.disciplineIndustrial Technology
thesis.degree.grantorTexas State University-San Marcos
thesis.degree.levelMasters
thesis.degree.nameMaster of Science in Technology

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
BEAUCHAMP-THESIS-2013.pdf
Size:
616.44 KB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
LICENSE.txt
Size:
1.85 KB
Format:
Plain Text
Description:
Download

Collections

Graduate Theses and Dissertations