• IE interfaces
• /
• v.25 no.1
• /
• pp.106-113
• /
• 2012

There are few factors like a due date observance of the customer's order, reducing the manufacturing lead time, and minimizing the inventory investment to successfully run the manufacturing system. It is difficult for corporation and a person concerned to be offered indicators to achieve few factors mentioned above from complex manufacturing systems having much fluctuations. Simplified-DBR based on TOC(Theory of Constraints) is a management paradigm which can offer indicators to effectively face with fluctuating market's needs when market's demand is smaller than a capacity of manufacturing system. This paper is offering a core indicator and management model which is needed to successfully run the manufacturing system for corporation and a person concerned who have short experience and knowledge and newly construct Sinplified-DBR manufacturing system. Thus, this paper provides a systemic guidance in the offered model through the simulation.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2018.07a
• /
• pp.47-48
• /
• 2018

본 논문에서는 NP-hard 문제로 알려진 잡샵 스케쥴링에 대하여 강화학습적 측면에서 접근하는 방식에 대해 제안한다. 다양한 시간이 소요되는 업무들이 가지는 특징들을 최대한 state space aggregation에 고려하고, 이를 neural network를 통해 최적화 시간을 줄이는 방식이다. 잡샵 스케쥴링에 대한 솔루션은 미래에 대한 예측이 불가능하고 다양한 시간이 소요되는 스케쥴링 문제를 최적화하는 것에 대한 가능성을 제시할 것으로 기대된다.

• Korean Management Science Review
• /
• v.13 no.3
• /
• pp.173-186
• /
• 1996

This paper presents an approach for classifying scheduling problems and selecting a heuristic rule to yield best solution in terms of certain performance measure(s). Classification parameters are employed from previous studies on job shop scheduling and project scheduling. Neural network is used for learning and estimating the performance of heuristic rules. In addition, multi-criteria decision making techniques are employed to combine the preferences for each performance measure and heuristic rule for the problems with multi-objectives.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.04a
• /
• pp.119-119
• /
• 1993

• Journal of the Korea Safety Management & Science
• /
• v.5 no.1
• /
• pp.83-92
• /
• 2003

Scheduling plays an important role in shop floor planning. A scheduling shows the planned time when processing of a specific job will start on each machine that the job requires. It also indicates when the job will be completed on every process. Thus, it is a timetable for both jobs and machines. There is only one server available and arriving work require services from this server. Job are processed by the machine one at a time. The most common objective is to sequence jobs on the severs so as to minimize the penalty for being late, commonly called tardiness penalty. Based on other objectives, many criteria may serve as s basis for developing job schedules. The process also comprises all strategic planning, capital investments, management decisions, and tasks necessary to create a new product. manufacturing processes must be created so that the product can be produced in the product facility. Purchasing new equipment and training workers may be required if new technology is to be used. Tools, fixtures, and the sequence of steps in the manufacturing processes must all be developed to allow rapid, high-quality, cost effective production. Also, it may be needed to be rearrange the production facility to adapt to the new manufacturing processes. Therefore, this study tries to proposed that Scheduling by customer needs group for minimizing the problem and reducing inventory, product development time, cycle time, and order lead time.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.2
• /
• pp.163-163
• /
• 1988

This research shows that fuzzy set theory can be useful in modeling and solving flow shop scheduling problems with uncertain processing times and illustrates a method for solving job sequencing problem which the opinions of experts disagree in each processing time. In this study, FCDS (Fuzzified Campbell-Dudek-Smith) algorithm and FNEH (Fuzzified Nawaz-Enscope-Ham) algorithm are proposed to improve the fuzzified Branch & Bound algorithm that requires long run-time and computational complexities to find the optimal sequence. These proposed algorithms are also designed to treat opinions of experts. In this paper, Fuzzy processing times are expressed as triangular fuzzy numbers and comparison method use Lee-Li method and ranking method based on the dominance property. On the basis of the proposed method, an example is presented.

• Korean Management Science Review
• /
• v.13 no.2
• /
• pp.163-175
• /
• 1996

This research shows that fuzzy set theory can be useful in modeling and solving flow shop scheduling problems with uncertain processing times and illustrates a method for solving job sequencing problem which the opinions of experts disagree in each processing time. In this study, FCDS (Fuzzified Campbell-Dudek-Smith) algorithm and FNEH (Fuzzified Nawaz-Enscope-Ham) algorithm are proposed to improve the fuzzified Branch & Bound algorithm that requires long run-time and computational complexities to find the optimal sequence. These proposed algorithms are also designed to treat opinions of experts. In this paper, Fuzzy processing times are expressed as triangular fuzzy numbers and comparison method use Lee-Li method and ranking method based on the dominance property. On the basis of the proposed method, an example is presented.

• Industrial Engineering and Management Systems
• /
• v.15 no.1
• /
• pp.32-40
• /
• 2016

This paper considers a special case of a three machine flow shop scheduling problem in which operation processing time of each job is ordered such that machine 1 has the longest processing time, whereas machine 3, the shortest processing time. The objective of the problem is the minimization of the total completion time. Although the problem is simple, its complexity is yet to be established to our best knowledge. This paper first introduces the problem and presents some optimal properties of the problem. Then, it establishes several special cases in which a polynomial-time optimal solution procedure can be found. In addition, the paper proves that the recognition version of the problem is at least binary NP-complete. The complexity of the problem has been open despite its simple structure and this paper finally establishes its complexity. Finally, a simple and intuitive heuristic is developed and the tight worst case bound on relative error of 6/5 is established.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.25 no.5
• /
• pp.1-8
• /
• 2002

The sales activity of most of small manufacturing companies is based on orders of buyers. The process of promotion, receipt and selection of orders of the manufacturers is closely coupled with the load status of the production lines. The decision on whether to accept an order or not, or the selection of optimal order set among excessive orders is entirely dependent on the schedule of production lines. However, in the real world, since the production scheduling activity is mainly performed by human experts, most of small manufacturers are suffer from being unable to meet due dates, lack of rapid decision on the acceptance of new order. To cope with this problem, this paper deals with the development of an agent for selecting an optimal order set automatically. The main engine of selection agent is based on the typical job-shop scheduling model since our target domain is the injection molding company. To solve the problem, we have formulated it as IP (Integer Program) model, and it has been successfully implemented by ILOG and selection agent. And we have suggested an architecture of an agent for tackling web based order selection problems.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.64-66
• /
• 2004

In general, the algorithms for production scheduling are developed with special objective under the special restrictions. Therefore, there is no common algorithm for APS system applied to various kind of production circumstances. The scheduling algorithm for APS system has to solve any problem that comes from any conditions of product kind, process, resource, machine, special rule for scheduling, and so forth. In addition, the algorithm finds solutions quickly because the need for real time based reschedule comes out often. In this paper, I am going to develop a scheduling algorithm using heuristic and genetic algorithm for APS system applied to various kind of production circumstances quickly and flexibly. The developed APS system with the algorithm will be introduced in this paper, also.