• Title/Summary/Keyword: Time Constraint

Search Result 1,045, Processing Time 0.03 seconds

Estimation of the Actual Working Time by Interval Linear Regression Models with Constraint Conditions (제약부 구간 선형 회귀모델에 의한 실동시간의 견적)

  • Hwang, S. G.;Seo, Y. J.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.14 no.2
    • /
    • pp.105-114
    • /
    • 1989
  • The actual working time of jobs, in general, is different to the standard time of jobs. In this paper, in order to analyze the actual working time of each job in production, we use the total production amount and the encessary total working time. The method which analyzes the actual working time is as follows. In this paper, we propose the interval regression analysis for obtaining an interval linear regression model with constraint conditions with respect to interval parameters. The merits of this method are the following.1) it is easy to obtain an interval linear model by solving a LP problem to which the formulation of proposed regression analysis is reduced, 2) it is easy to add constraint conditions about interval parameters, which are a sort of expert knowledge. As an application, within a case which has given certain data, the actual working time of jobs and the number of workers in a future plan are estimated through the real data obtianed from the operation of processing line in a heavy industry company. It results from the proposed method that the actual working time and the number of workers can be estimated as intervals by the interval regression model.

  • PDF

Simulation of Vehicle-Track-Bridge Dynamic Interaction by Nonlinear Hertzian Contact Spring and Displacement Constraint Equations (비선형 헤르쯔 접촉스프링과 변위제한조건식의 적용에 의한 차량-궤도-교량 동적상호작용 수치해석기법)

  • Chung Keun-Young;Lee Sung-Uk;Min Kyung-Ju
    • Proceedings of the KSR Conference
    • /
    • 2005.11a
    • /
    • pp.191-196
    • /
    • 2005
  • In this study, to describe vehicle-track-bridge dynamic interaction phenomena with 1/4 vehicle model, nonlinear Hertzian contact spring and nonlinear contact damper are introduced. In this approach external loads acting on 1/4 vehicle model are self weight of vehicle and geometry information of running surface. The constraint equation on contact surface is implemented by Penalty method. Also, to improve the numerical stability and to maintain accuracy of solution, the artificial damper and the reaction from constraint violation are introduced. A nonlinear time integration method, in this study, Newmark method is adopted for both equations of vehicles and structure. And to reduce the error caused by inadequate time step size, adaptive time-stepping technique is partially introduced. As the nonlinear Hertzian contact spring has no resistance to tensile force, the bouncing phenomena of wheelset can be described. Thus, it is expected that more versatile dynamic interaction phenomena can be described by this approach and it can be applied to various railway dynamic problems.

  • PDF

CPLD Low Power Technology Mapping for Reuse Module Design under the Time Constraint (시간제약 조건하에서 재사용 모듈 설계를 통한 CPLD 저전력 기술 매핑)

  • Kang, Kyung Sik
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.4 no.3
    • /
    • pp.77-83
    • /
    • 2008
  • In this paper, CPLD low power technology mapping for reuse module design under the time constraint is proposed. Traditional high-level synthesis do not allow reuse of complex, realistic datapath component during the task of scheduling. On the other hand, the proposed algorithm is able to approach a productivity of the design the low power to reuse which given a library of user-defined datapath component and to share of resource sharing on the switching activity in a shared resource. Also, we are obtainable the optimal the scheduling result in experimental results of our using chaining and multi-cycling in the scheduling techniques. Low power circuit make using CPLD technology mapping algorithm for selection reuse module by scheduling.

A Minimum time trajectory planning for robotic manipulators with input torque constraint (입력 토오크 constraint를 가진 로보트 매니플레이터에 대한 최소 시간 궤적 계획)

  • Hong, In-Keun;Hong, Suk-Kyo
    • Proceedings of the KIEE Conference
    • /
    • 1989.11a
    • /
    • pp.445-449
    • /
    • 1989
  • Achievement of a straight line motion in the Cartesian space has a matter of great importance. Minimization of task execution time with linear interpolation in the joint space, accomplishing of a approximation of straight line motion in the Cartesian coordinate is considered as the prespecified task. Such determination yields minimum time joint-trajectory subject to input torque constraints. The applications of these results for joint-trajectory planning of a two-link manipulator with revolute joints are demonstrated by computer simulations.

  • PDF

Robust Control for Unknown Disturbance of Robotic System Using Prescribed Tracking Error Constraint Control and Finite-Time SMC (규정된 추종오차 구속제어와 유한시간 슬라이딩 모드 제어를 이용한 로봇시스템의 미지의 외란에 대한 강인제어)

  • Ryu, Hyun-Jea;Shin, Dong-Suk;Han, Seong-Ik
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.22 no.5
    • /
    • pp.320-325
    • /
    • 2016
  • This paper presents a robust finite-time sliding mode control (SMC) scheme for unknown disturbance and unmodeled nonlinear friction and dynamics in the robotic manipulator. A finite-time SMC (FSMC) surface and finite-time sliding mode controller are constructed to obtain faster error convergence than the conventional infinite-time based SMC. By adding prescribed constraint control term to a finite-time SMC to compensate for unknown disturbance and uncertainties, a robust control scheme can be designed as well as faster convergence control. In addition, simpler controller structure is built by using feed-forwarding upper bound coefficients of each manipulator dynamic parameters instead of model-based control or adaptive observer to estimate unknown manipulator parameters. Simulation and experimental evaluations highlight the efficacy of the proposed control scheme for an articulated robotic manipulator.

Differences in Leisure Participation by Types of Leisure Constraints for Married employees (기혼취업자의 여가제약유형에 따른 여가활동참여의 차이)

  • Kim, Oi-Sook;Park, Eun Jung
    • Journal of Family Resource Management and Policy Review
    • /
    • v.17 no.1
    • /
    • pp.241-263
    • /
    • 2013
  • Time pressure and financial burden have been reported as the main constraints on leisure participation. The purpose of this study was to explore a typology of leisure constraints, investigate the characteristics of leisure constraint types, and analyze the differences in leisure participation by the types of leisure constraints for married employees. The data source for this research was the 2009 Time Use Survey conducted by the Korea National Statistical Office (KNSO). Married employees aged 20 to 59 years completed 13,476 time diaries (7,984 for male, 5,492 for female), which were analyzed using chi-square, cluster analysis, and ANOVA analysis. Leisure constraints were classified into five types in two categories, working time per week and personal income for both males and females respectively. The three types for both males and females were time-income constraints, income constraints, and general constraints, with an additional type for men, $time^+$-income constraints, and an additional type for women, time constraint. The most common type was general constraints, for both males and females. Each type was further differentiated by the following socio-economic variables: age, educational level, job type, and weekly day-off. The study found that participation in study, sports, and religious activities varied with the types of leisure constraints.

  • PDF

Dynamic rt-VBR Traffic Characterization using Sub-Sum Constraint Function (Sub-Sum Constraint Function을 이용한 동적 실시간 VBR 트래픽 특성화)

  • 김중연;정재일
    • Proceedings of the IEEK Conference
    • /
    • 2000.11a
    • /
    • pp.217-220
    • /
    • 2000
  • This paper studies a real-time VBR traffic characterization. There are two big approaches to determine traffic. One is a statistic approach and the other is a deterministic approach. This paper proposes a new constraint function, what we called “Sub-Sum Constraint Function”(SSCF). This function is mainly based on a deterministic approach and uses a statistic approach. It predicts and calculates the next rate with a present information about the stream. SSCF captures the intuitive bounded by a rate lower than its peak rate and closer to its long-term average rate. This model makes a order of the constraint function much less than any other works (O(n)). It can also be mapped on a token bucket algorithm which consists of r (token rate) and b (token depth). We use a concept, EB(effective bandwidth) for a utility of our function and comparing with other techniques such as CBR, average VBR. We simulated 21 multimedia sources for verifying the utility of our function.

  • PDF

The Optimal Link Scheduling in Half-Duplex Wireless Mesh Networks Using the Constraint Programming (제약식 프로그래밍을 이용한 일방향 전송 무선 메쉬 네트워크에서의 최적 링크 스케쥴링)

  • Kim, Hak-Jin
    • Journal of Information Technology Applications and Management
    • /
    • v.23 no.2
    • /
    • pp.61-80
    • /
    • 2016
  • The wireless mesh network (WMN) is a next-generation technology for data networking that has the advantage in cost and the flexibility in its construction because of not requiring the infra-structure such as the ethernet. This paper focuses on the optimal link scheduling problem under the wireless mesh network to effectuate real-time streaming by using the constraint programming. In particular, Under the limitation of half-duplex transmission in wireless nodes, this paper proposes a solution method to minimize the makespan in scheduling packet transmission from wireless nodes to the gateway in a WMN with no packet transmission conflicts due to the half-duplex transmission. It discusses the conflicts in packet transmission and deduces the condition of feasible schedules, which defines the model for the constraint programming. Finally it comparatively shows and discusses the results using two constraint programming solvers, Gecode and the IBM ILOG CP solver.

A Constraint Programming-based Automated Course Timetabling System

  • Hwang, Junha
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.4
    • /
    • pp.27-34
    • /
    • 2019
  • The course timetabling problem is a kind of very complex combinatorial optimization problems, which is known as an NP-complete problem. Sometimes a given course timetabling problem can be accompanied by many constraints. At this time, even if only one constraint is violated, it can be an infeasible timetable. Therefore, it is very difficult to make an automated course timetabling system for a complex real-world course timetabling problem. This paper introduces an automated course timetabling system using constraint programming. The target problem has 26 constraints in total, and they are expressed as 24 constraints and an objective function in constraint programming. Currently, we are making a timetable through this system and applying the result to the actual class. Members' satisfaction is also much higher than manual results. We expect this paper can be a guide for making an automated course timetabling system.

Development of an ergonomic control panel layout system and its application

  • 박성준;정의승;이상도;이동춘
    • Proceedings of the ESK Conference
    • /
    • 1995.10a
    • /
    • pp.172-181
    • /
    • 1995
  • A control panel layout system was developed to generate an ergrnomically sound panel design. A constraint satisfaction concept was introduced as a framework of incorporating diverse ergonomic design guidelines into the panel layout. An efficient search algorithm which can find a constraint satisfaction solution within a reasonable time was developed based on preprocess and look ahead procedures with the backjumping technique. The proto- type panel layaout system was developed on a SPARC workstation. The constraint satisfaction algorithm was programmed in C language with Motif as a GUI tool under the X-windows environment. The effectiveness of the prototype paned layout system was examined by a case study.

  • PDF