• Journal of Korean Society of Industrial and Systems Engineering
• /
• 제10권16호
• /
• pp.19-26
• /
• 1987

Since many small and medium sized enterprises have lack of funds to install the full scale Computer Aided Process Planning this study has been attempted to develop a part of computer generated production information system for a start. The system is programmed by DBASE III and BASIC languages for the IBM-PC competables for the sake of user's convenience. The system consisted of four major parts. The first part is a computerized work measurement system for applying WF predetermined time standards. The second part is a computerized forecasting and loading system for applying various statistical techniques. The third part is a GT scheduling system programmed by BASIC for applying heuristic scheduling method. Finally, the last part is a simulation system for GT scheduling efficiency test which is programmed by SIMAN simulation language.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• 제60권7호
• /
• pp.1314-1323
• /
• 2011

The maintenance of generating units is implicitly related with power system reliability and has a tremendous bearing on the operation of the power system. A technique using a fuzzy search method which is based on fuzzy multi-criteria function has been proposed for GMS (generator maintenance scheduling) in order to consider multi-objective function. In this study, a new technique using combined fuzzy set theory and genetic algorithm(GA) is proposed for generator maintenance scheduling. The genetic algorithm(GA) is expected to make up for that fuzzy search method might search the local solution. The effectiveness of the proposed approach is demonstrated by the simulation results on a practical size test systems.

• Journal of Electrical Engineering and Technology
• /
• 제5권1호
• /
• pp.8-15
• /
• 2010

A new technique using a search method which is based on fuzzy multi-criteria function is proposed for GMS(generator maintenance scheduling) in order to consider multi-objective function. Not only minimization of probabilistic production cost but also maximization of system reliability level are considered for fuzzy multi-criteria function. To obtain an optimal solution for generator maintenance scheduling under fuzzy environment, fuzzy multi-criteria relaxation method(fuzzy search method) is used. The practicality and effectiveness of the proposed approach are demonstrated by simulation studies for a real size power system model in Korea in 2010.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 대한산업공학회/한국경영과학회 1993년도 춘계공동학술대회 발표논문 및 초록집; 계명대학교, 대구; 30 Apr.-1 May 1993
• /
• pp.35-35
• /
• 1993

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 한국경영과학회 1995년도 추계학술대회발표논문집; 서울대학교, 서울; 30 Sep. 1995
• /
• pp.299-299
• /
• 1995

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 대한산업공학회/한국경영과학회 1995년도 춘계공동학술대회논문집; 전남대학교; 28-29 Apr. 1995
• /
• pp.756-756
• /
• 1995

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.297-297
• /
• 1996

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.316-316
• /
• 1996

• Journal of the Korean Operations Research and Management Science Society
• /
• 제13권2호
• /
• pp.59-65
• /
• 1988

This paper discusses the problem of coordinating aggregate planning and production schedules, minimizing the combined set-up inventory and capacity costs. In this study, by using the relation of fixed production quantity and the number of set-up we develop a heuristirc procedure of solving the discrete demand, fixed production quantity, variable capacity problem. First, we obtain the trade-off between set-up cost and capacity cost, then search the point minimizing the combined inventory and capacity costs.

• The Journal of Information Systems
• /
• 제25권4호
• /
• pp.105-119
• /
• 2016

Purpose The conventional solution methods for production scheduling problems typically focus on the active schedules, which result in short makespans. However, the active schedules are more difficult to generate than the semi active schedules. In other words, semi active schedule based search strategy may help to reduce the computational costs associated with production scheduling. In this context, this paper aims to compare the performances of active schedule based and semi active schedule based search methods for production scheduling problems. Design/methodology/approach Two decoding approaches, active schedule decoding and semi active schedule decoding, are introduced in this paper, and they are used to implement genetic algorithms for classical job shop scheduling problem. The permutation representation is adopted by the genetic algorithms, and the decoding approaches are used to obtain a feasible schedule from a sequence of given operations. Findings The semi active schedule based genetic algorithm requires slightly more iterations in order to find the optimal schedule, while its execution time is quite shorter than active schedule based genetic algorithm. Moreover, the operations of semi active schedule decoding is easy to understand and implement. Consequently, this paper concludes that semi active schedule based search methods also can be useful if effective search strategies are given.