With the growing trend for greater product variety, mixed-model assembly nowadays is commonly employed in many industries, which can enable just-in-time production for a production system with high variety. Efficient production scheduling and sequencing is important to achieve the overall material supply, production, and distribution efficiency around the mixed-model assembly line. This research addresses production scheduling and sequencing on a mixed-model assembly line for products with multiple product options, considering multiple objectives with regard to material supply, manufacturing, and product distribution. This research also addresses plant assignment for a product with multiple product options as a prior step to scheduling and sequencing for a mixed-model assembly line. This dissertation is organized into three parts based on three papers.
Introduction and literature review
Part 1. In an automobile assembly plant many product options often need to be considered in sequencing an assembly line with which multiple objectives often need to be considered. A general heuristic procedure is developed for sequencing automobile assembly lines considering multiple options. The procedure uses the construction, swapping, and re-sequencing steps, and a limited search for sequencing automobile assembly lines considering multiple options.
Part 2. In a supply chain, production scheduling and finished goods distribution have been increasingly considered in an integrated manner to achieve an overall best efficiency. This research presents a heuristic procedure to achieve an integrated consideration of production scheduling and product distribution with production smoothing for the automobile just-in-time production assembly line. A meta-heuristic procedure is also developed for improving the heuristic solution.
Part 3. For a product that can be manufactured in multiple facilities, assigning orders to the facility is a common problem faced by industry considering production, material constraints, and other supply-chain related constraints. This paper addresses products with multiple product options for plant assignment with regard to multiple constraints at individual plants in order to minimize transportation costs and costs of assignment infeasibility. A series of binary- and mixed-integer programming models are presented, and a decision support tool based on optimization models is presented with a case study.
Summary and conclusions
| Identifer | oai:union.ndltd.org:UTENN/oai:trace.tennessee.edu:utk_graddiss-1446 |
| Date | 01 May 2008 |
| Creators | He, Jingxu |
| Publisher | Trace: Tennessee Research and Creative Exchange |
| Source Sets | University of Tennessee Libraries |
| Detected Language | English |
| Type | text |
| Source | Doctoral Dissertations |
Page generated in 0.0021 seconds