• Journal of Korean Institute of Industrial Engineers
• /
• v.13 no.2
• /
• pp.9-16
• /
• 1987

This paper develops an optimal manpower scheduling algorithm that gives an optimal workforce size and day-off scheduling required to satisfy following conditions. First, everyone is to have two consecutive day-off per cycle in a continuous operating environment. Second, everyone is to have at least A weekends off in a cycle of B Weeks. The model addressed is under the circumstance that the demands can vary from day to day in a weekly cycle. The proposed algorithm makes it possible to minimize the maximum workstretch and to maximize the number of weekends off. It is also possible to minimize the variance of idle manpower distribution in order that idle manpower may be utilized in case of emergency.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2009.05b
• /
• pp.209-212
• /
• 2009

During the last few decades, several companies and research laboratories have developed construction robots in an effort to improve productivity, quality, and reduce construction time and safety concerns. Recently, domestic construction industry is also interested in developing the construction robots. However, the studies on the research and development process is impossible in real field. A existing research's object is the development of the research on the assumption that construction's environment is a fixed form, But real construction's environment is very dynamic and atypical. So it is very difficult that we apply construction automation and robots. In order to solve this problem, this study deduce influential factors on decision making of frame construction scheduling for automated construction.

• IE interfaces
• /
• v.13 no.4
• /
• pp.680-687
• /
• 2000

The objectives of this research are to establish the operation scheduling and the preventive maintenance system in order to optimize the operation of mailing center. For the optimal operation scheduling of mailing process, the existing workflow of mailing process and that of required time are investigated prior to simulation modeling. The simulation experiments are conducted to increase the nextday delivery rate. The best alternative whose nextday delivery rate up to 100% is selected based the AHP(Analytic Hierarchy Process) method. The optimal work scheduling of all mailing centers are also presented. In addition, the CMMS(Computerized Maintenance Management System) for preventive maintenance is introduced for efficient operation of highly automated facilities of mailing center.

• Industrial Engineering and Management Systems
• /
• v.15 no.3
• /
• pp.206-214
• /
• 2016

This paper deals with the no-wait flow shop scheduling problem in order to minimize the total time to complete the schedule or makespan. It is introduced a constructive heuristic which builds the production schedule from job partial sequences by using an appropriate mechanism of insertion. An extensive computational experiment has been performed to evaluate the performance of proposed heuristic. Experimental results have clearly shown that the presented heuristic provides better solutions than those from the best heuristics existing.

• Proceedings of the KIEE Conference
• /
• 1993.07a
• /
• pp.102-105
• /
• 1993

The objective of this study is to solve the operation scheduling problem of plural battery energy storage systems (BESS), and to find useful intonation from its result. Unlike conventional energy storage system, BESS has on hardware characteristics such as high efficiency, fast-acting response and operational loss. Considering rate constraints of thermal unit power as well as hardware characteristics of BESS, the operation scheduling has an intricated problem. In order to solve this optimization problem, we use successive approximations dynamic programming. In two types of operation, the proposed algorithm is applied to test system. one is daily optimal operation, the other weekly optimal operation.

• Journal of information and communication convergence engineering
• /
• v.9 no.4
• /
• pp.471-474
• /
• 2011

In parallel job scheduling, each job can be executed simultaneously on multiple machines at a time. Thus in the input instance, a job $J_i$ requires the number $m_i$ of machines on which it shall be processed. The algorithm should determine not only the execution order of jobs but also the machines on which the jobs are executed. In this paper, when the jobs have deadlines, the problem is to maximize the total work of jobs which is completed by their deadlines. The problem is known to be strongly NP-hard [5] and we investigate the approximation algorithms for the problem. We consider a model in which the algorithm can have more machines than the adversary. With this advantage, the problem is how good solution the algorithm can produce against the optimal algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.60.1-60
• /
• 2001

In recent years, distributed control systems(DCS) using fieldbus such as CAN have been being applied to process systems but it is very difficult to design the DCS in order to guarantee the given end-to-end constraints such as precedence constraints, time constraints, and periods and priorities of tasks and messages. This paper presents a scheduling method to guarantee the given end-to-end constraints. The presented scheduling method is the integrated one considering both tasks executed in each node and messages transmitted via the network and is designed to be applied to a general DCS that has multiple loops with several types of constraints, where each loop consists of ...

• IEMEK Journal of Embedded Systems and Applications
• /
• v.13 no.6
• /
• pp.279-288
• /
• 2018

As a result of the technological advances in the E / E system, automotive system can provide advanced functions for safety and comfort. In addition, mechanical systems is changed to the electronic system. And the systems perform cooperative functions through communication. So the E / E system becomes more complicated as the size of the system increases. In order to secure the safety of complicated E / E system, ISO26262 standard require that Freedom from Interference and Sufficient Independence be met. In this paper, we propose a software scheduling method that can guarantee the independence between decomposed components after software decomposition and software development of ASIL D level EPB (Electronic Parking Brake) system.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.4
• /
• pp.1-9
• /
• 2019

LRR(Loose Round Robin) warp scheduling policy for GPU architecture results in high warp-level parallelism and balanced loads across multiple warps. However, traditional LRR policy makes multiple warps execute long latency operations at the same time. In cases that no more warps to be issued under long latency, the throughput of GPUs may be degraded significantly. In this paper, we propose a new warp scheduling policy which utilizes latency hiding, leading to more utilized memory resources in high performance GPUs. The proposed warp scheduler prioritizes memory instruction based on GTO(Greedy Then Oldest) policy in order to provide reduced memory stalls. When no warps can execute memory instruction any more, the warp scheduler selects a warp for computation instruction by round robin manner. Furthermore, our proposed technique achieves high performance by using additional information about recently committed warps. According to our experimental results, our proposed technique improves GPU performance by 12.7% and 5.6% over LRR and GTO on average, respectively.

• Journal of Electrical Engineering and information Science
• /
• v.1 no.1
• /
• pp.118-128
• /
• 1996

In safety critical hard real-time systems, a timing fault may yield catastrophic results. In order to eliminate the timing faults from the fast responsive real-time control systems, it is necessary to schedule a code based on high precision timing analysis. Further, the schedulability enhancement by having multiple processors is of wide spread interest. However, although an instruction level parallel processing is quite effective to improve the schedulability of such a system, none of the real-time applications employ instruction level parallel scheduling techniques because most of the real-time scheduling models have not been designed for fine-grain execution. In this paper, we present a timing constraint model specifying high precision timing constraints, and a practical approach for constructing static schedules for a VLIW execution model. The new model and analysis can guarantee timing accuracy to within a single machine clock cycle.