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 3, Issue 2 - Dec 2004
Volume 3, Issue 1 - Jun 2004
Selecting the target year
A Branch-and-price Approach to the ATM Switching Node Location Problem
Kim, Deokseong ; Park, Sunsoo ; Lee, Kyungsik ; Park, Kyungchul ;
Industrial Engineering and Management Systems, volume 3, issue 2, 2004, Pages 92~99
We consider the ATM switching node location problem (ANLP). In this problem, there are two kinds of facilities, hub facilities and remote facilities, with different capacities and installation costs. We are given a set of customers with each demand requirements, a set of candidate installation sites of facilities, and connection costs between facilities. We need to determine the locations to place facilities, the number of facilities for each selected location, the set of customers who are connected to each installed hub via installed remote facilities with minimum cost, while satisfying demand requirements of each customer. We formulate this problem as a general integer programming problem and solve it to optimality. In this paper, we present a preprocessing procedure to tighten the formulation and develop a branch-and-price algorithm. In the algorithm, we consider the integer knapsack problem as the column generation problem. Computational experiments show that the algorithm gives optimal solutions in a reasonable time.
Branch and Bound Approach for Single-Machine Sequencing with Early/Tardy Penalties and Sequence-Dependent Setup Cost
Akjiratikarl, Chananes ; Yenradee, Pisal ;
Industrial Engineering and Management Systems, volume 3, issue 2, 2004, Pages 100~115
The network representation and branch and bound algorithm with efficient lower and upper bounding procedures are developed to determine a global optimal production schedule on a machine that minimizes sequence-dependent setup cost and earliness/tardiness penalties. Lower bounds are obtained based on heuristic and Lagrangian relaxation. Priority dispatching rule with local improvement procedure is used to derive an initial upper bound. Two dominance criteria are incorporated in a branch and bound procedure to reduce the search space and enhance computational efficiency. The computational results indicate that the proposed procedure could optimally solve the problem with up to 40 jobs in a reasonable time using a personal computer.
Evolutionary Algorithm for Process Plan Selection with Multiple Objectives
MOON, Chiung ; LEE, Younghae ; GEN, Mitsuo ;
Industrial Engineering and Management Systems, volume 3, issue 2, 2004, Pages 116~122
This paper presents a process plan selection model with multiple objectives. The process plans for all parts should be selected under multiple objective environment as follows: (1) minimizing the sum of machine processing and material handling time of all the parts considering realistic shop factors such as production volume, processing time, machine capacity, and capacity of transfer device. (2) balancing the load between machines. A multiple objective mathematical model is proposed and an evolutionary algorithm with the adaptive recombination strategy is developed to solve the model. To illustrate the efficiency of proposed approach, numerical examples are presented. The proposed approach is found to be effective in offering a set of satisfactory Pareto solutions within a satisfactory CPU time in a multiple objective environment.
Tree Structure Modeling and Genetic Algorithm-based Approach to Unequal-area Facility Layout Problem
Honiden, Terushige ;
Industrial Engineering and Management Systems, volume 3, issue 2, 2004, Pages 123~128
A tree structure model has been proposed for representing the unequal-area facility layout. Each facility has a different rectangular shape specified by its area and aspect ratio. In this layout problem, based on the assumption that the shop floor has enough space for laying out the facilities, no constraint is considered for a shop floor. Objectives are minimizing total part movement between facilities and total rectangular layout area where all facilities and dead spaces are enclosed. Using the genetic code corresponding to two kinds of information, facility sequence and branching positions in the tree structure model, a genetic algorithm has been applied for finding non-dominated solutions in the two-objective layout problem. We use three kinds of crossover (PMX, OX, CX) for the former part of the chromosome and one-point crossover for the latter part. Two kinds of layout problems have been tested by the proposed method. The results demonstrate that the presented algorithm is able to find good solutions in enough short time.
Studies on the Optimal Location of Retail Store Considering the Obstacle and the Obstacle-Overcoming Point
Minagawa, Kentaro ; Sumiyoshi, Kazushi ;
Industrial Engineering and Management Systems, volume 3, issue 2, 2004, Pages 129~133
Studies on the optimal location of retail store have been made in case of no obstacle(Minagawa etal. 1999). This paper deals with the location problem of retail store considering obstacles (e.g. rivers, railways, highways, etc.) and obstacle-overcoming points (e.g. bridges, railway crossings, zebra crossings, overpasses, etc.). We assume that (1) commercial goods dealt here are typically convenience goods, (2) the population is granted as potential demand, (3) the apparent demand is a function of the maximum migration length and the distance from the store to customers, (4) the scale of a store is same in every place and (5) there is no competitor. First, we construct the basic model of customers' behavior considering obstacles and obstacle-overcoming points. Analyzing the two dimensional model, the arbitrary force attracting customers is represented as a height of a cone where the retail store is located on the center. Second, we formulate the total demand of customers and determine the optimal location that maximizes the total demand. Finally, the properties of the optimal location are investigated by simulation.
A Simulation Study on The Discounted Cost Distribution under Age Replacement Policy
Dohi, Tadashi ; Ashioka, Akira ; Kaio, Naoto ; Osaki, Shunji ;
Industrial Engineering and Management Systems, volume 3, issue 2, 2004, Pages 134~139
During the last three decades, a few attentions have been paid for investigating the cost distribution for the optimal maintenance problems. In this article, we derive the moment of the discounted cost distribution over an infinite time horizon for the basic age replacement problem. With first two moments of the discounted cost distribution, we approximate the underlying distribution function by three theoretical distributions. Through a Monte Carlo simulation, we conclude that the log-normal distribution is the best fitted one to approximate the discounted cost distribution.
Analytical Design Methodology for Recommending VDT Workstation Settings and Computer Accessories Layout
Rurkhamet, Busagarin ; Nanthavanij, Suebsak ;
Industrial Engineering and Management Systems, volume 3, issue 2, 2004, Pages 140~150
Repetitive stress injury at the wrist has been reported as a common injury among visual display terminal (VDT) users (i.e., computer users). Adjusting a VDT workstation (computer table and chair) to maintain a correct seated posture while operating a keyboard is perhaps the most frequently recommended preventive solution. This paper proposes an analytical design methodology based on ergonomic design principles for recommending appropriate VDT workstation settings and layout of individual computer accessories on the computer table. The proposed design methodology consists of two interrelated phases: (1) determination of VDT workstation settings, and (2) design of computer accessories layout. Based on the information about the VDT user, dominant task to be performed, typing skill, and degrees of physical and visual interactions between the user and computer accessories, adjustment and layout solutions are recommended to allow having a correct seated posture while minimizing both physical and visual movements. The results from an experiment show that when adjusting the workstation and locating the computer accessories according to the recommendations given by the proposed design methodology, the user's hand movements can be significantly reduced.