Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Industrial Engineering and Management Systems
Journal Basic Information
Journal DOI :
Korean Institute of Industrial Engineers
Editor in Chief :
Volume & Issues
Volume 7, Issue 3 - Dec 2008
Volume 7, Issue 2 - Sep 2008
Volume 7, Issue 1 - Jun 2008
Selecting the target year
A Comparative Study of Two-phase Heuristic Approaches to General Job Shop Scheduling Problem
Sun, Ji Ung ;
Industrial Engineering and Management Systems, volume 7, issue 2, 2008, Pages 84~92
Scheduling is one of the most important issues in the planning and operation of production systems. This paper investigates a general job shop scheduling problem with reentrant work flows and sequence dependent setup times. The disjunctive graph representation is used to capture the interactions between machines in job shop. Based on this representation, four two-phase heuristic procedures are proposed to obtain near optimal solutions for this problem. The obtained solutions in the first phase are substantially improved by reversing the direction of some critical disjunctive arcs of the graph in the second phase. A comparative study is conducted to examine the performance of these proposed algorithms.
Research Issues in Robust QFD
Kim, Kwang-Jae ; Kim, Deok-Hwan ;
Industrial Engineering and Management Systems, volume 7, issue 2, 2008, Pages 93~100
Quality function deployment (QFD) provides a specific approach for ensuring quality throughout each stage of the product development and production process. Since the focus of QFD is placed on the early stage of product development, the uncertainty in the input information of QFD is inevitable. If the uncertainty is neglected, the QFD analysis results are likely to be misleading. It is necessary to equip practitioners with a new QFD methodology that can model, analyze, and dampen the effects of the uncertainty and variability in a systematic manner. Robust QFD is an extended version of QFD methodology, which is robust to the uncertainty of the input information and the resulting variability of the QFD output. This paper discusses recent research issues in Robust QFD. The major issues are related with the determination of overall priority, robustness evaluation, robust prioritization, and web-based Robust QFD optimizer. Our recent research results on the issues are presented, and some of future research topics are suggested.
A Synthetic Exponentially Weighted Moving-average Chart for High-yield Processes
Kusukawa, Etsuko ; Kotani, Takayuki ; Ohta, Hiroshi ;
Industrial Engineering and Management Systems, volume 7, issue 2, 2008, Pages 101~112
As charts to monitor the process fraction defectives, P, in the high-yield processes, Mishima et al. (2002) discussed a synthetic chart, the Synthetic CS chart, which integrates the CS (Confirmation Sample)
chart and the CCC-r chart. The Synthetic CS chart is designed to monitor quality characteristics in real-time. Recently, Kotani et al. (2005) presented the EWMA (Exponentially Weighted Moving-Average)
chart, which considers combining the quality characteristics monitored in the past with one monitored in real-time. In this paper, we present an alternative chart that is more superior to the
chart. It is an integration of the
chart and the CCC-r chart. In using the proposed chart, the quality characteristic is initially judged as either the in-control state or the out-of-control state, using the lower and upper control limits of the
chart. If the process is not judged as the in-control state by the
chart, the process is successively judged, using the
chart. We compare the ANOS (Average Number of Observations to Signal) of the proposed chart with those of the
chart and the Synthetic CS chart. From the numerical experiments, with the small size of inspection items, the proposed chart is the most sensitive to detect especially the small shifts in P among other charts.
Integrating Machine Reliability and Preventive Maintenance Planning in Manufacturing Cell Design
Das, Kanchan ; Lashkari, R.S. ; Sengupta, S. ;
Industrial Engineering and Management Systems, volume 7, issue 2, 2008, Pages 113~125
This paper presents a model for designing cellular manufacturing systems (CMS) by integrating system cost, machine reliability, and preventive maintenance (PM) planning. In a CMS, a part is processed using alternative process routes, each consisting of a sequence of visits to machines. Thus, a level of 'system reliability' is associated with the machines along the process route assigned to a part type. Assuming machine reliabilities to follow the Weibull distribution, the model assigns the machines to cells, and selects, for each part type, a process route which maximizes the overall system reliability and minimizes the total costs of manufacturing operations, machine underutilization, and inter-cell material handling. The model also incorporates a reliability based PM plan and an algorithm to implement the plan. The algorithm determines effective PM intervals for the CMS machines based on a group maintenance policy and thus minimizes the maintenance costs subject to acceptable machine reliability thresholds. The model is a large mixed integer linear program, and is solved using LINGO. The results point out that integrating PM in the CMS design improves the overall system reliability markedly, and reduces the total costs significantly.
The Asymptotic Worst-Case Ratio of the Bin Packing Problem by Maximum Occupied Space Technique
Ongkunaruk, Pornthipa ;
Industrial Engineering and Management Systems, volume 7, issue 2, 2008, Pages 126~132
The bin packing problem (BPP) is an NP-Complete Problem. The problem can be described as there are
which is a set of item indices and
be a set of item sizes sj, where
. The objective is to minimize the number of bins used for packing items in N into a bin such that the total size of items in a bin does not exceed the bin capacity. Assume that the bins have capacity equal to one. In the past, many researchers put on effort to find the heuristic algorithms instead of solving the problem to optimality. Then, the quality of solution may be measured by the asymptotic worst-case ratio or the average-case ratio. The First Fit Decreasing (FFD) is one of the algorithms that its asymptotic worst-case ratio equals to 11/9. Many researchers prove the asymptotic worst-case ratio by using the weighting function and the proof is in a lengthy format. In this study, we found an easier way to prove that the asymptotic worst-case ratio of the First Fit Decreasing (FFD) is not more than 11/9. The proof comes from two ideas which are the occupied space in a bin is more than the size of the item and the occupied space in the optimal solution is less than occupied space in the FFD solution. The occupied space is later called the weighting function. The objective is to determine the maximum occupied space of the heuristics by using integer programming. The maximum value is the key to the asymptotic worst-case ratio.
Hospital Emergency Department Simulation for Resource Analysis
Kozan, Erhan ; Diefenbach, Mel ;
Industrial Engineering and Management Systems, volume 7, issue 2, 2008, Pages 133~142
The Emergency Department (ED) is an integral part of hospitals. Admissions from the ED account for a significant proportion for a hospital's activity. Ensuring a timely and efficient flow of patients through the ED is crucial for optimising patient care. In recent years, ED overcrowding and its impact on patient flow has become a major issue facing the health sector. Simulation is rapidly becoming a tool of choice when examining hospital systems due to its capacity to involve numerous factors and interactions that impact the system. An analytical simulation model is used to investigate potential impacts by changing the following aspects of ED (physical layouts; number of beds; number and rate of patient arrivals; acuity of illness or injury of patients; access to radiology and pathology services; hospital staffing arrangements; and access to inpatient beds). Results of a significant numerical investigation at a hospital are also presented.
Proposal of Approximation Analysis Method for GI/G/1 Queueing System
Kong, Fangfang ; Nakase, Ippei ; Arizono, Ikuo ; Takemoto, Yasuhiko ;
Industrial Engineering and Management Systems, volume 7, issue 2, 2008, Pages 143~149
There have been some approximation analysis methods for a GI/G/1 queueing system. As one of them, an approximation technique for the steady-state probability in the GI/G/1 queueing system based on the iteration numerical calculation has been proposed. As another one, an approximation formula of the average queue length in the GI/G/1 queueing system by using the diffusion approximation or the heuristics extended diffusion approximation has been developed. In this article, an approximation technique in order to analyze the GI/G/1 queueing system is considered and then the formulae of both the steady-state probability and the average queue length in the GI/G/1 queueing system are proposed. Through some numerical examples by the proposed technique, the existing approximation methods, and the Monte Carlo simulation, the effectiveness of the proposed approximation technique is verified.
E-Transformation from EDI to Web-based B2B Frameworks
Kim, Minsoo ; Ock, YoungSeok ; Kim, Dongsoo ;
Industrial Engineering and Management Systems, volume 7, issue 2, 2008, Pages 150~159
Lots of EDI-VAN companies are in need of transforming their business transaction systems into Web-based e-Business frameworks because of high cost and closed structure of EDI systems. This research proposes several e-Transformation strategies for EDI-VAN companies to adopt Web-based e-Business frameworks such as ebXML and RosettaNet. Four transformation alternatives are presented and transformation procedure for a medium-sized company is described. The result of this work can be used as a practical guideline for EDI companies to develop their own transformation strategy suitable to its scale and capability, while minimizing the impacts on the pre-existing business processes and information systems.
A Mathematical Model for Converting Conveyor Assembly Line to Cellular Manufacturing
Kaku, Ikou ; Gong, Jun ; Tang, Jiafu ; Yin, Yong ;
Industrial Engineering and Management Systems, volume 7, issue 2, 2008, Pages 160~170
This paper proposes a mathematical model for converting conveyor assembly line to cellular manufacturing in complex production environments. Complex production environments refer to the situations with multi-products, variant demand, different batch sizes and the worker abilities varying with work stations and products respectively. The model proposed in this paper aims to determine (1) how many cells should be formatted; (2) how many workers should be assigned in each cell; (3) and how many workers should be rested in shortened conveyor line when a conveyor assembly line should be converted, in order to optimize system performances which are defined as the total throughput time and total labor power. We refer the model to a new production system. Such model can be used as an evaluation tool in the cases of (i) when a company wants to change its production system (usually a belt conveyor line) to a new one (including cell manufacturing); (ii) when a company wants to evaluate the performance of its converted system. Simulation experiments based on the data collected from the previous documents are used to estimate the marginal impact that each factor change has had on the estimated performance improvement resulting from the conversion.
An Improved Particle Swarm Optimization Algorithm for Care Worker Scheduling
Akjiratikarl, Chananes ; Yenradee, Pisal ; Drake, Paul R. ;
Industrial Engineering and Management Systems, volume 7, issue 2, 2008, Pages 171~181
Home care, known also as domiciliary care, is part of the community care service that is a responsibility of the local government authorities in the UK as well as many other countries around the world. The aim is to provide the care and support needed to assist people, particularly older people, people with physical or learning disabilities and people who need assistance due to illness to live as independently as possible in their own homes. It is performed primarily by care workers visiting clients' homes where they provide help with daily activities. This paper is concerned with the dispatching of care workers to clients in an efficient manner. The optimized routine for each care worker determines a schedule to achieve the minimum total cost (in terms of distance traveled) without violating the capacity and time window constraints. A collaborative population-based meta-heuristic called Particle Swarm Optimization (PSO) is applied to solve the problem. A particle is defined as a multi-dimensional point in space which represents the corresponding schedule for care workers and their clients. Each dimension of a particle represents a care activity and the corresponding, allocated care worker. The continuous position value of each dimension determines the care worker to be assigned and also the assignment priority. A heuristic assignment scheme is specially designed to transform the continuous position value to the discrete job schedule. This job schedule represents the potential feasible solution to the problem. The Earliest Start Time Priority with Minimum Distance Assignment (ESTPMDA) technique is developed for generating an initial solution which guides the search direction of the particle. Local improvement procedures (LIP), insertion and swap, are embedded in the PSO algorithm in order to further improve the quality of the solution. The proposed methodology is implemented, tested, and compared with existing solutions for some 'real' problem instances.
Economic Design of Automated Spiral Parking System
Oh, Yonghui ; Sung, Yun Chul ; Hwang, Hark ;
Industrial Engineering and Management Systems, volume 7, issue 2, 2008, Pages 182~188
Automated parking systems, which automatically park and retrieve vehicles, have been steadily replacing conventional parking systems. The spiral parking system is a type of automated parking systems that has cylindrical parking tower. We develop an economic design model of spiral parking system based on a recursive optimization and simulation procedure in which the dynamic nature of the parking system can be integrated into the mathematical programming model. The optimal values of design parameters are found that gives the minimum total cost while complying with the desired performance of the system.