• IE interfaces
• /
• v.11 no.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.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• autumn
• /
• pp.81-87
• /
• 2001

In a dynamically changing environment, the manager of a maintenance and remodeling (M/R) program is confronted with an increasing complexity of coordinating and cooperating multi-resource constrained multiple projects. The root causes of the complexity, uncertainty and interdependence, cause an internal disruption of an activity and chain reactions of disturbance propagation that deteriorate the stability and manageability of the program. This paper evaluates previous endeavors to apply production control and management techniques to the construction industry, and investigates the possibility of applying other management concepts and theories to organizational program management. In particular, this paper proposes a buffer allocation model by which periodic buffers are allocated in the flows of program constraint resources to stabilize a program master schedule instead of protecting individual activities. Comparative experiments by Monte Carlo simulations illustrate improved performance of the proposed model in terms of program's goals: productivity, flexibility, and long-term stability.

• Korean Journal of Construction Engineering and Management
• /
• v.5 no.6 s.22
• /
• pp.72-79
• /
• 2004

Critical Path-based project management has been applied to the construction projects with a goal of delivering projects within original costs and time estimates. These current project management methods, rarely make early finishes of construction Projects. In addition, current practices on time management seems not to take advantages of early finishes concepts due to student syndrome and Parkinson's Law, This research study applied the Theory of Constraints(n) in the estimation of construction project duration. While the TOC includes variety of management techniques, in this study, it refers to critical chain that has been used to develop the specific management technique in scheduling. The concept of critical chain is applied to this study to solve the problems associated with the current scheduling method. The efforts focus to solve the p개blems associated with current construction project scheduling methods by adopting both stochastic estimation technique and the concept of schedule buffer,

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.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.

• IE interfaces
• /
• v.14 no.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
• /
• v.37 no.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.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• autumn
• /
• pp.383-387
• /
• 2003

Construction project has many problem such as delay of the appointed date delivery, over budget, wether and site conditions. When several activities are influenced by the same factor, their duration may be delayed. This paper deals with the problem of construction duration estimating and schedule variation on the construction project. The theory of constraints technique for project management is referred to 'Critical Chain' technique. This paper shows optimal scheduling plan and time management technique, used probability construction duration estimating and scheduling buffer based on the critical chain project management.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.8 s.179
• /
• 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
• /
• v.8 no.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.10a
• /
• 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.