• 경영과학
• /
• 제20권2호
• /
• pp.33-43
• /
• 2003

In this paper we applied dynamic programming to determining work schedule type. In dynamic programming formulation, each day during a planning horizon represents a stage for which a decision is made. The alternatives are given by work schedule types that combine regular time, overtime, additional shift, and so on. In this case, their associated return function is labor cost. The state is defined as the amount of work time allocated to stage 1, stage 2,…, and current stage. A case study for a real manufacturing company was performed to apply dynamic programming to scheduling daily work hours during a week. The case study showed that total cost of our solution derived from dynamic programming decreased by about 6％ as compared with the solution obtained from the previous method.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.1028-1031
• /
• 1996

Dynamic scheduling is very important in constructing CIM and improving productivity of chemical processing systems. Computation at the scheduling level requires mostly a long time to generate an optimal schedule, so it is difficult to immediately respond to actual process events in real-time. To solve these problems, we developed dynamic scheduling algorithms such as DSMM(Dynamic Shift Modification Method), PUOM(Parallel Unit Operation Method) and UVVM(Unit Validity Verification Method). Their main functions are to minimize the effects of unexpected disturbances such as process time variations and unit failure, to predict a makespan of the updated dynamic schedule and to modify schedule desirably in real-time responding to process time variations. As a result, the algorithms generate a new pertinent schedule in real-time which is close to the original schedule but provides an efficient way of responding to the variation of process environment. Examples in a shampoo production batch process illustrate the efficiency of the algorithms.

• 대한산업공학회지
• /
• 제20권3호
• /
• pp.65-77
• /
• 1994

There are so many situations in which production schedules need to be rescheduled, due to the uncertainty or dynamic characteristics existing in manufacturing environment. Under the circumstances, it is necessary to build a system which helps a schedule manager understand the dynamic situations and reflect his insight into the system easily. We developed a system that can improve a production schedule. The system consists of a schedule editor and a schedule generator. The schedule editor, a rule-based system, always keeps a schedule feasible by keeping track of local changes in the revised one. The schedule generator consists of a two-phase heuristic method. In the lst phase it generates a schedule by a priority rule with Giffler and Thompson algorithm then it improves the performance in terms of the makespan in the 2nd phase. Experimental results show that, most of the times, the system generates a better schedule than the one with ordinary priority rules only.

• ETRI Journal
• /
• 제39권3호
• /
• pp.364-372
• /
• 2017

For the reliability of controllers in a software defined network (SDN), a dynamic and self-learning schedule method (DSL) is proposed. This method is original and easy to deploy, and optimizes the combination of multiple controllers. First, we summarize multiple controllers' combinations and schedule problems in an SDN and analyze its reliability. Then, we introduce the architecture of the schedule method and evaluate multi-controller reliability, the DSL method, and its optimized solution. By continually and statistically learning the information about controller reliability, this method treats it as a metric to schedule controllers. Finally, we compare and test the method using a given testing scenario based on an SDN network simulator. The experiment results show that the DSL method can significantly improve the total reliability of an SDN compared with a random schedule, and the proposed optimization algorithm has higher efficiency than an exhaustive search.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2004년도 추계학술대회 논문집
• /
• pp.1546-1552
• /
• 2004

Railway schedule is periodically modified so that it could yield more profit by means of adjusting the schedule to demand. Most of related works are applicable under the given demand, but did not deal with dynamic relation between demand and schedule. To our knowledge, the methodology considering the relation is only the profitability evaluation model developed by SNCF. Our study suggests how to adjust the schedule to demand and therefore obtain more benefits using the profitability evaluation model.

• 한국유통학회:학술대회논문집
• /
• 한국유통학회 2003년도 춘계학술대회 발표논문집
• /
• pp.55-70
• /
• 2003

The most transport companies are placing increasing emphasis on powerful new techniques for planning their vehicle operations. They have tried to improve their vehicle control and customer service capability by adopting tile advanced information technology, such as GPS(Global Position System) and Using Digital Map. But researches on the VRSP(vehicle routing St schedule problem) in this situation were very few. The purpose of this research is to develop vehicle scheduling heuristics for making a real-time dynamic VRSP under the situation that GPS and using Digital Map are equipped to the transport company. Modified savings techniques are suggested for the heuristic method and an insertion technique is suggested for the dynamic VRSP. The urgent vehicle schedule is based on the regular vehicle schedule. This study suggest on VRSP system using GPS and Digital Map and the performance of the suggested heuristics is illustrated through an real case example.

• 디지털콘텐츠학회 논문지
• /
• 제17권4호
• /
• pp.257-263
• /
• 2016

케이블 드럼 스케줄은 발전소 전기설비 설계를 위한 최종단계로 레이스웨이에 포설 계획된 케이블들을 효율적으로 케이블 드럼에 할당하는 것이다. 본 논문에서는 케이블들을 코드별로 케이블 드럼 용량에 맞게 스케줄링 하는 자동화 프로그램을 구현하였으며, 케이블 드럼 스케줄을 위한 최적화 문제를 효과적으로 해결하기 위해 동적 계획 알고리즘을 적용하였다. 구현 결과 케이블 드럼 스케줄 자동화는 설계 규격대로 수행됨을 확인할 수 있었고, 기존방법에서 발생되는 케이블 부족 및 낭비와 같은 오류를 제거 및 케이블 드럼 스케줄 소요시간을 줄일 수 있었다. 발전소 전기설비를 위한 케이블은 최소 2만개 이상으로 설계되기 때문에 제안하는 자동화 프로그램을 적용한다면 심각한 오류 없이 케이블 드럼 스케줄의 설계 소요시간을 현저히 줄일 수 있을 것으로 사료된다.

• 산업공학
• /
• 제12권3호
• /
• pp.362-373
• /
• 1999

Resource Constrained Dynamic Multi-Projects Scheduling (RCDMPS) is intended to schedule activities of two or more projects sequentially arriving at die shop under restricted resources. The aim of this paper is to develop a new problem solving method for RCDMPS to make an effect schedule based by constraint programming. The constraint-based scheduling method employs ILOG Solver which is C++ constraint reasoning library for solving complex resource management problems and ILOG Schedule which is a add-on library to ILOG Solver dedicated to solving scheduling problems. And this method interfaces with ILOG Views so that the result of scheduling displays with Gantt chart. The scheduling method suggested in this paper was applied to a company scheduling problem and compared with the other heuristic methods, and then it shows that the new scheduling system has more preference.

• Journal of Information Processing Systems
• /
• 제7권4호
• /
• pp.613-626
• /
• 2011

In this paper, we focus on the pinwheel task model with a variable voltage processor with d discrete voltage/speed levels. We propose an intra-task DVS algorithm, which constructs a minimum energy schedule for k tasks in O(d+k log k) time We also give an inter-task DVS algorithm with O(d+n log n) time, where n denotes the number of jobs. Previous approaches solve this problem by generating a canonical schedule beforehand and adjusting the tasks' speed in O(dn log n) or O($n^3$) time. However, the length of a canonical schedule depends on the hyper period of those task periods and is of exponential length in general. In our approach, the tasks with arbitrary periods are first transformed into harmonic periods and then profile their key features. Afterward, an optimal discrete voltage schedule can be computed directly from those features.

• 국제학술발표논문집
• /
• The 1th International Conference on Construction Engineering and Project Management
• /
• pp.929-934
• /
• 2005

The complex and dynamic job nature and the ever-changing working environment of construction projects inevitably present uncertainties to construction operations. Identification, evaluation and control of uncertainties constitute main elements of risk management and critical tasks of project management in construction. This paper is focused on application of a simplified discrete-event simulation approach in management of schedule-overrun risks, each being the combination of the occurrence probability of an uncertain interruptive factor and its potential consequence in terms of time delay. A case study observed from a concreting operation in Hong Kong is converted into a simulation model and analyzed with an in-house-developed simulation package for demonstrating how the proposed approach can be implemented to manage multiple schedule-overrun risks on construction projects.