• IE interfaces
• /
• v.11 no.3
• /
• pp.65-75
• /
• 1998

This research considers the problem of scheduling jobs on parallel machines with non-common due dates and additional resource constraints. The objective is to minimize the total absolute deviation of job completion times about the due dates. Job processing times are assumed to be the same. This problem is motivated by restrictions that occur in the handling and processing of jobs in certain phases of semiconductor manufacturing and other production systems. We examine two problems. For the first of these, the number of different types of additional: resources and resource requirements per job are arbitrary. The problem is formulated as a zero-one integer linear programming and the Lagrangian relaxation approach is used. For the second case, there exists one single type of additional resource and the resource requirements per job are zero or one. We show how to formulate the problem as an assignment problem.

• IE interfaces
• /
• v.1 no.1
• /
• pp.63-72
• /
• 1988

Since many small and medium sized enterprises in Korea have lack of funds to install a commercial computer packages for work standards and work scheduling. This study has been attempted to develop the computer-generated package to ease those problems. The system consisted of three major parts. The first part is a work measurement program applying W.F.(work factor) predetermined time standards for work standards. The second part is a work scheduling program which calculates each operator's machine and job allocation. The last part is a control program for the production outputs and the machine utilization monitoring. The system is programmed by dBASE III for the IBM-PC compatibles for the sake of user's conveniences.

• Industrial Engineering and Management Systems
• /
• v.7 no.3
• /
• pp.204-213
• /
• 2008

Companies that produce capital goods need to schedule the production of products that have complex product structures with components that require many operations on different machines. A feasible schedule must satisfy operation and assembly precedence constraints. It is also important to avoid deadlock situations. In this paper a Genetic Algorithm (GA) has been developed that includes a new repair process that rectifies infeasible schedules that are produced during the evolution process. The algorithm was designed to minimise the combination of earliness and tardiness penalties and took into account finite capacity constraints. Three different sized problems were obtained from a collaborating capital goods company. A design of experimental approach was used to systematically identify that the best genetic operators and GA parameters for each size of problem.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.446-451
• /
• 1992

In this paper, we propose a method to manage production system easily for operators when either equipments or products are changed. And we explain the scheduling AI tool which realizes the proposal method. The tool's knowledge expression consists of models, rules, mathematical expression and fuzzy logic. The model expresses the relations between products and manufacture, and properties of products. The models are separated into three type, equipment model, operation model, and product model. These models are classified by applicable fields as the assembly process or continuous plant process, The model expression of each type is based on object oriented paradigm. We report systems utilizing our approach.

• Journal of Construction Engineering and Project Management
• /
• v.3 no.2
• /
• pp.21-34
• /
• 2013

Various risk factors affect construction projects. Due to the uncertainties created by risk factors, actual activity durations frequently deviate from the estimated durations in either favorable or adverse direction. For this reason, evaluation of schedule uncertainty is required to make decisions accurately when managing construction projects. In this regard, this paper presents a new computer simulation model - the Repetitive Schedule Risk Analysis Model (RSRAM) - to evaluate unit-based repetitive building project schedules under uncertainty when activity durations and risk factors are correlated. The proposed model utilizes Monte Carlo Simulation and a Critical Path Method based repetitive scheduling procedure. This new procedure concurrently provides the utilization of resources without interruption and the maintenance of network logic through successive units. Furthermore, it enables assigning variable production rates to the activities from one unit to another and any kind of relationship type with or without lag time. Details of the model are described and an example application is presented. The findings show that the model produces realistic results regarding the extent of uncertainty inherent in the schedule.

• Journal of Korean Institute of Industrial Engineers
• /
• v.11 no.2
• /
• pp.57-73
• /
• 1985

Group scheduling problem in a multi-stage manufacturing system is reviewed and two heuristic procedures for minimizing the makespan are developed by employing the methods of flow shop sequencing heuristics with a slight modification. The comparisons among the five heuristics, three previously reported heuristics and two heuristics suggested by this study, are made on different problem sizes. The computational results indicate that NEH-GS method gives better group schedules than the other heuristics tested, but its computation time increases rapidly as the problem size increases. On the other hand, CDS-GS method provides relatively good group schedules with less computation time compared with NEH-GS method.

• IE interfaces
• /
• v.14 no.4
• /
• pp.385-393
• /
• 2001

In this paper, a scheme of scheduling a bottleneck operation is presented for production planning of make-to-order. We focus on the problem of capacity-dependent processing time in which processing time of the bottleneck operation is not fixed, but varies with job sequence or equipment capacity. For this, a genetic algorithm is applied for job sequencing with an objective function of mean square of weighted deviation. An experimental study is implemented in power transformer plant and results are compared with those of the EDD rule. It shows that the genetic algorithm is relatively good for most cases.

• Proceedings of the Safety Management and Science Conference
• /
• 2003.11a
• /
• pp.93-96
• /
• 2003

In this regard, the newly focused logistics information system makes reducing the expenses of whole logistic available by cutting down the expenses of materials, transportation and stock and also, it allows the company to cut down the procurement expense through the reduced lead-time and rationalize producing plans by eliminating the uncertain orders and fluctuation in procurement. It further more optimizes the efficiency of over all productions by meeting the dead line for delivery to the customers. In the recent environment of globalization where fierce competitions exist between manufacturers, logistics plays important role in the strategies of companies, and managements of companies try their best efforts in establishing the strategy to accomplish the innovative relationship between supply chain channels. Therefore, in this study, we try to suggest the model of consolidated logistics system that is integrated logistics information system with suggesting the better way of logistics and comparative analysis with logistics system to resolve the difficulties numbers of companies face after realizing what logistics information system is in Korea.

• IE interfaces
• /
• v.7 no.3
• /
• pp.171-180
• /
• 1994

Defined is a Multi-level Parallel Machine Flow-Shop (MPMFS) which reflects some real world manufacturing situations. Just-In-Time (JIT) philosophy is applied to the MPMFS scheduling in order to achieve lowering work-in-process inventory level as well as meeting due dates. A schedule generating simulator is developed. The latest start time of each operation is determined by a backward simulation followed by another forward simulation to analyze the schedule feasibility and actual inventory level. Reasonable schedules are available through adjusting some parameters for allowance factors such as set-up times of machines and other environmental changes. The SLAMSYSTEM under Window is employed for this processing with some input/output data handling processes devised under DOS.

• Journal of the Korean Society for Precision Engineering
• /
• v.28 no.3
• /
• pp.339-348
• /
• 2011

Reconfigurable manufacturing system (RMS), alternatively called changeable manufacturing, is a new manufacturing paradigm designed for rapid change in hardware and software components in order to quickly adjust production capacity and functionality in response to sudden changes in market or in regulatory requirements. Although there has been much progress in hardware components during the last decade, not much work has been done on operational issues of RMS. As one of starting studies on the operational issues, we suggest a framework for the system setup and scheduling problems to cope with the reconfigurability of RMS. System setup, which includes batching, part grouping, and loading, are concerned with the pre-arrangement of parts and tools before the system begins to process, and scheduling is the problem of allocating manufacturing resources over time to perform the operations specified by system setup. The framework consists of 8 scenarios classified by three major factors: order arrival process, part selection process, and tool magazine capacity. Each of the scenarios is explained with its subproblems and their interrelationships.