Concurrent tolerance allocation and scheduling for complex assemblies. (October 2015)

• Record Type: Journal Article
• Authors: Geetha, K.; Ravindran, D.; Kumar, M. Siva; Islam, M.N.
• Is Part Of: Robotics and computer-integrated manufacturing. Volume 35(2015)
• Page Start: 84
• Page End: 95
• Publication Date: 2015-10
• Subjects: Tolerance allocation -- Scheduling -- Lagrange's multiplier method -- Genetic algorithm -- Tolerance cost model -- Tolerance machining time model -- Quality loss cost; Robots, Industrial -- Periodicals; Computer integrated manufacturing systems -- Periodicals; Robotics -- Periodicals; Robots industriels -- Périodiques; Productique -- Périodiques; Robotique -- Périodiques; 670.285
• DOI: 10.1016/j.rcim.2015.03.001
• Languages: English
• ISSNs: 0736-5845

Abstract

Abstract: Traditionally, tolerance allocation and scheduling have been dealt with separately in the literature. The aim of tolerance allocation is to minimize the tolerance cost. When scheduling the sequence of product operations, the goal is to minimize the makespan, mean flow time, machine idle time, and machine idle time cost. Calculations of manufacturing costs derived separately using tolerance allocation and scheduling separately will not be accurate. Hence, in this work, component tolerance was allocated by minimizing both the manufacturing cost (sum of the tolerance and quality loss cost) and the machine idle time cost, considering the product sequence. A genetic algorithm (GA) was developed for allocating the tolerance of the components and determining the best product sequence of the scheduling. To illustrate the effectiveness of the proposed method, the results are compared with those obtained with existing wheel mounting assembly discussed in the literature. Highlights: Tolerance allocated based on manufacturing and machine idle time cost with product sequence. Tolerance allocation and the best product sequence in scheduling have determined using GA