Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 1999. / Submitted to the Dept. of Electrical Engineering and Computer Science, MIT. / Includes bibliographical references (p. 110-114). / In the automobile manufacturing industry, vehicle production is an assembly-line process. Automobile companies typically sequence vehicle production based on workload balancing factors, with little consideration of vehicle colors. The resulting sequence usually has a small average paint block size. Because automobile manufacturers use expensive and sometimes pollutant chemicals to clean out old paint at each color change, they would like to increase the size of the paint blocks, while maintaining the original workload-balanced vehicle sequence. To achieve this goal, Ford and other automobile manufacturers are considering automated vehicle storage and retrieval systems that would allow them to perturb the original sequence around the vehicle painting station, creating larger paint blocks and then restoring the original sequence after painting. To evaluate these systems, it is necessary to develop a method for re sequencing cars and for calculating the resulting savings in paint cleanings. The problem of resequencing can be cast as a traveling salesman problem with time windows. For a real-life sequence size of 750 cars and windows of 75 slots per car in either direction, direct modeling using the strongest known ... formulation yields an integer program with up to 200,000 constraints and 14,000,000 variables. Reduced formulations. We exploit special problem structure to solve the LP relaxation of this problem quickly using Lagrangean relaxation. We prove and use an order-within-color property to construct an enumerative formulation, and use a greedy approach to bound the LP optimum. We decompose the problem and solve smaller enumerative formulations sequentially to generate a heuristic solution that empirically is within 2.5% of optimality. Because our heuristic and bounding procedure runs in a total of one minute, an automobile manufacturer could use the process to adjust the resequencing process in real time to compensate for vehicles that have been delayed in the original sequence due to production defects or other disruptions. We also establish worst-case bounds ranging from 2.5 to 6 for another related heuristic. / by Joel Scott Sokol. / Ph.D.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/58514 |
| Date | January 1999 |
| Creators | Sokol, Joel Scott, 1971- |
| Contributors | Thomas L. Magnanti., Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science., Massachusetts Institute of Technology. Operations Research Center, Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| Publisher | Massachusetts Institute of Technology |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | English |
| Detected Language | English |
| Type | Thesis |
| Format | 114 p., application/pdf |
| Rights | M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission., http://dspace.mit.edu/handle/1721.1/7582 |
Page generated in 0.0164 seconds