Contents: Variety and Quality. Variability loss and tolerance. Determining tolerances. Tolerance design and experimental design. Offline and online quality control. Parameter design and tolerance design: case study. Experimental design for smaller is better characteristics. Experimental design for larger is better characteristics. Bypassing the S/N ratio: spring experiment. Experimental design for dynamic characteristics.

Introduction to quality engineering. designing quality into products a

http://www.upv.es/deioac/Investigacion/revision.pdf

The hybrid flow shop scheduling problem

We consider heuristic algorithms for the resource-constrained project scheduling problem. Starting with a literature survey, we summarize the basic components of heuristic approaches. We briefly describe so-called X -pass methods which are based on priority rules as well as metaheuristic algorithms. Subsequently, we present the results of our in-depth computational study. Here, we evaluate the performance of several state-of-the-art heuristics from the literature on the basis of a standard set of test instances and point out to the most promising procedures. Moreover, we analyze the behavior of the heuristics with respect to their components such as priority rules and metaheuristic strategy. Finally, we examine the impact of problem characteristics such as project size and resource scarceness on the performance.

Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem

Review: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective

Many quality improvement (QI) programs including six sigma, design for six sigma, and kaizen require collection and analysis of data to solve quality problems. Due to advances in data collection systems and analysis tools, data mining (DM) has widely been applied for QI in manufacturing. Although a few review papers have recently been published to discuss DM applications in manufacturing, these only cover a small portion of the applications for specific QI problems (quality tasks). In this study, an extensive review covering the literature from 1997 to 2007 and several analyses on selected quality tasks are provided on DM applications in the manufacturing industry. The quality tasks considered are; product/process quality description, predicting quality, classification of quality, and parameter optimisation. The review provides a comprehensive analysis of the literature from various points of view: data handling practices, DM applications for each quality task and for each manufacturing industry, patterns in the use of DM methods, application results, and software used in the applications are analysed. Several summary tables and figures are also provided along with the discussion of the analyses and results. Finally, conclusions and future research directions are presented.

Review: A review of data mining applications for quality improvement in manufacturing industry

A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities

In on-line analytical processing (OLAP), precomputing (materializing as views) and indexing auxiliary data aggregations is a common way of reducing query-evaluation time costs for important data-analysis queries. We consider an OLAP view- and index-selection problem stated as an optimization problem, where (i) the inputs include the data-warehouse schema, a set of data-analysis queries of interest, and a storage-limit constraint, and (ii) the output is a set of views and indexes that minimizes the costs of the input queries, subject to the storage limit. While greedy and other heuristic strategies for choosing views or indexes might help to some extent in improving the costs, it is highly nontrivial to arrive at a globally optimum solution, one that reduces the processing costs of typical OLAP queries as much as is theoretically possible. In fact, as observed in [17] and to the best of our knowledge, there is no known approximation algorithm for OLAP view or index selection with nontrivial performance guarantees.In this paper we propose a systematic study of the OLAP view- and index-selection problem. Our specific contributions are as follows: (1) We develop an algorithm that effectively and efficiently prunes the space of potentially beneficial views and indexes when given realistic-size instances of the problem. (2) We provide formal proofs that our pruning algorithm keeps at least one globally optimum solution in the search space, thus the resulting integer-programming model is guaranteed to find an optimal solution. (3) We develop a family of algorithms to further reduce the size of the search space, so that we are able to solve larger problem instances, although we no longer guarantee the global optimality of the resulting solution. (4) Finally, we present an experimental comparison of our proposed approaches with the state-of-the-art approaches of [2, 12]. Our experiments show that our approaches to view and index selection result in high-quality solutions --- in fact, in globally optimum solutions for many realistic-size problem instances. Thus, they compare favorably with the well-known OLAP-centered approach of [12] and provide for a winning combination with the end-to-end framework of [2] for generic view and index selection.

/pdf/exact-and-inexact-methods-for-selecting-views-and-indexes-18a989zimr.pdf

Exact and inexact methods for selecting views and indexes for OLAP performance improvement

On the sensitivity of project variability to activity mean duration

A nonlinear programming approach to the parameter design problem

We present a generalization of the mixed integer rounding (MIR) approach for generating valid inequalities for (mixed) integer programming (MIP) problems. For any positive integer n, we develop n facets for a certain (n + 1)-dimensional single-constraint polyhedron in a sequential manner. We then show that for any n, the last of these facets (which we call the n-step MIR facet) can be used to generate a family of valid inequalities for the feasible set of a general (mixed) IP constraint, which we refer to as the n-step MIR inequalities. The Gomory Mixed Integer Cut and the 2-step MIR inequality of Dash and gunluk  (Math Program 105(1):29–53, 2006) are the first two families corresponding to n = 1,2, respectively. The n-step MIR inequalities are easily produced using periodic functions which we refer to as the n-step MIR functions. None of these functions dominates the other on its whole period. Finally, we prove that the n-step MIR inequalities generate two-slope facets for the infinite group polyhedra, and hence are potentially strong.

Yahya Fathi

Papers

A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities

Exact and inexact methods for selecting views and indexes for OLAP performance improvement

On the sensitivity of project variability to activity mean duration

A nonlinear programming approach to the parameter design problem

Generalized mixed integer rounding inequalities: facets for infinite group polyhedra