Persistent Link:
http://hdl.handle.net/10150/184195
Title:
DYNAMIC PRODUCTION PLANNING WITH SUBCONTRACTING.
Author:
Wu, Yih-Bor
Issue Date:
1987
Publisher:
The University of Arizona.
Rights:
Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
Abstract:
This research is concerned with scheduling production over a finite planning horizon in a capacitated manufacturing facility. It is assumed that a second source of supply is available by means of subcontracting and that the demand varies over time. The problem is to establish the production level in the facility and/or the ordering quantity from the subcontractor for each period in the planning horizon. Firstly, the cost functions are analyzed and two types of realistic production cost models are identified. Then mathematical models are developed for two different problems. One is a single criterion problem aimed at minimizing the total production and inventory costs. The other is a bicriterion problem which seeks the efficient frontier with respect to the total cost and the number of subcontractings, both to be minimized, over the planning horizon. For each of the above, two methods, namely, a general dynamic programming approach and an improved dynamic programming approach (Shortest path method) are presented. Several results are obtained for reducing the computations in solving these problems. Based on these results, algorithms are developed for both problems. The computational complexity of these algorithms are also analyzed. Two heuristic rules are then suggested for obtaining near-optimal solutions to the first problem with lesser computation. Both rules have been tested extensively and the results indicate advantages of using them. One of these rules is useful for solving the uncapacitated problem faster without losing optimality. The above results are then extended to other cases where some of the assumptions in the original problem are relaxed. Finally, we studied the multi-item lot-sizing problem with the subcontracting option and proposed a heuristic for solving the problem by the Lagrangean relaxation approach. We demonstrated that with an additional capacity constraint in the dual problem the feasible solution and the lower bound obtained during each iteration converge much faster than without it. After testing some randomly generated problems we found that most of the solutions obtained from the heuristic are very close to the best lower bound obtained from the dual problem within a limited number of iterations.
Type:
text; Dissertation-Reproduction (electronic)
Keywords:
Production planning.; Production control.; Production scheduling.; Dynamic programming.; Subcontracting.
Degree Name:
Ph.D.
Degree Level:
doctoral
Degree Program:
Systems and Industrial Engineering; Graduate College
Degree Grantor:
University of Arizona
Advisor:
John, Thuruthickara C.
Committee Chair:
John, Thuruthickara C.

Full metadata record

DC FieldValue Language
dc.language.isoenen_US
dc.titleDYNAMIC PRODUCTION PLANNING WITH SUBCONTRACTING.en_US
dc.creatorWu, Yih-Boren_US
dc.contributor.authorWu, Yih-Boren_US
dc.date.issued1987en_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.description.abstractThis research is concerned with scheduling production over a finite planning horizon in a capacitated manufacturing facility. It is assumed that a second source of supply is available by means of subcontracting and that the demand varies over time. The problem is to establish the production level in the facility and/or the ordering quantity from the subcontractor for each period in the planning horizon. Firstly, the cost functions are analyzed and two types of realistic production cost models are identified. Then mathematical models are developed for two different problems. One is a single criterion problem aimed at minimizing the total production and inventory costs. The other is a bicriterion problem which seeks the efficient frontier with respect to the total cost and the number of subcontractings, both to be minimized, over the planning horizon. For each of the above, two methods, namely, a general dynamic programming approach and an improved dynamic programming approach (Shortest path method) are presented. Several results are obtained for reducing the computations in solving these problems. Based on these results, algorithms are developed for both problems. The computational complexity of these algorithms are also analyzed. Two heuristic rules are then suggested for obtaining near-optimal solutions to the first problem with lesser computation. Both rules have been tested extensively and the results indicate advantages of using them. One of these rules is useful for solving the uncapacitated problem faster without losing optimality. The above results are then extended to other cases where some of the assumptions in the original problem are relaxed. Finally, we studied the multi-item lot-sizing problem with the subcontracting option and proposed a heuristic for solving the problem by the Lagrangean relaxation approach. We demonstrated that with an additional capacity constraint in the dual problem the feasible solution and the lower bound obtained during each iteration converge much faster than without it. After testing some randomly generated problems we found that most of the solutions obtained from the heuristic are very close to the best lower bound obtained from the dual problem within a limited number of iterations.en_US
dc.typetexten_US
dc.typeDissertation-Reproduction (electronic)en_US
dc.subjectProduction planning.en_US
dc.subjectProduction control.en_US
dc.subjectProduction scheduling.en_US
dc.subjectDynamic programming.en_US
dc.subjectSubcontracting.en_US
thesis.degree.namePh.D.en_US
thesis.degree.leveldoctoralen_US
thesis.degree.disciplineSystems and Industrial Engineeringen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.contributor.advisorJohn, Thuruthickara C.en_US
dc.contributor.chairJohn, Thuruthickara C.en_US
dc.contributor.committeememberAskin, Ronald G.en_US
dc.contributor.committeememberMarsten, Royen_US
dc.contributor.committeememberLaSalle, Jamesen_US
dc.contributor.committeememberHigle, Juliaen_US
dc.identifier.proquest8726851en_US
dc.identifier.oclc699807345en_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.