• Title/Summary/Keyword: position-dependent processing time

Search Result 18, Processing Time 0.026 seconds

Two-Agent Single-Machine Scheduling with Linear Job-Dependent Position-Based Learning Effects (작업 종속 및 위치기반 선형학습효과를 갖는 2-에이전트 단일기계 스케줄링)

  • Choi, Jin Young
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.38 no.3
    • /
    • pp.169-180
    • /
    • 2015
  • Recently, scheduling problems with position-dependent processing times have received considerable attention in the literature, where the processing times of jobs are dependent on the processing sequences. However, they did not consider cases in which each processed job has different learning or aging ratios. This means that the actual processing time for a job can be determined not only by the processing sequence, but also by the learning/aging ratio, which can reflect the degree of processing difficulties in subsequent jobs. Motivated by these remarks, in this paper, we consider a two-agent single-machine scheduling problem with linear job-dependent position-based learning effects, where two agents compete to use a common single machine and each job has a different learning ratio. Specifically, we take into account two different objective functions for two agents: one agent minimizes the total weighted completion time, and the other restricts the makespan to less than an upper bound. After formally defining the problem by developing a mixed integer non-linear programming formulation, we devise a branch-and-bound (B&B) algorithm to give optimal solutions by developing four dominance properties based on a pairwise interchange comparison and four properties regarding the feasibility of a considered sequence. We suggest a lower bound to speed up the search procedure in the B&B algorithm by fathoming any non-prominent nodes. As this problem is at least NP-hard, we suggest efficient genetic algorithms using different methods to generate the initial population and two crossover operations. Computational results show that the proposed algorithms are efficient to obtain near-optimal solutions.

Proposal of a Time-dependent Method for Determining the Forming Limit of Sheet Metal (판재의 성형한계 결정을 위한 시간의존적 방법의 제안)

  • Kim, S.G.;Kim, H.J.
    • Transactions of Materials Processing
    • /
    • v.27 no.2
    • /
    • pp.115-122
    • /
    • 2018
  • Most domestic and international standards on the forming limit diagram (FLD) including ISO 12004-2, use a 'position-dependent method,' which determines the forming limit from a strain distribution measured on the specimen after necking or fracture. However, the position-dependent method has inherent problems such as the incidence of asymmetry of a strain distribution, the estimation of missing data near fracture, the termination time of test, and the deformation due to the new stress equilibrium after a fracture, which is blamed for causing sometimes a significant lab-to-lab variation. The 'time-dependent method,' which is anticipated to be a new international standard for evaluating the forming limit, is expected to greatly improve these intrinsic disadvantages of the position-dependent method. It is because the time-dependent method makes it possible to identify and accurately determine the forming limit, just before the necking point from the strain data as continuously measured in a short time interval. In this study, we propose a new time-dependent method based on a Gaussian fitting of strain acceleration with the introduction of 'normalized correlation coefficient.' It has been shown in this study that this method can determine the forming limit very stably and gives a higher value, which is in comparison with the results of the previously studied position-dependent and time-dependent methods.

FLOW SHOP SCHEDULING JOBS WITH POSITION-DEPENDENT PROCESSING TIMES

  • WANG JI-BO
    • Journal of applied mathematics & informatics
    • /
    • v.18 no.1_2
    • /
    • pp.383-391
    • /
    • 2005
  • The paper is devoted to some flow shop scheduling problems, where job processing times are defined by functions dependent on their positions in the schedule. An example is constructed to show that the classical Johnson's rule is not the optimal solution for two different models of the two-machine flow shop scheduling to minimize makespan. In order to solve the makespan minimization problem in the two-machine flow shop scheduling, we suggest Johnson's rule as a heuristic algorithm, for which the worst-case bound is calculated. We find polynomial time solutions to some special cases of the considered problems for the following optimization criteria: the weighted sum of completion times and maximum lateness. Some furthermore extensions of the problems are also shown.

A Study on Single Machine Scheduling with a Rate-Modifying Activity and Time-Dependent Deterioration After the Activity (복구조정 활동과 복구조정 후 시간경과에 따라 퇴화하는 작업시간을 갖는 단일기계의 일정계획에 관한 연구)

  • Kim, Byung Soo;Joo, Cheol Min
    • Korean Management Science Review
    • /
    • v.30 no.1
    • /
    • pp.15-24
    • /
    • 2013
  • We consider the single machine scheduling problem with a rate-modifying activity and time-dependent deterioration after the activity. The class of scheduling problems with rate-modifying activities and the class of scheduling problems with time-dependent processing times have been studied independently. However, the integration of these classes is motivated by human operators of tasks who has fatigue while carrying out the operation of a series of tasks. This situation is also applicable to machines that experience performance degradation over time due to mal-position or mal-alignment of jobs, abrasion of tools, and scraps of operations, etc. In this study, the integration of the two classes of scheduling problems is considered. We present a mathematical model to determine job-sequence and a position of a rate-modifying activity for the integration problem. Since the model is difficult to solve as the size of real problem being very large, we propose genetic algorithms. The performance of the algorithms are compared with optimal solutions with various problems.

Determination of the Forming Limit Strain of Sheet Metals by the Time-dependent Method (시간의존법에 의한 금속판재 성형한계변형률의 결정)

  • Kim, S.G.;Oh, T.H.;Kim, J.D.;Kim, H.J.
    • Transactions of Materials Processing
    • /
    • v.24 no.5
    • /
    • pp.361-367
    • /
    • 2015
  • The forming limit diagram (FLD) is the most commonly used tool for evaluating of sheet metal formability in the manufacturing field as well as the finite element analysis (FEA)-based design process. Determination of the forming limits is considerably influenced by testing/measuring machines, techniques and conditions. These influences may cause a large scatter in FLD from laboratory to laboratory. Scatter is especially true when the ‘position-dependent method’, as is specified in most national and international standards, is used. In the current study a new ‘time-dependent method’ is proposed, which is to determine the forming limit strains more accurately and reasonably when producing a FLD from experimental data. This method is based on continual strain measurement during the test. The results are compared to those from the existing standardized methods.

Simulated Annealing for Two-Agent Scheduling Problem with Exponential Job-Dependent Position-Based Learning Effects (작업별 위치기반 지수학습 효과를 갖는 2-에이전트 스케줄링 문제를 위한 시뮬레이티드 어닐링)

  • Choi, Jin Young
    • Journal of the Korea Society for Simulation
    • /
    • v.24 no.4
    • /
    • pp.77-88
    • /
    • 2015
  • In this paper, we consider a two-agent single-machine scheduling problem with exponential job-dependent position-based learning effects. The objective is to minimize the total weighted completion time of one agent with the restriction that the makespan of the other agent cannot exceed an upper bound. First, we propose a branch-and-bound algorithm by developing some dominance /feasibility properties and a lower bound to find an optimal solution. Second, we design an efficient simulated annealing (SA) algorithm to search a near optimal solution by considering six different SAs to generate initial solutions. We show the performance superiority of the suggested SA using a numerical experiment. Specifically, we verify that there is no significant difference in the performance of %errors between different considered SAs using the paired t-test. Furthermore, we testify that random generation method is better than the others for agent A, whereas the initial solution method for agent B did not affect the performance of %errors.

Measurement of maximum deviation of leads using partial image of SMD mounted on PCB (PCB에 장착된 SMD 의 부분영상을 이용한 리드의 최대 벗어난 양의 측정)

  • Shin, Dong-Won;You, Jun-Ho
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.5 no.6
    • /
    • pp.698-704
    • /
    • 1999
  • There are several types of defects of SMDs mounted on PCB, that is, missing components, misalignment, wrong parts and poor solder joints. This research study mainly focuses on measuring of deviation of SMD leads using the partial image of component, not using the full image. This processing based on the partial image has the advantage of the reduction in calculation time compared to the full image. Since position of lead is calculated with respect of the reduction in calculation time compared to the full image. Since position of lead is calculated with respect to pad, the accuracy of the system is not dependent on percise positioning stage. The grabbed image of gray scale is converted into binary format using a cutomatic threshold. After small fragments in the image is removed by a series of morphology operations such as opening and closing, the centroids of PCB pads and SMD leads is obtained together with labeling of blobs. Translational shift and rotationial angle of SMD are succedingly estimated using above information and chip data. The expression that can calculate the maximum deviation of leads with respect to PCB pads has been derived, and inferior mounting of SMD is judged by a given criterion. Some experiments have been executed to verify this measuring scheme.

  • PDF

3D Display Method for Moving Viewers (움직이는 관찰자용 3차원 디스플레이 방법)

  • Heo, Gyeong-Mu;Kim, Myeong-Sin
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.37 no.4
    • /
    • pp.37-45
    • /
    • 2000
  • In this paper we suggest a method of detecting the two eyes position of moving viewer by using images obtained through a color CCD camera, and also a method of rendering view-dependent 3D image which consists of depth estimation, image-based 3D object modeling and stereoscopic display process. Through the experiment of applying the suggested methods, we could find the accurate two-eyes position with the success rate of 97.5% within the processing time of 0.39 second using personal computer, and display the view-dependent 3D image using Fl6 flight model. And through the similarity measurement of stereo image rendered at z-buffer by Open Inventor and captured by stereo camera using robot, we could find that view-dependent 3D picture obtained by our proposed method is optimal to viewer.

  • PDF

PRECISE ORBIT DETERMINATION OF GPS SATELLITES USING PHASE OBSERVABLES (위상 관측 자료를 이용한 GPS 위성의 정밀 궤도 결정)

  • 지명국;최규홍;박필호
    • Journal of Astronomy and Space Sciences
    • /
    • v.14 no.2
    • /
    • pp.375-380
    • /
    • 1997
  • The accuracy of user position by GPS is heavily dependent upon the accuracy of satellite position which is usually transmitted to GPS users in radio signals. The real-time satellite position information directly obtained from broadcast ephimerides has the accuracy of 3~10 meters which is very unsatisfactory to measure 100km baseline to the accuracy of less than a few mili-meters. There are globally at present seven orbit analysis centers capable of generating precise GPS ephimerides and their orbit quality is of the order of about 10cm. Therefore, precise orbit model and phase processing technique were reviewed and consequently precise GPS ephimerides were produced after processing the phase observables of 28 global GPS stations for 1 day. Initial 6 orbit parameters and 2 solar radiation coefficients were estimated using batch least square algorithm and the final results were compared with the orbit of IGS, the International GPS Service for Goedynamics.

  • PDF

Construction of the I-PD Control System by Multilayer Neural Network (다층 신경망에 의한 I-PD 제어계의 구성)

  • 고태언
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.3 no.1
    • /
    • pp.74-79
    • /
    • 2002
  • Many control techniques have been proposed in order to improve the control performance in discrete-time domain control system. In control system using these techniques, the response-characteristic of system is dependent on the gains of the controller. Specially, There is a need to readjust the gain of controller when the response of system is changed by disturbance or load fluctuation. In this paper, I-PD controller and pre-compensator are designed by multilayer neural network. The gains of I-PD controller and pre-compensator are adjusted automatically by back propagation algorithm when the response characteristic of system is changed under a condition. Applying this control technique to the position control system using a DC servo motor as a driver, the control performance of controller is verified by the results of experiment.

  • PDF