• 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.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.131-134
• /
• 1996

Application of machine learning to scheduling problems has focused on improving system performance based on opportunistic selection among multitudes of simple rules. This study proposes a new method of learning scheduling rules, which first establishes qualitatively meaningful criteria and quantitatively optimizes the use of them, a similar way as human scheduler accumulate their expertise. The weighting of these criteria is trained in response to the system states through simulation. To mimic human quantitative feelings, distributed fuzzy sets are used for assessing the system state. The proposed method was applied to job dispatching in a simulated FMS environment. The job-dispatching criteria used were the length of the processing time of a job and the situation of the next workstation. The results show that the proposed method can develop efficient and robust scheduling strategies, which can also provide understandable and usable know-hows to the human scheduler.

• IE interfaces
• /
• v.22 no.1
• /
• pp.10-16
• /
• 2009

In this paper, we propose an efficient search algorithm for finding an optimal schedule to minimize makespan, while avoiding deadlock situation in Flexible Manufacturing Systems (FMS) with finite capacity, in which each job needs to be processed in several job stages for completion. The proposed algorithm uses a modeling and control method based on Petri-net. Especially, we improve the efficiency of the search algorithm by using a priority rule and an efficient bounding function during the search procedure. The performance of the proposed algorithm is evaluated through a numerical experiment, showing that it holds considerable promise for providing an optimal solution efficiently comparing to past work.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.1
• /
• pp.137-151
• /
• 1995

A difficult problem in operating Flexible Manufacturing Systems (FMS) is to control the system in real-time by coordinating heterogeneous machines and integrating distributed information. The objective of the paper is to present the models and methodologies useful to resolve the difficult problem. The detailed objectives can be described in three folds. First, a hierarchical Colored and Timed Petri-Net (CTPN) is designed to control an FMS in real-time. The concerned FMS consists of a loading station, several machining cells, a material handling system, and an unloading station. Timed-transitions are used to represent the timed-events such as AGV movements between stations and cells, part machining activities in the cells. Signal places are also used to represent communication status between the host and the cell controllers. To resolve the event conflicts and scheduling problems, dispatching rules are introduced and applied. Second, an implementation methodology used to monitor and diagnose the errors occurring on the machines during system operation is proposed. Third, a Petri-Net simulator is developed to experiment with the designed control logic.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1991.11a
• /
• pp.235-241
• /
• 1991

The FMS(flexible Manufacturing System) was introduced to the part manufacturing industry more than twenty years ago. Considering the vast capital investment and today's competitive environment, it is very important to effectively manage and control the FMS including the day to day disturbances while meeting customer requirements.(omitted)

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.286-289
• /
• 1989

The purpose of this paper is to design a job scheduling algorithm utilizing intelligent control technique. Rulebase is built through the evaluation of rule-set scheduling. 24 scheduling rule-sets and meta-rules are employed. An appropriate scheduling rule-set is selected based on this rulebase and current manufacturing system status. Six criteria have been used to evaluate the performance of scheduling. The performance of sheduling is dependent on random breakdown of the major FMS components during simulation.

• IE interfaces
• /
• v.6 no.2
• /
• pp.53-65
• /
• 1993

This paper deals with the development of a software module for production planning and scheduling activities of an existing Flexible Machining and Assembly System (FMAS). The Production Planning Module uses the hierarchical and sequential scheme based on "divide and conquer" philosophy. In this module, routes are determined based on the production order, orders are screened, tools are allocated, and order adjustments are executed according to the allocated tools. The Scheduling Module allocates the resources, determines the task priority and the start and completion times of tasks. Re-scheduling can be done to handle unforeseen situations such as lumpy demands and machine breakdowns. Since all modules are integrated with a central database and they interface independently, it is easy to append new modules or update the existing modules. The result of this study is used for operating the real FMAS consisting of a machining cell with 2 domestic NC machines and a part feeding robot, an assembly cell with a conveyor and 3 robots, an inspection cell, an AGV, an AS/RS, and a central control computer.

• Journal of the Korean Society for Precision Engineering
• /
• v.11 no.5
• /
• pp.75-87
• /
• 1994

The demand for automatic manufacturing systems is increasing. One of the crucial obstacles to the Flexible Manufacturing System(FMS) is the lack of excellent strategies for efficient operations. The aim of this research is constructing an automaton scheme in the low level of factories where various machineries are involved. An operating strategy is established for an automation unit named as a cell which resides between the upper level computers and manufacturing shop floor. The cell is defined to fit into the total manufacturing system. The defined cell has more functions than conventional cells. A scheduling scheme is adopted for the shop floor operations. A set of software has been developed and tested through simulations and shop floor experiments.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1999.04a
• /
• pp.338-338
• /
• 1999

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.54
• /
• pp.77-85
• /
• 2000

One form of job shop scheduling problem in contemporary automated manufacturing such as flexible manufacturing systems (FMS's) is presented which we call the FMS dispatching priority problem. The FMS dispatching priority problem seeks the best dispatching priority of parts and operations, and is essentially a combinatorial optimization problem. Because of the complicated mechanism of the system, the performance of a given dispatching priority must be evaluated via simulation. Simulated annealing have been applied to the problem, and it is found that appropriate parameter setting will be desirable to get good, if not the optimal, solutions within a limited amount of time under the presence of heavy computational burden due to simulation. More specifically, experiments reveal that initial temperature is the single most important factor among other parameters and factors, and that the appropriate initial temperature depends on the allowable computer time in such a way that the less time one can afford to spend, the lower the appropriate initial temperature should be.