Principles and practice of assembling machine tools.

Mode of access: Internet.

Cyclopedia of engineering; a complete manual of steam and machine practice...ed. by a corps of distinguished engineers, techical experts and eminent authorities. Editor-in-chief, Louis Derr

Mode of access: Internet.

Reliability management of machine tool technology: a case study of current practice

Considerable attention has been given in the literature to identifying and describing the effective elements which positively affect the improvement of product reliability. These have been perceived by many as the 'state of the art' in the manufacturing industry. The applicability, diffusion and effectiveness of such methods and philosophies, as a means of systematically improving the reliability of a product, come in the main from case studies and single and infra-industry empirical studies. These studies have both been carried out within the wider context of quality assurance and management, and taking reliability as a discipline in its own right. However, it is somewhat of a surprise that there are no recently published findings or research studies on the adoption of these methods by the machine tool industry. This may lead one to construct several hypothesised paradigms: (a) that machine tool manufacturers compared to other industries, are slow to respond to propositions given in the literature by theorists or (b) this may indicate that a large proportion of the manufacturers make little use of the reliability improvement techniques as described in the literature, with the overall perception that they will not lead to any significant improvements? On the other hand, it is evident that hypothetical verification of the operational and engineering methods of reliability achievement and improvement adopted in the machine tool industry is less widely researched. Therefore, research into this area is needed in order to explore the 'state of the art' practice in the machine tool industry. This is in terms of the status, structure and activities of the operation of the reliability function. This paper outlines a research programme being conducted with the co-operation of a leading machine tool manufacturer, whose UK manufacturing plant produces in the main Vertical Machining Centres (VMCs) and is continuously undergoing incremental transitions in product reliability improvement.

Realization of an Optimal Schedule for the Two-machine Flow-Shop with Interval Job Processing Times

Non-preemptive two-machine flow-shop scheduling problem with uncertain processing times of n jobs is studied. In an uncertain version of a scheduling problem, there may not exist a unique schedule that remains optimal for all possible realizations of the job processing times. We find necessary and sufficient conditions (Theorem 1) when there exists a dominant permutation that is optimal for all possible realizations of the job processing times. Our computational studies show the percentage of the problems solvable under these conditions for the cases of randomly generated instances with n ≤ 100 . We also show how to use additional information about the processing times of the completed jobs during optimal realization of a schedule (Theorems 2 – 4). Computational studies for randomly generated instances with n ≤ 50 show the percentage of the two- machine flow-shop scheduling problems solvable under the sufficient conditions given in Theorems 2 – 4.

Makespan minimization in a job shop with a batch processing machine

A job shop with one batch processing and several discrete machines is analyzed. Given a set of jobs, their process routes, processing requirements, and size, the objective is to schedule the jobs such that the makespan is minimized. The batch processing machine can process a batch of jobs as long as the machine capacity is not violated. The batch processing time is equal to the longest processing job in the batch. The problem under study can be represented as Jm:batch:Cmax. If no batches were formed, the scheduling problem under study reduces to the classical job shop scheduling problem (i.e. Jm:: Cmax), which is known to be NP-hard. This research extends the scheduling literature by combining Jm::Cmax with batch processing. The primary contributions are the mathematical formulation, a new network representation and several solution approaches. The problem under study is observed widely in metal working and other industries, but received limited or no attention due to its complexity. A novel network representation of the problem using disjunctive and conjunctive arcs, and a mathematical formulation are proposed to minimize the makespan. Besides that, several algorithms, like batch forming heuristics, dispatching rules, Modified Shifting Bottleneck, Tabu Search (TS) and Simulated Annealing (SA), were developed and implemented. An experimental study was conducted to evaluate the proposed heuristics, and the results were compared to those from a commercial solver (i.e., CPLEX). TS and SA, with the combination of MWKR-FF as the initial solution, gave the best solutions among all the heuristics proposed. Their results were close to CPLEX; and for some larger instances, with total operations greater than 225, they were competitive in terms of solution quality and runtime. For some larger problem instances, CPLEX was unable to report a feasible solution even after running for several hours. Between SA and the experimental study indicated that SA produced a better average Cmax for all instances. The solution approaches proposed will benefit practitioners to schedule a job shop (with both discrete and batch processing machines) more efficiently. The proposed solution approaches are easier to implement and requires short run times to solve large problem instances.

A heuristic algorithm for the two-machine re-entrant shop scheduling

Abstract not available

Heuristics for the two-stage job shop scheduling problem with a bottleneck machine

Abstract not available

A polynomial algorithm for the three-machine open shop with a bottleneck machine

Abstract not available

Two-stage open shop scheduling with a bottleneck machine

Abstract not available

Two-machine open shop scheduling with special transportation times

Abstract not available

Flow shop scheduling problems under machine-dependent precedence constraints

Abstract not available

Information–movement coupling in developing cricketers under changing ecological practice constraints

Changing informational constraints of practice, such as when using ball projection machines, has been shown to significantly affect movement coordination of skilled cricketers. To date, there has been no similar research on movement responses of developing batters, an important issue since ball projection machines are used heavily in cricket development programmes. Timing and coordination of young cricketers (n = 12, age = 15.6 ± 0.7 years) were analyzed during the forward defensive and forward drive strokes when facing a bowling machine and bowler (both with a delivery velocity of 28.14 ± 0.56 m s−1). Significant group performance differences were observed between the practice task constraints, with earlier initiation of the backswing, front foot movement, downswing, and front foot placement when facing the bowler compared to the bowling machine. Peak height of the backswing was higher when facing the bowler, along with a significantly larger step length. Altering the informational constraints of practice caused major changes to the information–movement couplings of developing cricketers. Data from this study were interpreted to emanate from differences in available specifying variables under the distinct practice task constraints. Considered with previous findings, results confirmed the need to ensure representative batting task constraints in practice, cautioning against an over-reliance on ball projection machines in cricket development programmes.

Condition-based prognosis of machine health

Modern machines are complex and often required to operate long hours to achieve production targets. The ability to detect symptoms of failure, hence, forecasting the remaining useful life of the machine is vital to prevent catastrophic failures. This is essential to reducing maintenance cost, operation downtime and safety hazard. Recent advances in condition monitoring technologies have given rise to a number of prognosis models that attempt to forecast machinery health based on either condition data or reliability data. In practice, failure condition trending data are seldom kept by industries and data that ended with a suspension are sometimes treated as failure data. This paper presents a novel approach of incorporating historical failure data and suspended condition trending data in the prognostic model. The proposed model consists of a FFNN whose training targets are asset survival probabilities estimated using a variation of Kaplan-Meier estimator and degradation-based failure PDF estimator. The output survival probabilities collectively form an estimated survival curve. The viability of the model was tested using a set of industry vibration data.

Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion

In the paper, the flow-shop scheduling problem with parallel machines at each stage (machine center) is studied. For each job its release and due date as well as a processing time for its each operation are given. The scheduling criterion consists of three parts: the total weighted earliness, the total weighted tardiness and the total weighted waiting time. The criterion takes into account the costs of storing semi-manufactured products in the course of production and ready-made products as well as penalties for not meeting the deadlines stated in the conditions of the contract with customer. To solve the problem, three constructive algorithms and three metaheuristics (based one Tabu Search and Simulated Annealing techniques) are developed and experimentally analyzed. All the proposed algorithms operate on the notion of so-called operation processing order, i.e. the order of operations on each machine. We show that the problem of schedule construction on the base of a given operation processing order can be reduced to the linear programming task. We also propose some approximation algorithm for schedule construction and show the conditions of its optimality.