An ILP-embedded Tabu Search heuristic for the design of integrated cellular manfacturing systems with production planning and dynamic system reconfiguration

This paper describes a tabu search algorithm to solve the integrated cellular manufacturing systems design problem. The algorithm makes use of both short term and long term memory aspects, in combination with integer linear programming (ILP), to construct the neighbour solutions. Within the short term memory component, attributive recency based memory is used in tabu lists to determine the tabu status of move operators. Within the long-term memory structures, frequency based memory is used in the form of residency measures to guide the diversification scheme and explicit memory is used to guide the intensification scheme. Computational results show that the tabu search procedure generates good quality solutions and that better solution times are experienced compared to that of state-of-the-art optimization software, hence proves to be a viable algorithm especially for the larger sized problems. <br/

A comprehensive mathematical modeling approach to the design of cellular manufacturing systems integrating production planning and system reconfiguration

This paper presents and analyzes a comprehensive model for the design of cellular manufacturing systems (CMS). A recurring theme in research is a piecemeal approach when formulating CMS models. In this paper, the proposed model, to the best of the authors’ knowledge, is the most comprehensive one to date with a more integrated approach to CMS design, where production planning and system reconfiguration decisions are incorporated. Such a CMS model has not been proposed before and it features the presence of alternate process routings, operation sequence, duplicate machines, machine capacity and lot splitting. The developed model is a mixed integer non-linear program. Linearization procedures are proposed to convert it into a linearized mixed integer programming formulation. Computational results are presented by solving some numerical examples, extracted from the existing literature, with the linearized formulation

Cellular manufacturing systems design with routing flexibility, machine procurement, production planning and dynamic system reconfiguration

This paper investigates the problem of designing cellular manufacturing systems with multi-period production planning, dynamic system reconfiguration, operation sequence, duplicate machines, machine capacity and machine procurement. An important aspect of this problem is the introduction of routing flexibility in the system by the formation of alternate contingency process routings in addition to alternate main process routings for all part types. Contingency routings serve as backups so as to effectively address the reality of part process routing disruptions (in the main routings) owing to machine breakdowns and allow the cellular manufacturing system to operate in a continuous manner even in the event of such breakdowns. The paper also provides in-depth discussions on the trade-off between the increased flexibility obtained versus the additional cost to be incurred through the formation of contingency routings for all parts. Some sensitivity analysis is also performed on some of the model parameters. The problem is modelled and solved through a comprehensive mixed integer programming formulation. Computational results presented by solving some numerical examples show that the routing and process flexibilities can be incorporated within the cellular manufacturing system design without significant increase in the system cost