• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.1
• /
• pp.14-23
• /
• 1996

Scheduling jobs effectively under consideration of actual loads on machines is one of the most complicated tasks in production control. The complexity of the finite capacity scheduling often makes the conventional methods of industrial engineering fail. As an alternative, Knowledge-based approaches to job-shop scheduling have been evolved recently. This paper presents a blackboard- based scheduling expert system which combines knowledge-based scheduling with interactive scheduling. It is shown to be possible to generate the feasible schedule within a reasonable time. Flexible reaction management is also possible while keeping the changes in the generated schedule to the minimal and adjusting the schedule to tardy operations or working environmental changes. The system is equipped with a rule base with heuristics for handling conflicted event. A case study applying the implemented system is described.

• Korean Chemical Engineering Research
• /
• v.44 no.2
• /
• pp.149-159
• /
• 2006

This research is a development of useful S/W program for real industry about optimal product scheduling in real plant for manufacturing polymer products. For this, we used a fine model with total amount of losses in weight(ton) as an objective for optimal scheduling and a genetic algorithm for optimization in this factory they manufacture three different products. Major products are A and B but the product which can be process in the period of products change over. They also sells them as a chap product in market. The major products have several types of packing process-bulk, pack for domestic market, pack for export. The demands of product with each packing type are increased, and frequently they failed keep the deadline for sail. Based on realistic production situation, we composed a fine modeling for optimal scheduling. And we also develop a S/W program for optimal scheduling which can be used by non-specialist in scheduling problem. We used a modified genetic algorithm and it gave us a better solution in process. We can have a result of reducing the total amount of losses in weight by half compared with the losses when existing production schedule.

• IE interfaces
• /
• v.13 no.1
• /
• pp.110-119
• /
• 2000

Resource-constrained project scheduling is to allocate limited resources to activities to optimize certain objective functions and to determine a start time for each activity in the project such that precedence constraints and resource requirements are satisfied. This study suggests a multi-project scheduling model which can level work loads, make the most of production capacity and restrain the delay of delivery by developing a heuristic algorithm which minimizes the project completion time and maximizes the load rate under resource constraints.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.2
• /
• pp.107-118
• /
• 1994

This research is concerned with production scheduling for a flexible manufacturing cell which consists of two machine centers with unlimited buffer space and a single automatic guided vehicle. The objective is to develop and evaluate heuristic scheduling procedures that minimize maximum completion time. A numerical example illustrates the proposed algorithm. The heuristic algorithm is implemented for various cases by SLAM II. The results show that the proposed algorithm provides better solutions than Johnson's. It also gets good solutions to minimize mean flowtime.

• Journal of Korean Institute of Industrial Engineers
• /
• v.15 no.2
• /
• pp.1-10
• /
• 1989

This paper deals with a single-facility multiproduction model concerning the basic cyclic scheduling. The aim is to obtain the production order of each product in a cycle and the cycle frequency for minimizing the setup costs and inventory carrying costs of all products. The problem is formulated by LP and it shows that the optimal solution derived dominates the solution of non-cyclic scheduling model on some conditions.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.299-302
• /
• 1996

The purpose of this study is developing scheduling logic and program for machining scheduling of automobile part production line with unbalanced processing time. Three rules are developed to minimize slack and effect on other job. Fourth rule is suggested which considered weighted sum of three factors. schedule is generated totally 1, 000 times and then optimal weight parameter is selected. The program is developed to schedule situation to compare with the performance measure, total finish time of machine and total tardiness of part. As a result, the rule which considered weighted sum of three factors is effective for both measure.

• Proceedings of the KIEE Conference
• /
• 1995.11a
• /
• pp.128-130
• /
• 1995

This paper presents the optimal operation scheduling on cogeneration systems connected with auxiliary equipment by using the possibility fuzzy theory. The probability fuzzy theory is a method to obtain the possibility of the solution from the fuzzification of coefficients. Simulation is carried out to obtain the boundary of heat production in each time interval. Simulation results shows effectively the flexible operation boundary to establish operation scheduling.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.46
• /
• pp.241-251
• /
• 1998

There are two methods of load balancing for detail scheduling : One method is to generate an initial schedule and obtain an improved final schedule by load balancing only during a specific period. The other method is to generate an initial schedule and obtain an improved schedule by load balancing from current date(TIMENOW) to unlimited time with the whole manufacturing processes. This paper proposes an algorithm for detail scheduling which can be a practical solution in job shop production or project job type by applying the former method.

• Journal of Industrial Convergence
• /
• v.5 no.2
• /
• pp.21-32
• /
• 2007

This paper deals with the sequencing problem in the operation of the manufacturing systems with the constraint of buffer capacity. Some of studies for this theme have been progressed for several years. And then most of them considered only one objective, such as maximum lateness, machine utilization, makespan, mean flowtime and so on. This study deal with two objectives of the delivery for customers and the idle time of machines for producers. For the decision of sequence, the utility function is used. The developed heuristic algorithm presents a good solution. Through a numerical example, the procedures of the job sequencing is explained.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.947-951
• /
• 2005

The concept of group technology has been successfully applied to many production systems including flexible manufacturing systems. In this paper we apply group technology principles to the economic lot scheduling problem which has been intensively studied over 40 years. We obtain a production schedule of several family products on a single facility where setup times and costs can be reduced by using the concept of group technology. We develop a heuristic algorithm and a hybrid genetic algorithm for the group technology economic lot scheduling problem (GT-ELSP). Numerical example shows that the developed heuristic and the hybrid genetic algorithm outperform the existing heuristics.