• Korean Management Science Review
• /
• v.7 no.2
• /
• pp.43-50
• /
• 1990

생산계획이 수립되어 있는 상태에서 각 공정에 대한 구체적인 일정계획을 수립하였다. Group Technology를 이용하여 부품그룹을 형성하고, 흐름 생산형태의 GT라인으로 가공공정을 배치한 상태에서, Group Scheduling 기법을 활용하였다. 가공순서 결정 규칙으로 Petrov의 방법을 이용하였으며, 부품의 생산량을 고려하여 그룹간 가공순서와 그룹내 각 부품의 가공순서를 결정하였다. 이 과정을 전산화하여 실제로 이용할 수 있도록 하였다. 또한, Gantt Chart를 작성하여 각 공정의 부품별 가공 시작시간과 가공 완료시간을 계산하여, 작업지시는 물론 공정관리에 효과적으로 활용할 수 있도록 하였다. 컴퓨터 프로그램은 쉽게 실용적으로 활용할 수 있도록 하는데 중점을 두었다. 준비시간 및 가공시간에 대한 데이타는 업체에서 이미 사용하고 있는 생산정보 파일을 그대로 이용하거나, 그렇지 않는 경우 여러 용도에 맞도록 이 데이타를 파일로 작성하면 프로그램을 더욱 효율적으로 사용할 수 있으리라 기대된다.

• Journal of Korean Institute of Industrial Engineers
• /
• v.11 no.2
• /
• pp.57-73
• /
• 1985

Group scheduling problem in a multi-stage manufacturing system is reviewed and two heuristic procedures for minimizing the makespan are developed by employing the methods of flow shop sequencing heuristics with a slight modification. The comparisons among the five heuristics, three previously reported heuristics and two heuristics suggested by this study, are made on different problem sizes. The computational results indicate that NEH-GS method gives better group schedules than the other heuristics tested, but its computation time increases rapidly as the problem size increases. On the other hand, CDS-GS method provides relatively good group schedules with less computation time compared with NEH-GS method.

• ETRI Journal
• /
• v.45 no.2
• /
• pp.318-328
• /
• 2023

Recently, embedded systems, such as mobile platforms, have multiple processing units that can operate in parallel, such as centralized processing units (CPUs) and neural processing units (NPUs). We can use deep-learning compilers to generate machine code optimized for these embedded systems from a deep neural network (DNN). However, the deep-learning compilers proposed so far generate codes that sequentially execute DNN operators on a single processing unit or parallel codes for graphic processing units (GPUs). In this study, we propose PartitionTuner, an operator scheduler for deep-learning compilers that supports multiple heterogeneous PUs including CPUs and NPUs. PartitionTuner can generate an operator-scheduling plan that uses all available PUs simultaneously to minimize overall DNN inference time. Operator scheduling is based on the analysis of DNN architecture and the performance profiles of individual and group operators measured on heterogeneous processing units. By the experiments for seven DNNs, PartitionTuner generates scheduling plans that perform 5.03% better than a static type-based operator-scheduling technique for SqueezeNet. In addition, PartitionTuner outperforms recent profiling-based operator-scheduling techniques for ResNet50, ResNet18, and SqueezeNet by 7.18%, 5.36%, and 2.73%, respectively.

• International conference on construction engineering and project management
• /
• 2022.06a
• /
• pp.975-983
• /
• 2022

This paper presents an innovative way of integrating scheduling and project controls with the environmental impact of a construction project to track, monitor, and manage environmental emissions at the activity level. As a starting point, scheduling and project controls help monitor the status of a project to provide an assessment of the duration and sequence of activities. Additionally, project schedules can also reflect resource allocation and costs associated with various phases of a construction project. Owners, contractors and construction managers closely monitor tasks or activities on the critical path(s) and/or longest path(s) calculated through network based scheduling techniques. However, existing industry practices do not take into account environmental impact associated with each activity during the life cycle of a project. Although the environmental impact of a project may be tracked in various ways, that tracking is not tied to the project schedule and, as such, generally is not updated when schedules are revised. In this research, a Cradle to Gate approach is used to estimate environmental emissions associated with each activity of a sample project schedule. The research group has also investigated the potential determination of scenarios of lowest environmental emissions, just as project managers currently determine scenarios with lowest cost or time. This methodology can be scaled up for future work to develop a library of unit emissions associated with commonly used construction materials and equipment. This will be helpful for project owners, contractors, and construction managers to monitor, manage, and reduce the carbon footprint associated with various projects.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.4
• /
• pp.291-303
• /
• 2009

Round robin based proportional share scheduling(RRPS) defines weight which determines share for each task and allocates CPU resource to each task in proportional to its respective weight. RRPS uses fairness as the measure of performance and aims at high fairness of scheduling. However, researches for scheduling fairness problem due to synchronization among tasks have been rarely investigated. In this paper, we discuss that scheduling delay due to synchronization may result high unfairness in RRPS. We explain such a situation as weight inversion. We then propose weight inheritance protocol(WIP), a synchronization mechanism, that prevents weight inversion. We also show that WIP can reduce unfairness using fairness analysis and simulation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.8-18
• /
• 2009

CableLAB published DOCSIS 3.0 Specifications to supply broadband access to homes and small businesses. The primary technique of DOCSIS 3.0 Specification is channel bonding which provides cable operators with a flexible way to significantly increase up/downstream speeds. In this paper, we propose the upstream scheduler that serves channel bonding. Proposed scheduler consists of two sub-scheduler: bonding group scheduler and channel scheduler. Also, we propose three scheduling algorithms to allocate request bandwidth of CM to each bonding channel: equivalent scheduling algorithm, current request-based scheduling algorithm, and last grant-based scheduling algorithm. In order to evaluate the performance of these algorithms and DOCSIS 3.0 MAC protocol, we develop the DOCSIS 3.0 simulator with the network simulator, OPNET, to model DOCSIS network, CMTS, and CM. Our results show that equivalent scheduling algorithm is superior to others in the view of transmission delay and throughput and DOCSIS 3.0 protocol provides higher throughput than pre-DOCSIS 3.0 protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6B
• /
• pp.377-386
• /
• 2005

Recently, to increase throughput per hour on real-time disk scheduling, a lot of algorithms that apply SCAN technique to EDF(Earliest Deadline First) that is representative real-time disk scheduling algorithm are studied. However, existing disk scheduling algorithms have several limitations because they consider continuous I/O requests when create SCAN group. Also, because SCAN technique was fixed direction, the existing algorithms have shortcoming that there are a lot of time damages. This paper proposes a new real-time disk scheduling algorithm based on the insertion technique and the two-way SCAN technique to solve the problems of the exiting real-time disk scheduling algorithms in hard real-time system. The simulation result shows that, when using our techniques, the disk throughput and the number of serviceable I/O requests are enhanced.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.38 no.2
• /
• pp.141-157
• /
• 2013

In this paper, we consider the minimization of the total weighted earliness-tardiness penalty of jobs, regarding the partial precedences between jobs. We present an optimal scheduling algorithm in O(n(n+m log m)) where n is the number of jobs and m is the number of partial precedences. In the algorithm, the optimal schedule is constructed iteratively by considering each group of contiguous jobs as a block that is represented by a tree.

• Journal of Korean Society for Quality Management
• /
• v.13 no.1
• /
• pp.65-76
• /
• 1985

The purpose of this thesis is to develop a micro-computer application for GT/MRP (group technology/material requirement planning) integrated system for efficient management of production scheduling. GT and MRP system have been found to have several drawbacks in practice. By GT and MRP system, however, it should be able to construct a GT/MRP integrated system that possesses the advantages of both concepts while alleviating their individual limitations.

• Proceedings of the Safety Management and Science Conference
• /
• 2003.05a
• /
• pp.285-290
• /
• 2003

There is only one server available and arriving work require services from this server. Job are processed by the machine one at a time. The most common objective is to sequence jobs on the severs so as to minimize the penalty for being late, commonly called tardiness penalty Based on other objectives, many criteria may serve as s basis for developing job schedules. Therefore, this study tries to proposed that Scheduling by customer needs group for minimizing the problem and reducing inventory, product development time, cycle time, and order lead time.