• Title/Summary/Keyword: Assignment

Search Result 2,567, Processing Time 0.033 seconds

Common Due-Date Assignment and Scheduling on Parallel Machines with Sequence-Dependent Setup Times

  • Kim, Jun-Gyu;Yu, Jae-Min;Lee, Dong-Ho
    • Management Science and Financial Engineering
    • /
    • v.19 no.1
    • /
    • pp.29-36
    • /
    • 2013
  • This paper considers common due-date assignment and scheduling on parallel machines. The main decisions are: (a) deter-mining the common due-date; (b) allocating jobs to machines; and (c) sequencing the jobs assigned to each machine. The objective is to minimize the sum of the penalties associated with common due-date assignment, earliness and tardiness. As an extension of the existing studies on the problem, we consider sequence-dependent setup times that depend on the type of job just completed and on the job to be processed. The sequence-dependent setups, commonly found in various manufacturing systems, make the problem much more complicated. To represent the problem more clearly, a mixed integer programming model is suggested, and due to the complexity of the problem, two heuristics, one with individual sequence-dependent setup times and the other with aggregated sequence-dependent setup times, are suggested after analyzing the characteristics of the problem. Computational experiments were done on a number of test instances and the results are reported.

A New State Assignment Technique for Testing and Low Power (테스팅 및 저진력을 고려한 상태할당 기술 개발)

  • Cho, Sang-Wook;Park, Sung-Ju
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.41 no.10
    • /
    • pp.9-16
    • /
    • 2004
  • The state assignment for a finite state machine greatly affects the delay, area, power dissipation, and testabilities of the sequential circuits. In order to improve the testabilities and power consumption, a new state assignment technique based on m-block partition is introduced in this paper. The algorithm minimizes the dependencies between groups of state variables are minimized and reduces switching activity by grouping the states depending on the state transition probability. In the sequel the length and number of feedback cycles are reduced with minimal switching activity on the state variables. Experiment shows significant improvement in testabilities and Power dissipation for benchmark circuits.

Two-Degree-of-Freedom Speed Control of Two-Mass System using Optimal Pole Assignment Method (최적 극배치 기법을 이용한 2관성 공진계의 2자유도 속도제어)

  • Jeon, Don-Su;Kim, Dong-Hwa
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.49 no.1
    • /
    • pp.18-25
    • /
    • 2000
  • In the two-mass servo system driving a load through a flexible shaft, a shaft torsional vibration is often generated. PI controller has been generally used is speed control of such system because of the simplicity of structure and related theory. This paper presents the inertia ratio of the PI servo control system which can be designed by using optimal pole assignment method is fixed. Therefore, it's difficult to obtain the desired control characteristics for different systems only by PI control algorithm. To solve this problems the two-mass speed control system with PID controller is designed by using pole assignment method and an optimum PID parameters are derived by evaluating ITAE(Integral of time multiplied by the absolute error) performance index. But this design method has some problems due to a trade-off between the fast command following property and the attenuation of disturbances and vibrations. In this paper, 2-DOF PID control method which satisfies the command following property, the reduction of overshoot and the property of disturbance rejection at the same time is proposed. This is a practical speed controller using the desired value filter and the feedforward gain. From several simulations, it's clarified that the proposed 2-DOF PID controller is useful for the two-mass system, in comparison with the conventional PID controller.

  • PDF

Density Minimization for the Assignment of P-color Points (P-가지 색을 가진 점들의 할당에 대한 밀도 최소화)

  • Kim, Jae-Hoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.8
    • /
    • pp.1981-1986
    • /
    • 2014
  • The problem studied in this paper is the channel routing problem to assign points with p colors on the upper row of the channel to points on the lower row in order to minimize its density. The case that the points on the upper row has an identical color or only two colors is studied in [1, 2]. This paper generalizes that to the points with p colors. First, we consider the problem to determine whether there is an assignment with density less than or equal to d, when an arbitrary d is given. We show that the problem is solved in O(p(n+m)log(n+m)) time. Using this result, we resolve the problem to fine an assignment with a minimum density.

Task Assignment Model for Crowdsourcing Software Development: TAM

  • Tunio, Muhammad Zahid;Luo, Haiyong;Wang, Cong;Zhao, Fang;Gilal, Abdul Rehman;Shao, Wenhua
    • Journal of Information Processing Systems
    • /
    • v.14 no.3
    • /
    • pp.621-630
    • /
    • 2018
  • Selection of a suitable task from the extensively available large set of tasks is an intricate job for the developers in crowdsourcing software development (CSD). Besides, it is also a tiring and a time-consuming job for the platform to evaluate thousands of tasks submitted by developers. Previous studies stated that managerial and technical aspects have prime importance in bringing success for software development projects, however, these two aspects can be more effective and conducive if combined with human aspects. The main purpose of this paper is to present a conceptual framework for task assignment model for future research on the basis of personality types, that will provide a basic structure for CSD workers to find suitable tasks and also a platform to assign the task directly. This will also match their personality and task. Because personality is an internal force which whittles the behavior of developers. Consequently, this research presented a Task Assignment Model (TAM) from a developers point of view, moreover, it will also provide an opportunity to the platform to assign a task to CSD workers according to their personality types directly.

Assignment of ¹H and $^{13}C$ Nuclear Magnetic Resonances of Ganglioside $G_{A1}$

  • 이경익;전길자;류경임;방은정;최병석;김양미
    • Bulletin of the Korean Chemical Society
    • /
    • v.16 no.9
    • /
    • pp.864-869
    • /
    • 1995
  • Investigation of the structures of the gangliosides has proven to be very important in the understanding of their biological roles such as regulation of differentiation and growth of cells. We used nuclear magnetic resonance spectros-copy in order to investigate the structure of GA1. In order to do this, the assignment of spectra is a prerequisite. Since GA1 does not have polar sialic acid, the spectral overlap is severe. In order to solve this problem, we use 2D NMR spectroscopy and heteronuclear 1H/13C correlated spectroscopy in this study. Here, we report the complete assignment of the proton and the carbon spectra of the GA1 in DMSO-d6-D20 (98:2, v/v). These assignments will be useful for interpreting 1H and 13C NMR data from uncharacterized oligosaccharides and for determining the linkage position, the number of sugar rings, and the sequence of new ganglioside. Amide proton in ring Ⅲ shows many interring nOes and has intramolecular hydrogen bonding. This appears to be an important factor in tertiary folding of GA1. Based on this assignment, determination of three dimensional structure of GA1 will be carried out. Studies on the conformational properties of GA1 may lead to a better understanding of the molecular basis of its functions.

Approximation Algorithm for Multi Agents-Multi Tasks Assignment with Completion Probability (작업 완료 확률을 고려한 다수 에이전트-다수 작업 할당의 근사 알고리즘)

  • Kim, Gwang
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.27 no.2
    • /
    • pp.61-69
    • /
    • 2022
  • A multi-agent system is a system that aims at achieving the best-coordinated decision based on each agent's local decision. In this paper, we consider a multi agent-multi task assignment problem. Each agent is assigned to only one task and there is a completion probability for performing. The objective is to determine an assignment that maximizes the sum of the completion probabilities for all tasks. The problem, expressed as a non-linear objective function and combinatorial optimization, is NP-hard. It is necessary to design an effective and efficient solution methodology. This paper presents an approximation algorithm using submodularity, which means a marginal gain diminishing, and demonstrates the scalability and robustness of the algorithm in theoretical and experimental ways.

Investigation of the case on the pulse diagnosis of Dongueibogam and proposal of Inch-Bar-Cubit assignment for organ positioning in pulse diagnosis (『동의보감』 맥진 의안 고찰 및 맥진 장부 정위(定位)에 대한 부중침(浮中沈) 배속법 제안)

  • Lim, Seungil;Park, Hunpyeong;Na, Changsu
    • The Journal of the Society of Korean Medicine Diagnostics
    • /
    • v.25 no.1
    • /
    • pp.1-71
    • /
    • 2021
  • Objectives In order to reinterpret the meaning of Inch-Bar-Cubit used by pulse diagnosis, this study investigates floating pulses of lung and heart in the Inch area, middle pulse of spleen and livers in the Bar area, and deep pulse of kidney and life gate in the Cubit area. However, some suggested that the meaning of Inch-Bar-Cubit should be interpreted in the same way as floating-middle-deep. Methods In this study, the contents of Inch-Bar-Cubit assignment of pulse diagnosis proposed by Dongeuibogam and Medical Scientist were investigated along with the existing investigation of pulse diagnosis, and their interpretation was investigated. Result and conclusion The assignment of books in Pulse diagnosis can be applied by replacing them with floating-middle-deep instead of Inch-Bar-Cubit.

  • PDF

A study on the Adaptive Subcarrier Assignment techniques for interference suppression in OFDM System (OFDM 시스템에서 Adaptive Subcarrier Assignment 기법을 통한 간섭 경감에 관한 연구)

  • 조성구;박용완;최정희;이동학;정원석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.8A
    • /
    • pp.889-897
    • /
    • 2004
  • In this Paper, we propose the algorithm to provide stable communication in OFDM system under the highly interfered environment by the same/different systems which use same bandwidth or other jamming signal, i.e., radar signal. The proposed Adaptive Subcarrier Assignment(ASA) method first estimates the received power of each subcarrier in the block or fin or OFDM receiver. Then we estimate the threshold level which is the average power of the transmitted OFDM signal with AWGN. The highly interfered subcarriers, which are greater powers than the specified threshold level, are rejected in the next transmission and the only non-interfered subcarriers are selected as the next transmission. This algorithm provides stable communication in any OFDM systems without changing the physical layer under the highly interfered communication environment. We estimated the status of the subcarriers based on the bandwidth and power of the jamming signal and showed the performance of the proposed algorithm by the simulation.

Channel Heterogeneity Aware Channel Assignment for IEEE 802.11 Multi-Radio Multi-Rate Wireless Networks (IEEE 802.11 다중 라디오 다중 전송률 무선 네트워크를 위한 채널 이질성 인지 채널 할당)

  • Kim, Sok-Hyong;Kim, Dong-Wook;Suh, Young-Joo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.11A
    • /
    • pp.870-877
    • /
    • 2011
  • IEEE 802.11 devices are widely used, and terminals can be equipped with multiple IEEE 802.11 interfaces as low-cost IEEE 802.11 devices are deployed. The off-the-shelf IEEE 802.11 devices provide multiple channels and multiple data rates. In practical multi-channel networks, since there is channel heterogeneity which indicates that channels have different signal characteristics for the same node, channels should be efficiently assigned to improve network capacity. In addition, in multi-rate networks, low-rate links severely degrade the performance of high-rate links on the same channel, which is known as performance anomaly. Therefore, in this paper, we propose a heterogeneity aware channel assignment (HACA) algorithm that improves network performance by reflecting channel heterogeneity and performance anomaly. Through NS-2 simulations, we validate that the HACA algorithm shows improved performance compared with existing channel assignment algorithms that do not reflect channel heterogeneity.