Teachers manual and answer book for suggested unit course in blue print reading for beginners in machine shop practice.

Mode of access: Internet.

Suggested unit course in drill press work for beginners in machine shop practice ...

Prepared by Ewald L. Witzel and C. Thomas Olivo. cf. 5th prelim. leaf.

Cyclopedia of mechanical engineering : a general reference work on machine shop practice, tool making, forging, pattern making, foundry, work, metallurgy, steam boilers and engines, gas producers, gas engines, automobiles, elevators, refrigeration, sheet metal work, mechanical drawing, machine design, etc;

Mode of access: Internet.

Suggested unit course in heat treatment of metals for beginners in machine shop practice ...

"Prepared in cooperation with the United States Office of education."--2d prelim. leaf.

Suggested job sheet units for beginners in machine shop practice.

Mode of access: Internet.

Machine-shop technology.

Mode of access: Internet.

Engineering shop practice ...

Mode of access: Internet.

Machine shop series.

Mode of access: Internet.

Machine shop notes ... For the use of studnets in shopwork; Massachusetts institute of technology.

Mode of access: Internet.

Modern American lathe practice; a new complete and practical work on the "king of machine shop tools," the American lathe. Giving its origin and development. Its design. Its various types as manufactured by different builders ... etc.

Mode of access: Internet.

Text-book of advanced machine work, prepared for students in technical, manual training and trade schools, and for the apprentice and the machinist in the shop,

In 16 sections, each section separately paged, with the section number in heavy face type prefixed to the page numbers.

Shop and foundry practice,

Mode of access: Internet.

Scheduling batches with simultaneous job processing for two-machine shop problems

We consider the problem of scheduling independent jobs on two machines in an open shop, a job shop and a flow shop environment. Both machines are batching machines, which means that several operations can be combined into a batch and processed simultaneously on a machine. The batch processing time is the maximum processing time of operations in the batch, and all operations in a batch complete at the same time. Such a situation may occur, for instance, during the final testing stage of circuit board manufacturing, where burn-in operations are performed in ovens. We consider cases in which there is no restriction on the size of a batch on a machine, and in which a machine can process only a bounded number of operations in one batch. For most of the possible combinations of restrictions, we establish the complexity status of the problem.

Three-machine shop scheduling with partially ordered processing routes

This paper considers the problem of sequencing n jobs in a three-machine shop with the objective of minimising the maximum completion time. The shop consists of three machines, M1,M2 and M_{3}. A job is first processed on M1 and then is assigned either the route (M2,M_{3}) or the route (M_{3},M2). Thus, for our model the processing route is given by a partial order of machines, as opposed to the linear order of machines for a job shop, or to an arbitrary sequence of machines for an open shop. The main result is on O(nlog n) time heuristic, which generates a schedule with the makespan that is at most 5/3 times the optimum value.

Two-Machine Shop Scheduling with an Uncapacitated Interstage Transporter

In this paper we study the two-machine flow shop and open shop problems to minimize the makespan with a single interstage transporter that may carry any number of jobs between the machines at a time. For each of these problems we present a best possible approximation algorithm within a class of schedules with at most two shipments. As a by-product of this research, for the problem of minimizing the makespan on parallel identical machines we analyze the ratio of the makespan for a non-preemptive schedule over the makespan of a preemptive schedule.