• 제목/요약/키워드: Time optimal

검색결과 9,403건 처리시간 0.033초

Customer Order Scheduling Problems on Parallel Machines with Job Capacity Restriction

  • Yang, Jaehwan
    • Management Science and Financial Engineering
    • /
    • 제9권2호
    • /
    • pp.47-68
    • /
    • 2003
  • We consider the customer order scheduling problem with job capacity restriction where the number of jobs in the shop at the same time is fixed. In the customer order scheduling problem, each job is part of some batch (customer order) and the composition of the jobs (product) in the batch is pre-specified. The objective function is associated with the completion time of the batches instead of the completion time of the jobs. We first summarize the known results for the general customer order scheduling problems. Then, we establish some new properties for the problems with job capacity restriction. For the case of unit processing time with the objective of minimizing makespan, we develop a polynomial-time optimal procedure for the two machine case. For the same problem with a variation of no batch alternation, we also develop a polynomial-time optimal procedure. Then, we show that the problems with the objectives of minimizing makespan and minimizing average batch completion time become NP-hard when there exist arbitrary number of machines. Finally, We propose optimal solution procedures for some special cases.

Scheduling Algorithms for the Maximal Total Revenue on a Single Processor with Starting Time Penalty

  • Joo, Un-Gi
    • Management Science and Financial Engineering
    • /
    • 제18권1호
    • /
    • pp.13-20
    • /
    • 2012
  • This paper considers a revenue maximization problem on a single processor. Each job is identified as its processing time, initial reward, reward decreasing rate, and preferred start time. If the processor starts a job at time zero, revenue of the job is its initial reward. However, the revenue decreases linearly with the reward decreasing rate according to its processing start time till its preferred start time and finally its revenue is zero if it is started the processing after the preferred time. Our objective is to find the optimal sequence which maximizes the total revenue. For the problem, we characterize the optimal solution properties and prove the NP-hardness. Based upon the characterization, we develop a branch-and-bound algorithm for the optimal sequence and suggest five heuristic algorithms for efficient solutions. The numerical tests show that the characterized properties are useful for effective and efficient algorithms.

Polynomial Time Algorithm for Satellite Communications Scheduling Problem with Capacity Constrainted Transponder

  • Lee, Sang-Un
    • 한국컴퓨터정보학회논문지
    • /
    • 제21권6호
    • /
    • pp.47-53
    • /
    • 2016
  • This paper deals with the capacity constrained time slot assignment problem(CTSAP) that a satellite switches to traffic between $m{\times}n$ ground stations using on-board $k{\leq}_{min}\{m,n\}$ k-transponders switching modes in SS/TDMA time-division technology. There was no polynomial time algorithm to solve the optimal solution thus this problem classified by NP-hard. This paper suggests a heuristic algorithm with O(mn) time complexity to solve the optimal solution for this problem. Firstly, the proposed algorithm selects maximum packet lengths of $\({mn \atop c}\)$ combination and transmits the cut of minimum packet length in each switching mode(MSMC). In the case of last switching mode with inefficient transmission, we applies a compensation strategy to obtain the minimum number of switching modes and the minimum makespan. The proposed algorithm finds optimal solution in polynomial time for all of the experimental data.

진도개에서 발정주기, 교배적기 및 배란시기 판정을 위한 질세포검사의 이용성 (The Use of Vaginal Cytology for the Determination of Estrous Cycle, Optimal Breeding Time and Ovulation Time in Korea Jin-do Dogs)

  • 손창호;백인석;신창록;최한선;강병규
    • 한국임상수의학회지
    • /
    • 제13권2호
    • /
    • pp.114-122
    • /
    • 1996
  • The aim of this study was to assess the precision of the estimates of the time of estrous cycle, optimal breeding and ovulation derived by vaginal cytology. The thirteen Korea Jin-do dogs were examined the vaginal cytology, plasma estradiol-17$$\beta $ and progesterone assay during the estrous cycle. Day 0 was the day of the first male acceptance. The main change of vaginal cytology during the estrous cycle was the high proportion of anuclear cell and erythrocyte in proestrus, superficial cell, anuclear cell and erythrocyte in estrus, parabasal cell, large intermediate cell and leukocytes in diestrus, and parabasal cell and small intermediate cell in anestrus, respectively. These data indicated that vaginal cytology was reliable method for estimating estrous cycle in Korea Jin-do dogs. In the cell indices during estrus the maximum eosinoghilic index was $92.0{\pm}$2.6 (Mean{\pm} SEM$)% at Day 2 and the maximum cornification indez was $96.0{\pm}1.3%$ at Day 2, respectively. The eosinothilic indez and cornification indez of up to 70% were found at Day -1 to Day 5 and Day -6 to Day 8, and up to 80% at Day 1 to Day 4 and Day -4 to Day 6, respectively. From these data it was presumed that eosinophilic index was more reliable index for monitoring optimal breeding time than cornification indexm because eosinophilic index peak period was shorter than cornification indeX peak period and Day 2 was the day of ovulation. Therefore, optimal breeding time was the eosinophilic index peak period, more than 80% of eosinoghilic index. The $estradiol-17{\beta}$ peak, with 3 days delayed when progesterone concentration was $4.5{\pm}0.5 ng/ml$. These data estimated that the ovulation time was the day of eosinophilic index peak, Day 2. breeding time and pvulation time in Korea Jin-do dogs.

  • PDF

WDM 수동성형성망에서의 TDM 스케쥴링시 최적파장수와 파장조정시간과의 관계 (Relationships between optimal number of wavelenghs and tuning time in WDM/TDM passive star network)

  • 신홍섭;신용식;박구현
    • 한국통신학회논문지
    • /
    • 제23권7호
    • /
    • pp.1785-1796
    • /
    • 1998
  • 본 논문에서는 WDM(wavelength division multiplexing) 수동 성형망(passive star network) 환경에서 TDM(time d division multiplexing) 방법을 기반으로 한 타임슬롯 스케률링시의 최적파장수와 파장조정시간{tuning time)과의 관계에 대해 분석한다. 여기서는 각 노드들이 한 개 씩의 파장조정 송신기(tunable transmitter)와 파장고정 수신기(fixed receiver)를 갖추고 있고, 전송 트래픽은 비균등(nonuniform)이며, 각 노드들은 자신을 제외한 나머지 모든 노드들로 패킷을 전솜함을 가정한다. 기존의 스케률링 방법[7, 8, etc.]에서는 주어진 파장수를 전부 이용하였으나, 본 논문에 서는 부하균형(load balancing)을 포함한 순서 스케줄링(list scheduing) 사용시 프레임 길이를 최소로 하는 '최적 파 장수'가 이용 가능한 파장수 이하의 범위에서 존재함을 실험을 통해 보이고, 파장조정시간과의 관계를 분석한다. 또한 각 노드의 송신기(transmitter)와 수신기(receiver) 수의 증가에 의한 프레임 길이 단축 가능성에 대해 분석한다.

  • PDF

Optimal design for face milling cutter by simulation

  • Kim, J.H.;Lee, B.C.;Kim, H.S.
    • 한국정밀공학회지
    • /
    • 제10권2호
    • /
    • pp.76-85
    • /
    • 1993
  • Based on the cutting force model, three-dimensional optimal design model was developed and optimal designed tool which is minimized cutting force is developed by computer simulation technique. In this model the objective function which is minimized resultant cutting force was used and the variables are radial rake angle, axial rake angle, lead angle of the tool. The cutting forces using conventional and optimal tools by simulation, are compared and analyzed in time and frequency domains. In time domain the cutting force of optimal tool in feed direction was more reduced and less fluctuated than that of conventional tool. Cutting forces of optimal tool in X-and Z-directions are shown a little increased than those of conventional tool. In frequency domain amplitude of insert frequency components of optimal tool in feed direction was more reduced than that of convent- ional tool. The amplitudes of insert frequency components of optimal tool in X-and Z-direction are a little increased than those of conventional tool. As the reduction of amplitude and fluctuations of the cutting force, Optimal tool is considered that tool life and surface roughness would be improved, and stable cutting would be expected.

  • PDF

The Application of Optimal Control Through Fiscal Policy on Indonesian Economy

  • SYAHRINI, Intan;MASBAR, Raja;ALIASUDDIN, Aliasuddin;MUNZIR, Said;HAZMI, Yusri
    • The Journal of Asian Finance, Economics and Business
    • /
    • 제8권3호
    • /
    • pp.741-750
    • /
    • 2021
  • The budget deficit is closely related to expansionary fiscal policy as a fiscal instrument to encourage economic growth. This study aims to apply optimal control theory in the Keynesian macroeconomic model for the economy, so that optimal growth can be found. Macroeconomic variables include GDP, consumption, investment, exports, imports, and budget deficit as control variables. This study uses secondary data in the form of time series, the time period 1990 to 2018. Performing optimal control will result in optimal fiscal policy. The optimal determination is done through simulation, for the period 2019-2023. The discrete optimal control problem is to minimize the objective function in the form of a quadratic function against the deviation of the state variable and control variable from the target value and the optimal value. Meanwhile, the constraint is Keynes' macroeconomic model. The results showed that the optimal value of macroeconomic variables has a deviation from the target values consisting of: consumption, investment, exports, imports, GDP, and budget deficit. The largest deviation from the average during the simulation occurs in GDP, followed by investment, exports, and the budget deficit. Meanwhile, the lowest average deviation is found in imports.

물류센터-N 지점 재고시스템의 최적 계획 서비스수준 결정 방법 (A method to determine optimal input service level in a distribution center-N branches inventory distribution system)

  • 윤승철
    • 산업경영시스템학회지
    • /
    • 제20권42호
    • /
    • pp.31-38
    • /
    • 1997
  • The main objective of this research is to develop a model to select the optimal input service level for a distribution center - multi branch inventory distribution system. With the continuous review policy, the distribution center places an order for specific order quantity to an outside supplier, and the order quantity is replenished after a certain lead time. Also, each branch places an order for particular order quantity to the distribution center to satisfy the customer demands, and receives the replenishment after a lead time. When an out of stock condition occurs during an order cycle, a backorder is placed to the upper level to fill the unfilled demands. With these situation, variable demand and variable lead time are used for better industrial practice. Further, actual lead times with a generic lead time distribution are used in developing the control model. Under the actual lead time model, the customer service measures actually attained for the distribution center and each branch are explained as the effective customer service measures. Thus, throughout the optimal control (using computer search procedures), we can select the optimal input service levels for the distribution center and each branch to attain the effective service level for each branch which is consistent with the goal level of service for each branch. At the same time, the entire distribution system keeps minimum inventories.

  • PDF

적응최적시간제어를 사용한 전기로의 온도제어 (Temperature Control of Electric Furnaces using Adaptive Time Optimal Control)

  • 전봉근;송창섭;금영탁
    • 한국정밀공학회지
    • /
    • 제26권5호
    • /
    • pp.120-127
    • /
    • 2009
  • An electric furnace, inside which desired temperatures are kept constant by generating heat, is known to be a difficult system to control and model exactly because system parameters and response delay time vary as the temperature and position are changed. In this study the heating system of ceramic drying furnaces with time-varying parameters is mathematically modeled as a second order system and control parameters are estimated by using a RIV (Recursive Instrumental-Variable) method. A modified bang-bang control with magnitude tuning is proposed in the time optimal temperature control of ceramic drying electric furnaces and its performance is experimentally verified. It is proven that temperature tracking of adaptive time optimal control using a second order model is more stable than the GPCEW (Generalized Predictive Control with Exponential Weight) and rapidly settles down by pre-estimation of the system parameters.

SCM환경에서의 물류센터의 최적 서비스 수준 결정 방법 (A study on the Method to Determine Optimal Service Level of a Distribution Center in Supply Chain Management Environment)

  • 조용욱;박명규
    • 대한안전경영과학회지
    • /
    • 제3권3호
    • /
    • pp.55-64
    • /
    • 2001
  • The main objective of this research is to develop a model to select the optimal input service level for a distribution center-multi branch inventory distribution system. With the continuous review policy, the distribution center places an order for specific order quantity to an outside supplier, and the order quantity is replenished after a certain lead time Also, each branch places an order for particular order quantity to the distribution center to satisfy the customer demands, and receives the replenishment after a lead time. When an out of stock condition occurs during an order cycle, a backorder is placed to the upper level to fill the unfilled demands. With these situation, variable demand and variable lead time are used for better industrial practice. Further, actual lead times with a generic lead time distribution are used in developing the control model. Under the actual lead time model, the customer service measures actually attained for the distribution center and each branch are explained as the effective customer service measures. Thus, throughout the optimal control (using computer search procedures), we can select the optimal input service levels for the distribution center and each branch to attain the effective service levels for each branch which is consistent with the goal level of service for each branch. At the same time, the entire distribution system keeps minimum inventories.

  • PDF