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 5, Issue 2 - Dec 2006
Volume 5, Issue 1 - Jun 2006
Selecting the target year
Tools for Logistics Planning
Chong, Libby ; Kennedy, Damian ;
Industrial Engineering and Management Systems, volume 5, issue 2, 2006, Pages 57~67
Automotive industry is at the vanguard of creating a lean supply chain, whose practices are geared toward maintaining minimal inventory and streamlining all facets of the supply chain management process. The strategy includes a constant stream of just-in-time supply to car manufacturers through mixed loading of components with high frequency of pick-up and delivery, which is challenging the logistics operations. Therefore, manufacturers in automotive industry tend to outsource their logistics. Mathematical models and solution procedures are proposed in this paper to support logistics planning in automotive industry when there is constraint on delivery intervals. They may also be used as decision aids to outsource the logistics function, as negotiation tools, as joint planning tools, and/or as evaluation tools for continuous improvement.
Two-Way Scheduling Approach in Ant Algorithm for Solving Job Shop Problem
Udomsakdigool, Apinanthana ; Kachitvichyanukul, Voratas ;
Industrial Engineering and Management Systems, volume 5, issue 2, 2006, Pages 68~75
Ant Colony Optimization (ACO) is a metaheuristic which takes the inspiration from the foraging behaviour of real ant colony to solve the optimization problem. In the literature, several successful applications of ACO have been reported for Vehicle Routing and Traveling Salesman Problems. This paper presents a new method of ACO to solve the Job-shop Scheduling Problems. The objective is to find the schedule that minimizes the makespan. Traditionally, a schedule is constructed in ACO by ants working in a forward direction starting from the beginning. In this paper, ants working in a backward direction are introduced. While the forward ant constructs the solutions in order of the precedence of processing sequences, the backward ant constructs the solution in the reversing order of processing sequences. Two heterogeneous types of ant exchange the information via modifying the pheromone trial in the same pheromone matrix. In addition, several specific features are introduced in the algorithm to improve the efficiency of the search such as local improvement and restart process. The performance of the proposed algorithm is tested over the benchmark problems. A comprehensive numerical investigation shows that the performance of such algorithm is significantly improved in particular when backward scheduling is included. This indicates that such strategies should also be applied within metaheuristic-based procedures.
Economic Evaluation of Multiple Investment Alternatives under Uncertainty Using Graphic Representation
Kono, Hirokazu ; Mizumachi, Tadahiro ;
Industrial Engineering and Management Systems, volume 5, issue 2, 2006, Pages 76~83
Economic evaluation of investment proposals is attracting a great deal of attention from many businesspeople including engineers and management executives as well as academicians who find themselves in today’s uncertain economic environment. Methods typically employed to evaluate profitability and risk require sophisticated mathematical skills and therefore do not meet practical needs. The purpose of this paper is to propose graphic analytical methods for evaluating mutually exclusive investment alternatives from the perspective of trade-off between profitability and risk. The paper takes into consideration uncertainties in those factors, such as the amount of initial investment, annual return, annual expenses, interest rate, and product and machinery life. The paper proposes such visual charts as modified annual return domain, modified annual cost domain, break-even line chart, and slice cut chart, all of which facilitate quantitative trade-off analysis on uncertainties among the listed factors. Procedures for describing these charts are illustrated with a practical numerical example, followed by a discussion on how to utilize them in practice.
Heuristic Procedure for Two-Criterion Assembly Line Balancing Problem
Jaturanonda, Chorkaew ; Nanthavanij, Suebsak ;
Industrial Engineering and Management Systems, volume 5, issue 2, 2006, Pages 84~96
A heuristic procedure for solving the two-criterion assembly line balancing (2CALB) problem is presented in this paper. Its objective is to assign assembly tasks to workstations so as to concurrently balance the workstation processing time and the postural and physical loads (PPL) among assembly line workers. The procedure consists of two stages. Firstly, the classic Kilbridge and Wester’s algorithm is utilized to develop an initial task–workstation assignment solution based on the workstation processing time. Secondly, the task reassignment algorithm is applied to rearrange assembly tasks assigned in the first stage in order to balance the PPL among workers. A composite index of variation is developed as a weighted measure of the normalized variance of the workstation processing time and that of the PPL. Using a clothes assembling example, four assembly line designs (based on the number of workstations) and nine criterion weight pairs are investigated. A sensitivity analysis of the composite index of variation and changes in the line throughput and efficiency are also discussed.
Fuzzy Resource Allocation Problem for Minimizing Maximum Lateness on a Single Machine
Harikrishnan, Kanthen-K. ; Ishii, Hiroaki ;
Industrial Engineering and Management Systems, volume 5, issue 2, 2006, Pages 97~101
Scheduling mainly concerns allocating resources to tasks over the time, under some restricted constraints. There have been many researches done on a single machine scheduling problem with parameters given in the form of fuzzy numbers. In this paper, two types of resources are considered and each resource limit is flexible. So a membership function is introduced representing satisfaction degree with respect to the fuzzy bound of each resource. The problem is described as follows: There are n jobs to be processed on a single machine. The processing of each job requires a continuous resource consumption. The resource limit is flexible and a membership function describing non-decreasing satisfaction degree about setting the resource limit is introduced. Under this setting, maximum lateness is to be minimized and minimal satisfaction degree among two resources is to be maximized. But usually we cannot optimize two objectives at a time. So we seek the non-dominated schedule after defining dominance between schedules. First we review the original non-fuzzy problem. Next we propose an efficient algorithm for seeking non-dominated schedules. Finally we consider further research problems.
Modified DBR Scheduling Mechanism for a Non-identical Parallel Machine Flow Shop
Sirikrai, Vimalin ; Yenradee, Pisal ;
Industrial Engineering and Management Systems, volume 5, issue 2, 2006, Pages 102~115
The drum-buffer-rope (DBR) is a scheduling technique under the Theory of Constraints (TOC) philosophy. In DBR, "drum" is a schedule at the bottleneck, "rope" is a mechanism to release the required material to the bottleneck, and "buffer" is used to protect the bottleneck from starvation due to statistical fluctuations. For a non-identical parallel machine flow shop environment, estimating rope and time buffer is not an easy task because of the complexity of non-identical parallel machine loading. This paper proposes a new scheduling method, which is called modified DBR (ModDBR). It uses a backward finite capacity scheduling technique instead of the rope in traditional DBR. A simulation model is constructed to investigate the effect of the loading methods, priority dispatching rules, and load levels on tardiness, earliness, flow time, and bottleneck’s utilization. The results show that ModDBR tends to outperform other loading methods in terms of tardiness, average flow time, and bottleneck utilization. However, ModDBR is inferior to others in term of earliness. These findings are still valid when bottleneck location and protective capacity level are changed.
A New Algorithm for Automated Box-Jenkins AR-MA Time Series Modeling Using Residual Autocorrelation/Partial Autocorrelation Functions
Song, Qiang ; Esogbue, Augustine O. ;
Industrial Engineering and Management Systems, volume 5, issue 2, 2006, Pages 116~125
Box-Jenkins time series modeling technique is a powerful tool. Yet, it requires a substantial amount of manual work and statistical skills for the user by inspecting the sample autocorrelation and partial autocorrelation function plots of a time series. This, in our opinion, prevents the technique from further applications in many areas. Therefore, it is highly desirable to automate the Box-Jenkins modeling technique. This paper has two major contributions. First, a new algorithm is proposed where by inspecting the sample autocorrelation function or the partial autocorrelation function of the model residuals, which is the key difference from Box-Jenkins', an ARMA(p, q) model can be automatically identified, estimated and diagnosed, without any manual interventions, for a stationary or invertible time series. And second, a new algorithm is proposed to identify the characteristics of correlograms, a fundamental step in the automated modeling processes.
Dynamic Programming Approach to a Two Machine Flow Shop Sequencing with Two-Step-Prior-Job Dependent Setup Times
Sun, Ji Ung ;
Industrial Engineering and Management Systems, volume 5, issue 2, 2006, Pages 126~131
The purpose of this study is to develop an effective scheduling methodology for a realistic flow shop sequencing problem. The flow shop consists of two machines where only the first machine has separable, external, and sequence dependent setup times. The length of setup times required for a job depends not on the immediately preceding job but on the job which is two steps prior to it. The problem is solved by a backward dynamic programming with the objective of minimizing the makespan. An optimal schedule is found and its performance is examined through a simulation study.
Multi-Period Integrated Inventory and Distribution Planning with Dynamic Distribution Center Assignment
Song, Sang Hwa ;
Industrial Engineering and Management Systems, volume 5, issue 2, 2006, Pages 132~141
This paper considers an integrated problem of dealing with multi-period production, inventory and distribution planning issues together in a supply chain network and the distribution issue is represented as a dynamic assignment model. The objective of the problem is to minimize the sum of all the associated costs, including inventory-holding cost, transportation cost, production cost, and set-up cost, subject to a variety of constraints such as inventory-balance constraints, set-up constraints, and assignment constraints. A solution algorithm is developed based on the Benders' decomposition approach and tested for its effectiveness and efficiency with various numerical examples. Experimental tests show that the algorithm performs very effectively at the rate of within 5% gap and also in reasonable computation time.
Conditions for Successful Implementation of Assembly Cells
Sakazume, Yu ;
Industrial Engineering and Management Systems, volume 5, issue 2, 2006, Pages 142~148
Japanese electrical industries have been actively introducing assembly cells. There have, however, been no systematic discussions concerning the conditions for successful implementation of assembly cells. The purpose of this study is to examine the conditions for implementing assembly cells successfully. This study analyses two types of conditions: 1) market conditions; and 2) product and process conditions. It concludes by presenting three conditions as market conditions and eight as product and process conditions.
Sensitivity Coefficient Index Analysis for an Investment Alternative under Uncertainties in Variables
Kono, Hirokazu ;
Industrial Engineering and Management Systems, volume 5, issue 2, 2006, Pages 149~158
This paper proposes a method for evaluating the profitability and safety of an investment alternative under uncertainties in relevant variables. The paper assumes that an alternative is composed of factors such as initial investment, annual fixed cost, machine life, and interest rate. For the product produced as a result of the investment, its unit sales price, sales volume, unit variable cost, and product life are assumed. The paper first defines the profit equation as a function of these variables. It then proposes sensitivity coefficient indices against independent change in unit sales price, sales volume, unit variable cost, and fixed cost. Based on these results, a quantitative evaluation of safety and risk against unexpected changes is feasible. The meaning of these derived coefficient indices is also investigated and the relationship with generally known indices such as breakeven point and ratio of profit over sales is examined. Furthermore, a 'normalized total-cost and unit-cost domain' is proposed and these relationships are graphically represented and interpreted. From these results, an evaluation of the safety and risk as well as the profitability of an investment alternative becomes feasible under uncertainties in relevant factors.