• 산업공학
• /
• 제11권3호
• /
• pp.129-141
• /
• 1998

In this paper, a rescheduling procedure is developed for shipbuilding master production schedule. Shipyard initially develops backward production schedules for the entire shipbuilding process, and then refines the schedule by stage. The rescheduling procedure of this paper tries to resolve the schedule discrepancies between the outdoor backward schedule and the refined indoor schedule. Through the proposed rescheduling procedure, outdoor schedule can be successfully adjusted using buffer days and duration reduction. An Object-oriented program is also developed to automate the procedure. We can observe the improvement on productivity and quality of rescheduling works from the application of the developed procedure.

• 한국건설관리학회:학술대회논문집
• /
• 한국건설관리학회 2001년도 학술대회지
• /
• pp.81-87
• /
• 2001

동적 변화가 상존하는 건설환경에서, 보수·리모델링 프로그램의 관리자는 자원하의 복수 프로젝트를 조정·관리하는데 어려움을 겪게 된다. 프로그램에 내재하는 불확실성과 상호종속성으로 인해, 단위작업의 지연과 그로 인한 연쇄적인 공정계획의 동요는 프로그램 전체의 안정성과 관리가능성을 저해한다. 본 논문은 먼저 건설관리에 적용되었던 생산관리기법들이 프로그램관리에 적용될 수 있는가를 살펴본 후, 프로그램 내부의 자원유동의 흐름에 주기적으로 버퍼를 설치하는 공정 안정화 모델을 제안하고자 한다. 몬테-칼로 시뮬레이션에 의한 비교실험으로 제안된 버퍼 관리모델의 성능을 프로그램의 생산성, 유연성, 그리고 안정성의 관점에서 분석하였다.

• 한국건설관리학회논문집
• /
• 제5권6호
• /
• pp.72-79
• /
• 2004

기존의 CPM 관리방식은 정해진 시간과 비용 내에서 프로젝트를 완료하기 위한 목적으로 건설분야에 활용되어 공기지연이 발생하지 않도록 관리하는데 초점을 두고 있으나, 조기 완공을 유도하지는 못하여 왔다. 기존의 CPM 공정계획의 경우에 학생증후군(Student Syndrome)과 파킨슨법칙(Parkinson's Law)이 작용할 경우 조기 완공의 효과를 얻기는 어렵다. 본 연구는 건설 프로젝트의 공기 산정에 제약이론(Theory of Constraints)을 적용하였으며, 이는 공정계획에서의 새로운 관리기법을 개발하는데 사용되어온 Critical Chain을 일컫는다. 이러한 Critical Chain의 개념은 기존 공정계획 방법에서의 문제점을 해결하기 위하여 이용되었다 본 논문에서는 기존 공정계획 방법의 문제점을 해결하기 위하여 Critical Chain의 개념을 적용하여 확률적인 공기산정과 공정버퍼(buffer)를 이용한 공정계획 합리화 방안을 제시하였다.

• 전자공학회논문지B
• /
• 제31B권5호
• /
• pp.123-133
• /
• 1994

This paper presents an output arbitrator for input buffering ATM (Asynchronous Transfer Mode) switches using neural networks. To avoid blocking in ATM switches with blocking characteristics, it is required to buffer ATM cells in input buffer and to schedule them. The N$\times$N request matrix is divided into N/16 submatrices in order to get rid of internal blocking systematically in scheduling phase. The submatrices are grouped into N/4 groups, and the cells in each group are switched alternatively. As the window size of input buffer is increases, the number of input cells switched in a time slot approaches to N. The selection of nonblocking cells to be switched is done by neural network modules. N/4 neural network modules are operated simultaneously. Fast selection can be achieved by massive parallelism of neural networks. The neural networks have 4N neurons and 14N connection. The proposed method is implemented in C language, and the simulation result confirms the feasibility of this method.

• 산업공학
• /
• 제14권4호
• /
• pp.348-355
• /
• 2001

This paper suggests a detailed design of APS(Advanced Planning & Scheduling) system using the DBR (Drum-Buffer-Rope) which is a finite capacity scheduling logic of TOC(Theory of Constraints). Our design is composed of four modules; Network, Buffer, Drum and Subordination. The Network module defines the Product Network which is built from BOM and routings. The Buffer module inserts the Buffers into the Product Network. The Drum module describes detail procedures to create Drum Schedule on the CCR(Capacity Constraint Resource). The Subordination module synchronizes all non-constraints to the constraints by determining the length of Rope. This design documented by ARIS.

• ETRI Journal
• /
• 제37권1호
• /
• pp.147-156
• /
• 2015

A typical solid-state drive contains several independent channels that can be operated in parallel. To exploit this channel-level parallelism, a variety of works proposed to split consecutive write sequences into small segments and schedule them to different channels. This scheme exploits the parallelism but breaks the spatial locality of write traffic; thus, it is able to significantly degrade the efficiency of garbage collection. This paper proposes a channel-aware write reordering (CAWR) mechanism to schedule write requests to different channels more intelligently. The novel mechanism encapsulates correlated pages into a cluster beforehand. All pages belonging to a cluster are scheduled to the same channels to exploit spatial locality, while different clusters are scheduled to different channels to exploit the parallelism. As CAWR covers both garbage collection and I/O performance, it outperforms existing schemes significantly. Trace-driven simulation results demonstrate that the CAWR mechanism reduces the average response time by 26% on average and decreases the valid page copies by 10% on average, while achieving a similar hit ratio to that of existing mechanisms.

• 한국건설관리학회:학술대회논문집
• /
• 한국건설관리학회 2003년도 학술대회지
• /
• pp.383-387
• /
• 2003

현재 국내 건설산업에서의 공정계획은 합리적인 사전계획 없이 현장기술자의 경험과 능력에 따라 계약공기에 맞추는 방식으로 추진되고 있다. 또한 공정계획의 핵심인 광기산정은 업체마다 서로 차이를 보이고 있어 객관적인 공기산정이라고 할 수 없는 실정이다. 이러한 공정계획의 부실은 공정계획 현장 적응 시 공기 및 작업순서의 차이를 발생시켜 효과적인 공정관리가 이루어지지 못하는 원인이 되고 있으며, 다양한 공기지연 사유가 발생하고 있다. 본 연구에서는 현재 제조업에서 적용중인 제약이론 기반의 CCPM(Critical Chain Project Management)의 확률적 공기산정과 공정버퍼의 개념을 건설 프로젝트에 적용하여 합리적인 공정계획 수립 방안을 제시하였다.

• 대한기계학회논문집A
• /
• 제24권8호
• /
• pp.2131-2142
• /
• 2000

As recent production facilities are usually operated with unmanned material-handling system, the development of an efficient schedule with deadlock avoidance becomes a critical problem. Related researches on deadlock avoidance usually focus on real-time control of manufacturing system using deadlock avoidance policy. But little off-line optimization of deadlock-free schedule has been reported. This paper presents an optimization method for deadlock-free scheduling for Job-Shop system with no buffer. The deadlock-free schedule is acquired by the procedure that generates candidate lists of waiting operations, and applies a deadlock avoidance policy. To verify the proposed approach, simulation resultsare presented for minimizing makespan in three problem types. According to the simulation results the effect of each deadlock avoidance policy is dependent on the type of problem. When the proposed LOEM (Last Operation Exclusion Method) is employed, computing time for optimization as well as makespan is reduced.

• Industrial Engineering and Management Systems
• /
• 제8권3호
• /
• pp.155-161
• /
• 2009

We focus on discrete event systems with a structure of parallel processing, synchronization, and no-concurrency. We use max-plus algebra, which is an effective approach for controller design for this type of system, for modeling and formulation. Since a typical feature of this type of system is that the initial schedule is frequently changed due to unpredictable disturbances, we use a simple model and numerical examples to examine the possibility of applying the concepts of the feeding buffer and the project buffer of critical chain project management (CCPM) on max-plus linear discrete event systems in order to control the occurrence of an undesirable state change. The application of a CCPM-based framework on a max-plus linear discrete event system was proven to be effective.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.65-65
• /
• 2000

For Video on Demand(VoD) servers, a design of an efficient scheduler is important to the support a large number of clients having various playback speeds and receiving rates. In this paper, we propose the scheduling algorithm to handle establishing deadlines and selection using the earliest deadline first. To establish deadlines and selections, the period of the receiving rates for each client is located between the over-max receiving rate and the over-playback rate. To avoid video starvation and the buffer overflow of each client, the proposed algorithm guarantees providing the admission control. Because of establishing deadlines and selection, period of each client receiving is between one over max receiving rate and one over play back rate. Using Virtual Buffer in server, scheduling load is reduced. The efficiency of the proposed algorithm is verified using a Petri Net_Based simulation tool, Exspect.