Discussion A note on 'Application of simulated annealing to a linear model for the formulation of machine cells in group technology'
01 May 1998-International Journal of Production Research (Taylor & Francis Group)-Vol. 36, Iss: 5, pp 1445-1447
About: This article is published in International Journal of Production Research.The article was published on 1998-05-01. It has received 12 citations till now. The article focuses on the topics: Adaptive simulated annealing & Simulated annealing.
Citations
More filters
TL;DR: A review and comparison of the approaches to multi-criteria decision-making (MCDM) in the design of manufacturing cells is provided in this paper, together with an overview on the MCDM.
Abstract: The purpose of this paper is to provide a review and comparison of the approaches to multi-criteria decision-making (MCDM) in the design of manufacturing cells. A brief description of existing classifications is provided, together with an overview on the MCDM. Selected papers are reviewed and a structured scheme is outlined which allows comparison of inputs, criteria, solution approaches and outputs across selected models. Finally the models are discussed and directions for new avenues of work are identified.
134 citations
TL;DR: In this paper a mathematical programming model for the cell formation problem with multiple identical machines, which minimises the intercellular flow is presented and a simulated annealing algorithm was developed to solve it.
107 citations
Cites methods from "Discussion A note on 'Application o..."
...A few methods appeared recently that use either operation sequence or flow matrix information to solve the cell formation problem (for example, Sofianopoulou, 1997; Del Valle et al., 1994; Okogbaa et al., 1992)....
[...]
...Keywords: Manufacturing; Cellular manufacturing systems; Simulated annealing...
[...]
...Since then the algorithm has been applied to many optimisation problems in a wide variety of areas, including cell formation problems (Su and Hsu, 1998; Adil et al., 1997; Sofianopoulou, 1997; Chen et al., 1995)....
[...]
TL;DR: In this article, a new similarity coefficient measure that uses a set of important characteristic properties for grouping is developed for use as an intermediate tool to form cohesive cells and a mathematical model that uses this similarity coefficient for optimally solving the cell-formation problems in cellular manufacturing is developed.
Abstract: For more than three decades, similarity coefficient measures one of the important tools for solving group technology problems have gained the attention of the research community in cellular manufacturing systems. A new similarity coefficient measure that uses a set of important characteristic properties for grouping is developed here for use as an intermediate tool to form cohesive cells. A mathematical model that uses this similarity coefficient for optimally solving the cell-formation problems in cellular manufacturing is developed. A heuristic procedure that improves the optimal methodology in term of solution capability of the large instances is devised for an efficient solution. Both the optimal methodology and the heuristic are applied to some well-known problems from literature to compare the grouping efficiencies. The similarity coefficient and the solution methodologies developed are able to solve the cell formation problems efficiently.
90 citations
TL;DR: In this paper, a pre-emptive goal programming formulation is developed for concurrently forming independent part/machine cells, where machine independent capability units are used to define processing requirements of parts and processing capabilities of machine tools.
Abstract: A pre-emptive goal programming formulation is developed for concurrently forming independent part/machine cells. Machine independent capability units, which are known as Resource Elements (RE), are used to define processing requirements of parts and processing capabilities of machine tools. Representation of unique and shared capability boundaries of machine tools is possible via RE, which increases the opportunity to form independent manufacturing cells and efficient utilization of them. RE-based operation sequences, processing times, capacities, demand, cell sizes, cell flexibility, load balance between cells, cell interaction, copies of each machine type in the job shop are all considered in the problem formulation. The model is solved by a specially developed tabu search algorithm.
55 citations
TL;DR: An efficient simulated annealing method to solve the cell formation problem (CFP) in a dynamic environment with a multi-period planning horizon and the results show that the gap between optimal and SA solutions is less than 4%, which indicates the efficiency of the developed SA scheme.
Abstract: This paper presents an integer-linear programming approach for a cell formation problem (CFP) in a dynamic environment with a multi-period planning horizon. The objectives are to minimize the inter-cell movement and machine costs simultaneously. In dynamic environments, the product mix and demand are different but deterministic in each period. As a consequence, the formed cells in the current period may not be optimal for the next period. Thus, the reconfiguration of cells is required. Reconfiguration consists of re-forming part families, machine groups, and machine relocation. The CFP belongs to the category of NP-hard problems, thus we develop an efficient simulated annealing (SA) method to solve such a problem. The proposed mathematical model is optimally solved and the associated results are compared with the results obtained by the SA run. The results show that the gap between optimal and SA solutions is less than 4%, which indicates the efficiency of the developed SA scheme.
52 citations
Cites methods from "Discussion A note on 'Application o..."
...Some researches have been carried out in a static cell formation by considering alternative process plans or machine duplication (Logendran et al, 1994; Sofianopoulou, 1997; Caux et al, 2000; Adenso-Diaz et al, 2001)....
[...]
...SA is one of the most efficient metaheuristic approaches that has been applied to many optimization problems in a wide variety of areas including CFPs (Adil et al, 1993, 1997; Chen et al, 1995; Sofianopoulou, 1997; Su and Hsu, 1998)....
[...]
References
More filters
TL;DR: A review and comparison of the approaches to multi-criteria decision-making (MCDM) in the design of manufacturing cells is provided in this paper, together with an overview on the MCDM.
Abstract: The purpose of this paper is to provide a review and comparison of the approaches to multi-criteria decision-making (MCDM) in the design of manufacturing cells. A brief description of existing classifications is provided, together with an overview on the MCDM. Selected papers are reviewed and a structured scheme is outlined which allows comparison of inputs, criteria, solution approaches and outputs across selected models. Finally the models are discussed and directions for new avenues of work are identified.
134 citations
TL;DR: In this paper a mathematical programming model for the cell formation problem with multiple identical machines, which minimises the intercellular flow is presented and a simulated annealing algorithm was developed to solve it.
107 citations
TL;DR: In this article, a new similarity coefficient measure that uses a set of important characteristic properties for grouping is developed for use as an intermediate tool to form cohesive cells and a mathematical model that uses this similarity coefficient for optimally solving the cell-formation problems in cellular manufacturing is developed.
Abstract: For more than three decades, similarity coefficient measures one of the important tools for solving group technology problems have gained the attention of the research community in cellular manufacturing systems. A new similarity coefficient measure that uses a set of important characteristic properties for grouping is developed here for use as an intermediate tool to form cohesive cells. A mathematical model that uses this similarity coefficient for optimally solving the cell-formation problems in cellular manufacturing is developed. A heuristic procedure that improves the optimal methodology in term of solution capability of the large instances is devised for an efficient solution. Both the optimal methodology and the heuristic are applied to some well-known problems from literature to compare the grouping efficiencies. The similarity coefficient and the solution methodologies developed are able to solve the cell formation problems efficiently.
90 citations
TL;DR: In this paper, a pre-emptive goal programming formulation is developed for concurrently forming independent part/machine cells, where machine independent capability units are used to define processing requirements of parts and processing capabilities of machine tools.
Abstract: A pre-emptive goal programming formulation is developed for concurrently forming independent part/machine cells. Machine independent capability units, which are known as Resource Elements (RE), are used to define processing requirements of parts and processing capabilities of machine tools. Representation of unique and shared capability boundaries of machine tools is possible via RE, which increases the opportunity to form independent manufacturing cells and efficient utilization of them. RE-based operation sequences, processing times, capacities, demand, cell sizes, cell flexibility, load balance between cells, cell interaction, copies of each machine type in the job shop are all considered in the problem formulation. The model is solved by a specially developed tabu search algorithm.
55 citations
TL;DR: An efficient simulated annealing method to solve the cell formation problem (CFP) in a dynamic environment with a multi-period planning horizon and the results show that the gap between optimal and SA solutions is less than 4%, which indicates the efficiency of the developed SA scheme.
Abstract: This paper presents an integer-linear programming approach for a cell formation problem (CFP) in a dynamic environment with a multi-period planning horizon. The objectives are to minimize the inter-cell movement and machine costs simultaneously. In dynamic environments, the product mix and demand are different but deterministic in each period. As a consequence, the formed cells in the current period may not be optimal for the next period. Thus, the reconfiguration of cells is required. Reconfiguration consists of re-forming part families, machine groups, and machine relocation. The CFP belongs to the category of NP-hard problems, thus we develop an efficient simulated annealing (SA) method to solve such a problem. The proposed mathematical model is optimally solved and the associated results are compared with the results obtained by the SA run. The results show that the gap between optimal and SA solutions is less than 4%, which indicates the efficiency of the developed SA scheme.
52 citations