Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of Korean Institute of Industrial Engineers
Journal Basic Information
Journal DOI :
Korean Institute of Industrial Engineers
Editor in Chief :
Volume & Issues
Volume 12, Issue 2 - Dec 1986
Volume 12, Issue 1 - Jun 1986
Selecting the target year
Optimum Scheduling Algorithm for Job Sequence, Common Due Date Assignment and Makespan to Minimize Total Costs for Multijob in Multimachine Systems
No, In-Gyu ; Kim, Sang-Cheol ;
Journal of Korean Institute of Industrial Engineers, volume 12, issue 1, 1986, Pages 1~11
This research is concerned with n jobs, m parallel identical machines scheduling problem in which all jobs have a common due date. The objective of the research is to develop an optimum scheduling algorithm for determining an optimal job sequence, the optimal value of the common due date and the minimum makespan to minimize total cost. The total cost is based on the common due date cost, the earliness cost, the tardiness cost and the flow time cost of each job in the selected sequence. The optimum scheduling algorithm is developed. A numerical example is given to illustrate the scheduling algorithm.
A Scheduling Method for the m-Machine n-Job Flow-Shop Problem by Gantt Chart
Kim, Nam-Su ; Lee, Sang-Yong ;
Journal of Korean Institute of Industrial Engineers, volume 12, issue 1, 1986, Pages 13~18
This paper is concerned with flow-shop permutation scheduling problem. This paper presents an algorithm for the minimum makespan sequence. The efficiency of proposed algorithm is demonstrated by comparisons with the existing algorithms: Johnson's, branch & bound method, and heuristic algorithms. The proposed algorithm is more effective than the other algorithms. A numerical example is given to illustrate the procedure.
An Evaluation of Flowshop Scheduling Heuristics in a Dynamic Environment
Park, Yang-Byeong ;
Journal of Korean Institute of Industrial Engineers, volume 12, issue 1, 1986, Pages 19~30
This paper provides an evaluation of static flowshop scheduling heuristics for minimizing makespan as an objective function in the dynamic flowshop model, in which new jobs with stochastic processing times arrive at the shop randomly over time and are added into the waiting jobs for processing. A total of sixteen scheduling heuristics, including several revisions and combinations of previously reported me-sixteen scheduling heuristics, including several revisions and combinations of previously reported methods, are surmmarized. These scheduling rules are evaluated via computer using a SLAM discrete event simulation model. The results for the simulation are analyzed using both statistical and nonstatistical methods. The results from the study suggest which of the popular scheduling rules hold promise for application to practical dynamic flowshop problems.
An Integrated Inventory Model for Two-Product Single-Facility System
Choi, Sung-Bin ; Moon, Dug-Hee ;
Journal of Korean Institute of Industrial Engineers, volume 12, issue 1, 1986, Pages 31~41
In this paper, an integrated production inventory model is developed for two products on a single facility in which the raw materials are fed to the production system as required at the facility. The aim is to determine simultaneously the optimal production schedule for two products and the optimal procurement policies for the raw materials in a way that minimizes the total variable cost of the production system. The production schedule for the more frequently set-up product is formulated by the method of equal or unequal lot sizes. For the model developed, we present a computational scheme of finding the optimal policies and carry out sensitivity analysis through example problem.
Optimum Inventory Level and optimal Selling Price to Realize a Pre-determined Level of Profit
Kang, Suk-Ho ; Noh, Seung-Jong ;
Journal of Korean Institute of Industrial Engineers, volume 12, issue 1, 1986, Pages 43~48
In this paper, the one period multi-item inventory model is considered in which it is required to determine the production quantity and selling price of each item which maximize the probability of realizing predetermined level of profit. The objective function of this model is the sum of weighted probabilities which represent the possibility of obtaining the predetermined level of profit for each item. Budget constraint, inventory site constraint and constraints of price are considered. Finally this paper shows a numerical example in which random demand of each item has exponential distribution.
A Study on the Dynamic Lot Size Model for Deteriorating Items
Son, Gwon-In ; No, Jae-Ho ;
Journal of Korean Institute of Industrial Engineers, volume 12, issue 1, 1986, Pages 49~53
A dynamic lot size model is developed for the deteriorating items. The amount of deterioration during a period is assumed to be proportional to the inventory at the end of the period. It is further assumed that deterioration rates can differ among periods. This new model is shown to be equivalent to the general one by simple transformation of some variables. A numerical example is given to illustrate the derived results.
Design of a Demand Forecasting System for Planning Production of Consumer Products
Park, Jin-U ;
Journal of Korean Institute of Industrial Engineers, volume 12, issue 1, 1986, Pages 55~61
Mathematical forecasting models and a practical computer based forecasting system are developed for planning production in a manufacturing and distribution network. The forecasting system works at the highest level of a hierarchical computer-based decision support system consisting of the forecasting system, an aggregate planning system and a shop floor scheduling system. The dynamics of business operations for an actual company have been considered to make this study a unique comprehensive analysis of a real world forecasting problem.
A Production Function for the Organization with Hierarchical Network Queue Structure
Gang, Seok-Hyeon ; Kim, Seong-In ;
Journal of Korean Institute of Industrial Engineers, volume 12, issue 1, 1986, Pages 63~71
In the organization with a hierarchical network queue structure a production function is derived whose input factors are the numbers of servers at nodes and output is the number of served customers. Its useful properties are investigated. Using this production function, the contributions of servers to the number of served customers are studied. Also given an expected waiting time in the system for each customer, the optimal numbers of servers at nodes are obtained minimizing a cost function.
A Study on the Optimal Warehouse Location Problem by Using the Branch & Bound Algorithm
Lee, Deuk-U ; Lee, Sang-Yong ;
Journal of Korean Institute of Industrial Engineers, volume 12, issue 1, 1986, Pages 73~80
This paper deals with the problem of the optimal location of warehouses in the two stage distribution system, i.e., the distribution system where the product is transported from plants to customer areas via warehouses. The Problem is formulated with a zero-one mixed integer programming and an efficient branch and bound algorithm is then used to solve the problem. In order to obtain the solution of this problem, this paper shows the procedure of conversion of two stage distribution system into one stage distribution system. An improved method of solving the linear programming at the nodes and branching decision rule is also showed by this study.
A Shortest Path Dynamic Programming for Expansion Sequencing Problems
Kim, Sheung-K. ;
Journal of Korean Institute of Industrial Engineers, volume 12, issue 1, 1986, Pages 81~94
A shortest path dynamic programming formulation is proposed and attemped to solve an uncapacitated expansion sequencing problem. It is also compared with the Extended Binary State Space approach with total capacity. Difficulties and merits associated with the formulation are discussed. The shortest path dynamic programming lacks the separability condition and an optimal solution is not guaranteed. However it has other merits and seems to be the practical solution procedure for the expansion sequencing problem in a sense that it finds near optimal solution with less state evaluations.
Differential Game Approach to Competitive Advertising Model
Park, Sung-Joo ; Lee, Keon-Chang ;
Journal of Korean Institute of Industrial Engineers, volume 12, issue 1, 1986, Pages 95~105
This paper presents an adaptive algorithm to generate a near-optimal closed-loop solution for a non-zero sum differential game by periodically updating the solutions of the two-point boundary-value problem. Applications to competitive advertising problem show that the adaptive algorithm can be used as an efficient tool to solve the differential game problem in which one player may take advantage of the other's non-optimal play.
A Tool for Optimizing Simulated Discrete Variable Stochastic Systems: SIMICOM
Lee, Young-Hae ; Azadivar, F. ;
Journal of Korean Institute of Industrial Engineers, volume 12, issue 1, 1986, Pages 107~118
A heuristic algorithm (SIMICOM) has been designed and tested for optimizing simulated stochastic systems whose performances are functions of several discrete decision variables. The approach adopted utilizes an integer complex method coupled with techniques of establishing confidence intervals for the system's responses. It can handle a general class of optimization problems that could be constrained or unconstrained. In constrained cases, the constraints could either be explicit analytical functions of decision variables or be expressed as other responses of the simulation model. In addition to obtain a reasonably accurate solution, the economic aspect of obtaining the solution has also been taken into consideration.
Activity-oriented Modeling of Mass Production System
Choe, Byeong-Gyu ; Park, Seong-Ju ; Sin, Ha-Yong ;
Journal of Korean Institute of Industrial Engineers, volume 12, issue 1, 1986, Pages 119~131
Described in this paper is a modelling methodology for mass production system simulation. The mass production system under consideration consists of various types of flow lines, special purpose production facilities, conveyor lines, palletized carts, and storage facilities. This type of production system is typical in home appliance industry, automobile industry, footwear industry, etc. where a variety of product mix are mass-produced. The modelling methodology is based on the "discrete-event formalism", and an "activity-oriented world view" is adopted to formalize the system description. A distinctive feature of the modelling methodology is that only the static structure (ie, system components) is included in the fixed model. The dynamic structure of the system is specified through a "data-driven" mechanism, which is an extension of the "experimental frame" concept. Each type of system components (ie, flow line, conveyors, carts, etc.) is formally modeled by using Activity Cycle Diagrams. The issue of "model structuring" is also addressed. The modeling methodology has been successfully applied in a real simulation study of a mass production system.
An Algorithm for Computing the Source-to-Terminal Reliability in the Network with Delay
Hong, Sun-Sik ; Lee, Chang-Hun ;
Journal of Korean Institute of Industrial Engineers, volume 12, issue 1, 1986, Pages 133~138
In this paper, we are modeling the problem of the reliability evaluation in the network with delay. The triconnected decomposition and factoring algorithm for the network reliability, known as the most efficient algorithm, does not work in this constrained problem. So, we propose some ideas that reduce the above constrained problem to the general network reliability problem. We also present an algorithm for the reliability evaluation in the network with delay based on these ideas.
Life Testing of Failure Rate Increasing Items for Reliability Analysis
Seo, Nam-Su ;
Journal of Korean Institute of Industrial Engineers, volume 12, issue 1, 1986, Pages 139~146
This study is concerned with the development of statistical life test plans for the mean lifetime of an item whose underlying lifetime distribution is a two parameter Weibull, which is perhaps the most widely used lifetime model. For this purpose, I used the likelihood ratio test method, and I verified the developed test plans and determined the sampling size and censoring number by computer similation.
Risk Sharing in the Commercialization Step of National R&D Project
Han, Kyeong-Hee ; Kim, Soung-Hie ;
Journal of Korean Institute of Industrial Engineers, volume 12, issue 1, 1986, Pages 147~155
Nations, especially developing countries, hope to license the technology developed at the expense of government Research and Development (R&D) investment to the corresponding firms for commercial exploitation. Since commercial process is owing to lots of risk, firms have to grope the possibility of forming a partnership in order to reduce the risk. Therefore, a joint venture between firms would be needed to share the risk. This methodology suggests a way that probabilistic information of commercial project payoffs can be obtained using experts in project evaluation committee and the ratio of individual firm's investment size can be derived using risk sharing concept. Also simple examples are given.