Chun Hung Cheng

MULTI-PERIOD PLANNING AND UNCERTAINTY ISSUES IN CELLULAR MANUFACTURING: A REVIEW AND FUTURE DIRECTIONS

Abstract In this paper we review research that has been done to address cellular manufacturing under conditions of multi-period planning horizons, with demand and resource uncertainties. Most traditional cell formation procedures ignore any changes in demand over time caused by product redesign and uncertainties due to volume variation, part mix variation, and resource unreliability. However in today’s business environment, product life cycles are short, and demand volumes and product mix can vary frequently. Thus cell design needs to address these issues. It is only recently that researchers have been modelling uncertainty and multi-period issues. In this paper we conduct a comprehensive review of the work that addresses these issues. We present mathematical programming formulations as well as a taxonomy of existing models. Finally we suggest some directions for future research.

Dynamic layout algorithms : a state-of-the-art survey

It has been over a decade since Rosenblatt published his seminal paper on modelling the dynamic facility layout problem (DFLP). Since then, there have been improvements to Rosenblatts original dynamic programming model. Alternate solution methods have also been proposed. However, no comprehensive review of the research in the DFLP has been undertaken. In this paper we categorize the different works of research that have followed and discuss them. They include improved and more flexible solution methods, fathoming procedures, bound determinations and method comparisons.

A Hybrid Genetic Algorithm for the Dynamic Plant Layout Problem

Abstract The dynamic plant layout problem (DPLP) deals with the design of multi-period layout plans. Although an optimal solution method based on dynamic programming is available, it is not practical for large DPLPs. It has recently been shown that heuristics based on genetic algorithms can solve large DPLPs. In this research, we extend and improve the use of genetic algorithms by creating a hybrid genetic algorithm. A computational study is carried out to compare the proposed algorithm with the existing genetic algorithms and a recent simulated annealing algorithm. The study shows that the proposed algorithm is effective. Thus it may be useful in solving the larger problems.

Genetic search and the dynamic layout problem

Abstract An improved genetic algorithm for the dynamic layout problem is developed and tested in this research. Our genetic algorithm differs from the existing implementation in three ways: first, we adopt a different crossover operator, second, we use mutation, and third, we use a new generational replacement strategy to help increase population diversity. A computational study shows that the proposed GA is quite effective. Scope and purpose Most organizations today are operating in a dynamic and market-driven environment. To stay competitive, their facilities must be adaptive to market fluctuations. The dynamic layout problem devises a multi-period layout plan based on these demand fluctuations. In this paper, we propose an improved implementation of an existing genetic algorithm for solving the dynamic layout problem.

A genetic algorithm-based clustering approach for database partitioning

In a typical distributed/parallel database system, a request mostly accesses a subset of the entire database. It is, therefore, natural to organize commonly accessed data together and to place them on nearby, preferably the same, machine(s)/site(s). For this reason, data partitioning and data allocation are performance critical issues in distributed database application design. We are dealing with data partitioning. Data partitioning requires the use of clustering. Although many clustering algorithms have been proposed, their performance has not been extensively studied. Moreover, the special problem structure in clustering is rarely exploited. We explore the use of a genetic search-based clustering algorithm for data partitioning to achieve high database retrieval performance. By formulating the underlying problem as a traveling salesman problem (TSP), we can take advantage of this particular structure. Three new operators for GAs are also proposed and experimental results indicate that they outperform other operators in solving the TSP. The proposed GA is applied to solve the data-partitioning problem. Our computational study shows that our GA performs well for this application.

Dynamic cellular manufacturing under multiperiod planning horizons

Purpose – The purpose of this research paper is to discuss cellular manufacturing is discussed under conditions of changing product demand. Traditional cell formation procedures ignore any changes in demand over time from product redesign and other factors. However given that in todays business environment, product life cycles are short, a framework is proposed that creates a multi‐period cellular layout plan including cell redesign where appropriate.Design/methodology/approach – The framework is illustrated using a two‐stage procedure based on the generalized machine assignment problem and dynamic programming. This framework is conceptually compared to virtual cell manufacturing, which is useful when there is uncertainty in demand rather than anticipated changes in demand. A case study is used to explain how the concept would work in practice.Findings – One major characteristic of the proposed method is that it is flexible enough to incorporate existing cell formation procedures. It is shown through an ...

Cellular Manufacturing: A Statistical Review of the Literature (1965–1995)

This paper is both an extension and an expansion of two earlier studies concerned with the direction of OR/MS research as reported in its archival literature (Reisman and Kirschnick [Reisman, A., F. Kirshnick. 1994. The devolution of OR/MS: Implications from a statistical content analysis of papers in flagship journals. Opns. Res. 42(4) 577–588], [Reisman, A., F. Kirshnick. 1995. Research strategies used by OR/MS workers as shown by an analysis of papers in flagship journals. Opns. Res. 43(5) 731–739.]). All of these papers provide a content analysis of the OR/MS archival journals. However, this paper focuses on the entire life-cycle literature of Cellular Manufacturing as a module of OR/MS. It addresses the research strategy employed by, and the theory-vs-applied orientation exhibited by, the authors. In all, 235 articles, starting in 1969, were reviewed and classified on a five-point scale, ranging from pure theory to bonafide applications. Secondly, the articles were classified in terms of seven types ...

QFD application in an educational setting: a pilot field study

Illustrates how quality function deployment (QFD) can be used to measure customer satisfaction in educational institutions. Specifically, utilizes QFD in evaluating the MBA programme at Grand Valley State University. The inputs for the QFDs were obtained through several brainstorming sessions of MBA students, faculty members, administrators, and business people. The preliminary results of the pilot field test show that QFD is a very useful tool in ascertaining customer desires, prioritizing them, and directing organizational resources towards customer satisfaction.

A citation analysis of the technology innovation management journals

This paper is the first citation-analysis-based follow up to the subjective survey conducted in 1993 by the Technology Innovation Management Division (TIMD) of the Academy of Management (see J. Liker, TIM Newslett., vol.7, no.2, p.5-8, 1993). That survey established a hierarchical rating of journals publishing articles in the field of technology innovation management (TIM). For each of the 1204 journals cited in the five highest ranked journals in the TIM specialty group of Likers study (called the base journals) during the (base) period 1990-1993, a citation score is computed using three different methods: the overall score, the normalized score, and the weighted-score method. Rankings of the journals based on each of these three methods are discussed and compared one with the other. Moreover, rankings of the top journals identified by the three methods (modified to adjust for differences in sample size) were compared with Likers survey results ranking. The key finding of the study is that, under all scoring methods, the top six spots were held by the same journals, The variation in ranks, however, became progressively greater at lower ranks. Researchers, metaresearchers, academic administrators, journal editors, and others may find the citation-based trends, ranks, and other results developed in this study helpful in stimulating further scholarly discourse in the field of TIM as it relates to the effectiveness of the journals.

FACOPT: a user friendly FACility layout OPTimization system

Abstract The facility layout problem is a well-researched one. However, few effective and user friendly approaches have been proposed. Since it is an NP hard problem, various optimization approaches for small problems and heuristic approaches for the larger problems have been proposed. For the most part the more effective algorithms are not user friendly. On the other hand, user-friendly methods have not been effective in handling the intricacies such as unequal department sizes. In this research, we present FACOPT, a heuristic approach that is effective and user friendly. The software uses two methods, simulated annealing and genetic algorithm to solve the facility layout problem. Computational tests are also done to identify good parameter values and to compare the performance of the two algorithms. Scope and purpose Various methods have been proposed for facility layout where departments are laid out within a facility. However, many of them are not flexible enough to handle intricacies such as unequal department sizes. Others do not provide user-friendly interfaces. Thus, there is a need for user-friendly software incorporating effective and flexible procedures. In this research we present FACOPT, a heuristic approach that is effective and user friendly. The software uses two different approaches to solve the facility layout problem effectively. FACOPT has a Visual BASIC interface and runs under a Windows environment for ease of use.