• Title/Summary/Keyword: Minimizing

Search Result 5,237, Processing Time 0.093 seconds

No Tardiness Rescheduling with Order Disruptions

  • Yang, Jaehwan
    • Industrial Engineering and Management Systems
    • /
    • v.12 no.1
    • /
    • pp.51-62
    • /
    • 2013
  • This paper considers a single machine rescheduling problem whose original (efficiency related) objective is minimizing makespan. We assume that disruptions such as order cancelations and newly arrived orders occur after the initial scheduling, and we reschedule this disrupted schedule with the objective of minimizing a disruption related objective while preserving the original objective. The disruption related objective measures the impact of the disruptions as difference of completion times in the remaining (uncanceled) jobs before and after the disruptions. The artificial due dates for the remaining jobs are set to completion times in the original schedule while newly arrived jobs do not have due dates. Then, the objective of the rescheduling is minimizing the maximum earliness without tardiness. In order to preserve the optimality of the original objective, we assume that no-idle time and no tardiness are allowed while rescheduling. We first define this new problem and prove that the general version of the problem is unary NP-complete. Then, we develop three simple but intuitive heuristics. For each of the three heuristics, we find a tight bound on the measure called modified z-approximation ratio. The best theoretical bound is found to be 0.5 - ${\varepsilon}$ for some ${\varepsilon}$ > 0, and it implies that the solution value of the best heuristic is at most around a half of the worst possible solution value. Finally, we empirically evaluate the heuristics and demonstrate that the two best heuristics perform much better than the other one.

Audio Fingerprint Binarization by Minimizing Hinge-Loss Function (경첩 손실 함수 최소화를 통한 오디오 핑거프린트 이진화)

  • Seo, Jin Soo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.32 no.5
    • /
    • pp.415-422
    • /
    • 2013
  • This paper proposes a robust binary audio fingerprinting method by minimizing hinge-loss function. In the proposed method, the type of fingerprints is binary, which is conducive in reducing the size of fingerprint DB. In general, the binarization of features for fingerprinting deteriorates the performance of fingerprinting system, such as robustness and discriminability. Thus it is necessary to minimize such performance loss. Since the similarity between two audio clips is represented by a hinge-like function, we propose a method to derive a binary fingerprinting by minimizing a hinge-loss function. The derived hinge-loss function is minimized by using the minimal loss hashing. Experiments over thousands of songs demonstrate that the identification performance of binary fingerprinting can be improved by minimizing the proposed hinge loss function.

A Study of Optimal Group Number to Minimize Average Paging Delay (최소 평균 페이징 지연을 위한 최적의 페이징 그룹 수에 관한 연구)

  • Lee, Goo-Yeon
    • Journal of Industrial Technology
    • /
    • v.25 no.B
    • /
    • pp.221-229
    • /
    • 2005
  • We present a numerical analysis of the optimal group number for minimizing the average paging delay. In the analysis, we consider uniform distributions for location probability conditions and apply M/D/1 queueing model to paging message queues of cells. We also get the lower bounds of group numbers and investigate the minimum transmission capacity under average paging delay constraints. Minimizing the average paging delay is important because it means minimizing the amount of bandwidth used for locating mobile terminals. Therefore, the numerical results of this paper will be very useful in PCS system when designing its signalling capacity due to its simplicity and effectiveness.

  • PDF

Study of Efficient Parallel Computation of Cholesky's Method in FE Mesh (유한요소망에서의 효율적인 직접해법 병렬계산에 관한 연구)

  • Lee, H.B.;Choi, K.;Kim, H.J.;Jung, H.K.;Hahn, S.Y.
    • Proceedings of the KIEE Conference
    • /
    • 1996.07a
    • /
    • pp.68-70
    • /
    • 1996
  • In this paper, an efficient parallel computation method for solving large sparse systems of linear algebraic equations by using Cholesky's method in the finite element method is studied. The methods of minimizing the number of fill-ins in the factorization process of factorization are investigated for minimizing the amount of memory and computation time. The parallel programming is implemented under the PVM(Parallel Virtual Machine) environment. The method of load-distribution is studied for minimizing the computation time and the communication time.

  • PDF

Multi-response Designs Minimizing Model Inadequacies

  • Bae, Whasoo
    • Communications for Statistical Applications and Methods
    • /
    • v.9 no.3
    • /
    • pp.799-808
    • /
    • 2002
  • This paper aims at selecting the multi-response design with γ responses minimizing the bias error caused by fitting inadequate models to responses, where the first order models are fitted to Ρ responses fearing the quadratic bias, while to other γ- Ρ responses, the quadratic models are fitted fearing the cubic biases in the cuboidal region of interest. Under the assumption of symmetric design, by minimizing the criterion which represents the amount of error caused by fitting inadequate models, the optimum design was found to be the one having the design moments of second order and the fourth order as 1/3 and l/5, respectively. Examples of the design meeting the required conditions are given for illustration.

An Algorithm for Mining Association Rules by Minimizing the Number of Candidate 2-Itemset (후보 2-항목집합의 개수를 최소화한 연관규칙 탐사 알고리즘)

  • 황종원;강맹규
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.21 no.48
    • /
    • pp.53-63
    • /
    • 1998
  • Mining for association rules between items in a large database of sales transaction has been described as an important data mining problem. The mining of association rules can be mapped into the problem of discovering large itemsets. In this paper we present an efficient algorithm for mining association rules by minimizing the total numbers of candidate 2-itemset, │C$_2$│. More the total numbers of candidate 2-itemset, less the time of executing the algorithm for mining association rules. The total performance of algorithm depends on the time of finding large 2-itemsets. Hence, minimizing the total numbers of candidate 2-itemset is very important. We have performed extensive experiments and compared the performance of our algorithm with the DHP algorithm, the best existing algorithm.

  • PDF

Experimental Study on Minimizing Wall Thickness Thinning for Deep Drawing of Circular Shells (원통형 딥드로잉 용기의 벽 두께 감소 최소화에 관한 실험적 연구)

  • Kim, Doo-Hwan
    • Transactions of Materials Processing
    • /
    • v.7 no.4
    • /
    • pp.393-399
    • /
    • 1998
  • For minimizing wall thickness thinning of circular shells, a new stamping technology, the deep draw-ing process combined with ironing is approached and investigated. The design requirements for the deep drawing shells are to keep the optimum wall thickness with max. 10 percent thickness thinning of the initial blank thickness, to make uniform thickness strain distribution for the wall of circular shell and to improve the shape accuracy for the roundness and concentricity. In order to check the validity and effectiveness of proposed work, a sample process design is applied to a circular shell needed for a 4multi-stepped deep drawing. Through experiments, the variations of the thickness strain distribution in each drawing process are observed. Also a series of experiments are performed to investigate optimum process variables such as the geometry of tooling, radius and drawing rate. In particular, the advantage of current approach with ironing is shown in contrast to the conventional deep drawing process. From the results of proposed method, the optimum value of process variables are obtained, which contribute more uniform thickness strain distribution and better quality in the drawn product.

  • PDF

Tool Monitoring System using Vision System with Minimizing External Condition (환경영향을 최소화한 비전 시스템을 이용한 미세공구의 상태 감시 기술)

  • Kim, Sun-Ho;Baek, Woon-Bo
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.11 no.5
    • /
    • pp.142-147
    • /
    • 2012
  • Machining tool conditions directly affect to quality of product and productivity of manufacturing. Many researches performed for tool condition monitoring in machining process to improve quality and productivity. Conventional methods use characteristics of signal for cutting force, motor current consumption, vibration of machine tools and machining sound. Recently, diameter of machining tool is become smaller for minimizing of mechanical parts. Tool condition monitoring using conventional methods are relatively difficult because micro machining using small diameter tool has low machining load and high cutting speed. These days, the direct monitoring for tool conditions using vision system is performed actively. But, vision system is affected by external conditions such as back ground of image and illumination. In this study, minimizing technology of external conditions using distribution analysis of image data are developed in micro machining using small diameter drill and tap. The image data is gathered from vision system. Several sets of experiment results are performed to verify the characteristics of the proposed machining technology.

A NOTE FOR RESTRICTED INFORMATION MARKETS

  • Jianqi, Yang;Qingxian, Xiao;Haifeng, Yan
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.5_6
    • /
    • pp.1073-1086
    • /
    • 2009
  • This paper considers the problems of martingale measures and risk-minimizing hedging strategies in the market with restricted information. By constructing a general restricted information market model, the explicit relation of arbitrage and the minimal martingale measure between two different information markets are discussed. Also a link among all equivalent martingale measures under restricted information market is given. As an example of restricted information markets, this paper constitutes a jump-diffusion process model and presents a risk minimizing problem under different information. Through $It\hat{o}$ formula and projection results in Schweizer[13], the explicit optimal strategy for different market information are given.

  • PDF

Stakeholders' Perception of the Causes and Effects of Construction Delays on Project Delivery

  • Akinsiku, Olusegun Emmanuel;Akinsulire, Akintunde
    • Journal of Construction Engineering and Project Management
    • /
    • v.2 no.4
    • /
    • pp.25-31
    • /
    • 2012
  • The growing rate of delays is adversely affecting the timely delivery of construction projects. This study therefore assesses construction stakeholders' perception of the causes of delays and its effects on project delivery in a bid to proffer solution in minimizing the occurrences of delays. Questionnaire was used to elicit responses from construction stakeholders; a total of thirty three causes of delays, seventeen resultant effects of delays and fifteen methods of minimizing construction delays were identified for the study based on literature reviews. The results suggest that client's cash flow related problems are the main causes of delays while time and cost overruns are the major identifiable effects of delays in construction projects. However, adequate project planning and budgeting were suggested as possible ways of minimizing the occurrences of delays.