TITLE

Job Shop Directory

PUB. DATE
October 2007
SOURCE
Industrial Laser Solutions;Oct2007, Vol. 22 Issue 10, p58
SOURCE TYPE
Periodical
DOC. TYPE
Directory
ABSTRACT
A directory for job shop industries in the U.S. is presented.
ACCESSION #
27253489

 

Related Articles

  • Fitting it together--shop floor control.  // Wood & Wood Products;Nov95, Vol. 100 Issue 12, p48 

    Focuses on the issue of production control systems in a woodworking job shop. Cutting down on paperwork; Benefits of a dynamically created bill of material.

  • Facilitating change: Three tales of turbulence bested. Taucher, Ben // Journal for Quality & Participation;Mar97, Vol. 20 Issue 2, p42 

    Opinion. Presents the writer's experiences in organizing workshops for three different companies. Detailed information on issues discussed at each workshop.

  • Should you have a product line? Albert, Mark // Modern Machine Shop;Apr97, Vol. 69 Issue 11, p8 

    Talks about job shops in the United States which provide the usual services, and also manufacture and sell a product. Filling of gaps in machine tool technology; Takeover of products abandoned by customers; Wider range of manufacturing capabilities offered by job shops.

  • Distributor Know-how Boosts Job Shop Productivity.  // Gases & Welding Distributor;Mar/Apr2002, Vol. 46 Issue 2, p37 

    Discusses the benefits of using preassembled robot welding cells to increase job shop productivity. Integration of shielding gas delivery system; Increase in return on investment; Minimal operator intervention.

  • Preemptive job-shop scheduling problems with a fixed number of jobs. Brucker, Peter; Kravchenko, Svetlana A.; Sotskov, Yuri N. // Mathematical Methods of Operations Research;1999, Vol. 49 Issue 1, p41 

    Abstract. It is shown that the two machine preemptive job-shop problem with mean flow-time or makespan objective function and three jobs is NP-hard. This contrasts the fact that the nonpreemptive versions of these problems are polynomially solvable if the number of jobs is arbitrary but fixed....

  • Job Shop Scheduling by Local Search. Vaessens, R.J.M.; Aarts, E.H.L.; Lenstra, J.K. // INFORMS Journal on Computing;Summer96, Vol. 8 Issue 3, p302 

    Evaluates solution methods for the job shop scheduling problem with emphasis on local search. Deterministic and randomized local search methods; Constructive and iterative algorithms.

  • Free Advice, and Worth Every Penny. Nofel, Pete // MAN: Modern Applications News;Aug2007, Vol. 41 Issue 8, p6 

    The article discusses various reports published within the issue including an article by Dave Sterling on problems of people in job shops and another by Norman Bleier on controlling interests.

  • Implicit versus explicit knowledge representation in a job-shop scheduling decision support system. Geneste, Laurent; Garbot, Bernard // International Journal of Expert Systems;1997, Vol. 10 Issue 1, p37 

    Discusses job-shop scheduling which is considered to be a problem in manufacturing firms. What the choice of a relevant scheduling strategy is based upon; Complexity of scheduling of workshops; Definition of the scheduling of a set of tasks in a production system; Aim of static scheduling;...

  • UNIT EXECUTION TIME SHOP PROBLEMS. Gonzalez, Teofilo // Mathematics of Operations Research;Feb82, Vol. 7 Issue 1, p57 

    The problem of preemptively (and nonpreemptively) scheduling a set of n independent jobs on an m machine open shop, flow shop or job shop is studied, it is shown that the problem of constructing optimal mean finishing time preemptive and nonpreemptive schedules is NPhard. These problems are not...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics