• 한국건설관리학회논문집
• /
• 제2권3호
• /
• pp.83-91
• /
• 2001

1990년 중반부터 지식(Knowledge)은 국가 및 기업 경쟁력의 원천으로 부상하고 있으며, 건설기업의 공정관리는 건설기업의 핵심 역량 중의 하나이다. 그러나 국내 건설기업은 공정관리에 대한 지식을 체계적으로 저장, 활용하지 못하고 있는 실정이다. 국내 건설기업의 공정관리 지식기반화에 대한 수준은 공정관리 지식기반 인프라 구축 단계에 머물러 있으며, 상위 건설기업 조차도 공정관리 지식 활동 단계의 초기 수준에 머물러 있다. 이는 공정관리 지식의 중요성에 대한 인식 부재, 관련 절차의 부재가 원인이라고 할 수 있을 것이다. 본 연구에서는 건설기업의 공정관리 지식기반화의 문제점을 분석한 후, 건설기업 차원에서 현행 공정관리 표준 절차서의 내용에 공정관리 지식기반 인프라 요소와 공정관리 지식 활동 요소를 보안할 수 있는 공정관리 지식기반화를 위한 공정관리 절차서 모델을 제시하였다. 본 연구의 결과물인 공정관리 지식기반화를 위한 절차서 모델을 통해, 국내 건설기업이 공정관리 지식 활동의 절차를 마련할 수 있는 방안을 제시하고, 추후 국내 건설기업의 건설통합시스템 및 KMS(Knowledge Management System)과의 연계를 위한 공정관리 지식 기반의 구축의 틀을 마련하고자 한다.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2006년도 추계 종합학술대회 논문집
• /
• pp.31-36
• /
• 2006

일반적인 생산일정관리 시스템은 ERP(전사적자원관리)의 모듈로서 MRP(자재소요량계획) 형태로 포함되어 있다. MRP 형태의 생산일정관리 시스템은 설계 및 생산일정의 변화에 신속하고 유연하게 대처할 수 없어 수주생산방식의 중소기업에서 중요한 납기를 지키는 것이 힘든 것으로 알려져 있다. TOC의 DBR Scheduling 시스템은 생산현장의 변화에 유연하고 효과적으로 대처할 수 있는 것으로 알려져 있어 수주생산방식 중소기업의 생산일정을 관리하는데 적합할 것으로 생각한다. 본 논문에서는 TOC 기반의 DBR Scheduling 시스템을 개발하기 위하여 먼저 Together이란 UML 툴을 이용하여 시스템 설계서를 작성하였고 Visual Basic.Net으로 시스템을 개발하였다.

• 한국항해항만학회:학술대회논문집
• /
• 한국항해항만학회 1996년도 The Korean Institute of Navigation 1996년도 춘계학술발표회 논문집
• /
• pp.59-76
• /
• 1996

Vessels in the world merchant fleet generally operate in either liner or bulk trade. The supply and the demand trend of general cargo ship are both on the ebb however those trend of tankers and containers are ins light ascension. Oil tankers are so far the largest single vessel type in the world fleet and the tanker market is often cited as a texbook example of perfect competition. Some shipping statistics in recent years show that there has been a radical fluctuation in spot charter rate under easy charter's market. This implies that the proper scheduling of tankers under spot market fluctuation has the great potential of improving the owner's profit and economic performance of shipping. This paper aims at developing the TS-DSS(Decision Support System for Tanker Scheduling) in the context of the importance of scheduling decisions. TS-DSS is defined as a DSS based on the optimization models for tanker scheduling. The system has been developed through the life cycle of systems analysis design and implementation to be user-friendly system. The performance of the system has been tested and examined by using the data edited under several tanker scheduling has been tested and examined by using the data edited under several tanker scheduling scenarios and thereby the effectiveness of TS-DSS is validated satisfactorily. The authors conclude the paper with the comments of the need of appropriate support environment such as data-based DSS and network system for successful implementatio of the TS-DSS.

• KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
• /
• 제4B권1호
• /
• pp.29-35
• /
• 2004

Locomotive scheduling in railway systems experiences many difficulties because of the complex interrelations among resources, knowledge and various constraints. Artificial intelligence technology has been applied to solve these scheduling problems. These technologies have proved to be efficient in representing knowledge and rules for complex scheduling problems. In this paper, we have applied the CSP (Constraints Satisfaction Problems) programming technique, one of the AI techniques, to solve the problems associated with locomotive scheduling. This method is more effective at solving complex scheduling problems than available mathematical programming techniques. The advanced locomotive scheduling system using the CSP programming technique is realized based on the actual timetable of the Saemaul type train on the Kyong-bu line. In this paper, an overview of the CSP programming technique is described, the modeling of domain and constraints is represented and the experimental results are compared with the real-world existing schedule. It is verified that the scheduling results by CSP programming are superior to existing scheduling performed by human experts. The executing time for locomotive scheduling is remarkably reduced to within several decade seconds, something requiring several days in the case of locomotive scheduling by human experts.

• 품질경영학회지
• /
• 제36권2호
• /
• pp.28-35
• /
• 2008

This study deals with an Excel-based scheduling system for a small and medium sized manufacturing factory without sufficient capability for managing full-scale information systems. The factory has the bottleneck with identical machines and unique batching characteristics. The scheduling problem is formulated as a variation of the parallel-machine scheduling system. It can be solved by a two-phase method: the first phase with an ant colony optimization (ACO) heuristic for order grouping and the second phase with a mixed integer programming (MIP) algorithm for scheduling groups on machines.

• 제어로봇시스템학회논문지
• /
• 제10권1호
• /
• pp.87-95
• /
• 2004

We proposed the division algorithm that was aimed at dividing system models. It used a transitive matrix to express the relation between place and transition. And the division algorithm was applied to the scheduling problem, with the division-scheduling algorithm. The division-scheduling algorithm was able to calculate the divided subnet table. And it is able to reduce the analysis complexity. In this study, we applied the proposed division algorithm and division-scheduling algorithm to flexible manufacturing system models. We compared the efficiency and performance of the division-scheduling algorithm with the Hillion algorithm, Korbaa algorithm, and Unfolding algorithm proposed in previous researches.

• 시스템엔지니어링학술지
• /
• 제17권2호
• /
• pp.1-8
• /
• 2021

This study proposes a systems engineering approach for the development of an advanced planning & scheduling (APS) system for a cosmetic case manufacturing factory. The APS system makes production plans and schedules based on the injection process, which consists of 27 plastic injection machines in parallel to control recommended inventory of products. The system uses machine operation/failure information and defective product/work-in-process tracking information to support intelligent scheduling. Furthermore, a genetic algorithm model is applied to handle the complexity of heuristic rules and machine/quality constraints in this process. As a result of the development, the recommended inventory compliance rate is improved by scheduling the 30-day production plan for 15 main products.

• 산업공학
• /
• 제16권2호
• /
• pp.201-210
• /
• 2003

The purpose of this research is to develop a scheduling system for CAL (Continuous Annealing Line) in Cold Rolling Mill. Based on CSP (Constraint Satisfaction Problem) technique in artificial intelligence, appropriate algorithms to provide schedules satisfying all the constraints imposed on CAL are designed and developed. Performance tests show that the proposed scheduling system outperforms human operators in case of aggregating the same attributes and minimizing the thickness differences between two adjacent coils.

• 한국정밀공학회지
• /
• 제15권3호
• /
• pp.82-87
• /
• 1998

In order to provide a manufacturing system with efficiency and flexibility to cope with the changes in shop floor status, the integration of process planning and operations scheduling is required. In this paper, an integrated system of process planning and operations scheduling based on the concept of process net model and genetic algorithm is suggested. The process net model includes the alternative process plans. The integrated system is applied for prismatic parts.

• International Journal of Contents
• /
• 제6권4호
• /
• pp.30-34
• /
• 2010

Effective job scheduling scheme is a crucial part of complex heterogeneous distributed systems. Gang scheduling is a scheduling algorithm for grid systems that schedules related grid jobs to run simultaneously on servers in different local sites. In this paper, we address grid jobs (gangs) schedule modeling using Stochastic reward nets (SRNs), which is concerned for static and dynamic scheduling policies. SRN is an extension of Stochastic Petri Net (SPN) and provides compact modeling facilities for system analysis. Threshold queue is adopted to smooth the variations of performance measures. System throughput and response time are compared and analyzed by giving reward measures in SRNs.