• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.1250-1255
• /
• 1990

This paper discusses an optimal cyclic scheduling problem for a FMC (Flexible Manufacturing Cell) modeled by a two-machine flowshop with two machining centers with APC's (Automated Pallet Changers), an AGV (Automated Guided Vehicle) and loading and unloading stations. Cyclic production in which similar patterns of production is repeated can significantly reduce the production lead-time and WIP (Work-In-Process) in such flexible, automated system. Thus we want to find an optimal cyclic schedule that minimizes the cycle time in each cycle. However, the existence of APC's as buffer storage for WIP makes the problem intractable (i.e., NP-complete). We propose an practical approximation algorithm that minimizes, instead of each cycle time, its upper bound. Performances of this algorithm are validated by the way of computer simulations.

• Journal of Korean Society for Quality Management
• /
• v.17 no.1
• /
• pp.116-124
• /
• 1989

A multi-period production-inventory scheduling model, which extends the customary dynamic lot sizing model to the one for deteriorating items, is developed. The amount of deterioration during a period is assumed to be proportional to the on-hand inventory at the end of the period. It is futher assumed that the deterioration rates vary from period to period. In addtion, an expediting cost due to the delay of outstanding order is included and it is allowed to offset the order release date in advance, instead, in order to avoid incurring the cost. Finally, a quasi-WW algorithm corresponding to the Wagar-Whitin algorithm is proposed to obtain the optimal production-inventory schedules.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.28 no.4
• /
• pp.41-47
• /
• 2005

This paper presents the practical goals and approaches to drive forward informatization of small and medium enterprises(SMES). The presented goals such as productivity, duedate, production cost, and quality measurements are used effectively in the previous diagnosis and the post evaluation for the business of the informatization. As the practical approaches to improve these goals, This study considers the importance of balancing, sequencing, and scheduling. These methods ease the congestion of production sites of SMES with insufficient competitiveness and can contribute to the promotion of informatization that improves productivity and cuts down the cost of production effectively.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.43 no.3
• /
• pp.492-503
• /
• 1994

In this study, the control and scheduling of the flexible manufacturing cell (FMC) is discussed, which can perform the mixed production and relieve the effect of machine failure. The control of the FMC isvery complex task due to the property of multiple jobs and the dynamically changing states. For effective control of proposed FMC, the hierarchical scheme is introduced and the functions of each levels are defined. Especially for the control functions of shop floor level and cell level, the intelligent scheduler is implemented. To show the efficiency of the intelligent scheduler, the production method fo the existing assembly lines was evaluated and compared with the proposed intelligent FMC method. The results from the production performance show that the proposed method is superior to the existing method in various performance indices.

• Journal of Korean Institute of Industrial Engineers
• /
• v.16 no.1
• /
• pp.123-135
• /
• 1990

An extensive survey is carried out on the applications of AI (Artificial Intelligence) and ES (Expert System) in mathematical programming and simulation, which are the most frequently used tools in production planning. A scheduling field is also reviewed. The scheduling problem is one of the most attractive area for AI and ES researchers, since any practical algorithmic solution methods are not available. The current practice and difficulty of applying AI and ES to production planning are discussed and future research directions are identified.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.2 no.2
• /
• pp.83-91
• /
• 1999

Dynamic characteristic of manufacturing stage is understood and the utilization of each machine is maximized by developing on-line dynamic CAPP system to consider the overloads in the aircraft part manufacturing line. In this paper, a scheme of production planning and scheduling system was proposed through inspection about some predeveloped CAPP system. Developed production planning and scheduling system included process planning module. After precise inspection of some FMS line schema at domestic heavy industry, optimized FMS line was applied to aircraft part manufacturing and repairing factory. By virtue of considering overloads of factory and machine through on-line dynamic CAPP system, the utilization of resources is maximized and manufacturing lead time is minimized.

• Journal of KIISE:Software and Applications
• /
• v.34 no.5
• /
• pp.487-501
• /
• 2007

To achieve high resource utilization for multi-issue DSPs, production compiler commonly includes variants of iterative modulo scheduling algorithm. However, excessive cyclic data dependences, which exist in communication and media processing loops, unduly restrict modulo scheduling freedom. As a result, replicated functional units in multi-issue DSPs are often under-utilized. To address this resource under-utilization problem, our paper describes a novel compiler preprocessing strategy for effective modulo scheduling. The preprocessing strategy proposed capitalizes on two new transformations, which are referred to as cloning and dismantling. Our preprocessing strategy has been validated by an implementation for StarCore SC140 DSP compiler.

• Journal of the Society of Naval Architects of Korea
• /
• v.45 no.6
• /
• pp.646-655
• /
• 2008

A main issue about production management of shipyards is to efficiently manage the work in process and logistics. However, so far the management of a transporter for moving building blocks has not been efficiently performed. To solve the issues, optimal block transporting scheduling system is developed for minimizing of the travel distance without overload of a transporter. To implement the developed system, a hybrid optimization algorithm for an optimal block transportation scheduling is proposed by combining the genetic algorithm and the ant algorithm. Finally, to evaluate the applicability of the developed system, it is applied to a block transportation scheduling problem of shipyards. The result shows that the developed system can generate the optimal block transportation scheduling of a transporter which minimizes the travel distance without overload of the transporter.

• Korean Journal of Computational Design and Engineering
• /
• v.17 no.6
• /
• pp.409-416
• /
• 2012

Most of the shipbuilding scheduling researches so far have been conducted with stress on the dock plan. That is due to the fact that the dock is the least extendable resource in shipyards and its overloading is difficult to resolve. However, once the dock scheduling is completed, it is also important to make a plan that make the best use of the rest of the resources in the shipyard, so that any additional cost is minimized. This study automates block allocation process by analyzing the existing manual process that designates production bays for the blocks during the midterm planning. Also, a planning scenario validation method is suggested, where block allocation scenarios based on diagrams are edited and simulated.

• Journal of Korean Institute of Industrial Engineers
• /
• v.14 no.1
• /
• pp.73-82
• /
• 1988

This research is concerned with production scheduling for FMS (Flexible Manufacturing System) which consists of machine centers served by cycle conveyor. The objective of the research is to develop and evaluate scheduling procedures to minimize the mean flow time. An optimal algorithm called SCTF (Shortest Circle Time First) is proposed when the conveyor runs at minimum possible speed (CS=1) and a heuristic algorithm called SCTJMF (Shortest Cycle Time and Job Matching Algorithm) is suggested when the conveyor runs at double speed (CS=2). The evaluation of the heuristic algorithm was implemented by comparison with the optimal algorithm for 112 experimentations for CS=1 and random schedule. The results showed that the proposed heuristic algorithm provides better solution that can be regarded noticeable when compared with SCTF algorithm and random scheduling.