TITLE

Terminating Wires Efficiently

AUTHOR(S)
Boyd, Rob
PUB. DATE
May 2008
SOURCE
Assembly;May2008, Vol. 51 Issue 5, p48
SOURCE TYPE
Periodical
DOC. TYPE
Article
ABSTRACT
The article discusses how to terminate wires efficiently using automatic wire termination machines. It emphasizes the importance of planning ahead to minimize changeover times. It mentions that having a dedicated tooling area where applicators are set up and inspected prior to use can reduce downtime. It notes that barreled wire is preferred over spooled ones as the former has less curl, resulting to less impact on feeding and termination quality.
ACCESSION #
33517992

 

Related Articles

  • Single-Machine Scheduling Problems with Generalized Preemption. Agnetis, Alessandro; Alfieri, Arianna; Nicosia, Gaia // INFORMS Journal on Computing;Winter2009, Vol. 21 Issue 1, p1 

    We address a class of single-machine, hard scheduling problems with the objective of minimizing the maximum tardiness. The jobs can be preempted, but whenever a job is started or resumed, there is a recovery interval affecting its progress. Such a feature is motivated by certain application...

  • The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling. Picard, Jean-claude; Queyranne, Maurice // Operations Research;Jan/Feb78, Vol. 26 Issue 1, p86 

    The time-dependent traveling salesman problem may be stated as a scheduling problem in which n jobs have to be processed at minimum cost on a single machine. The set-up cost associated with each job depends not only on the job that precedes it, but also on its position (time) in the sequence....

  • Preemption in single machine earliness/tardiness scheduling. Kerem Bülbül; Philip Kaminsky // Journal of Scheduling;Oct2007, Vol. 10 Issue 4/5, p271 

    Abstract   We consider a single machine earliness/tardiness scheduling problem with general weights, ready times and due dates. Our solution approach is based on a time-indexed preemptive relaxation of the problem. For the objective function of this relaxation, we characterize...

  • Rapid Setup and Changeover. Rowland, Robert // SMT: Surface Mount Technology;Jul2003, Vol. 17 Issue 7, p18 

    Presents viewpoints of a person in rating of changeover time capability. Need for more improvements in instructions and programs; Recommendations to establish a sense of urgency; Use of preventive maintenance techniques.

  • Single-machine scheduling with a sum-of-processing-time based learning effect and deteriorating jobs. Li-Yan Wang; Ji-Bo Wang; Dan Wang; Na Yin; Xue Huang; En-Min Feng // International Journal of Advanced Manufacturing Technology;Mar2010, Vol. 45 Issue 3/4, p336 

    The paper deals with the single-machine scheduling problem with a sum-of-processing-time- based learning effect and deteriorating jobs. By the effects of sum-of-processing-time-based learning and deterioration, we mean that the processing time of a job is defined by function of its starting time...

  • Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem. Dell'Amico, Mauro; Iori, Manuel; Martello, Silvano; Monaci, Michele // INFORMS Journal on Computing;Summer2008, Vol. 20 Issue 3, p333 

    Given a set of jobs with associated processing times, and a set of identical machines, each of which can process at most one job at a time, the parallel machine scheduling problem is to assign each job to exactly one machine so as to minimize the maximum completion time of a job. The problem is...

  • A reinforcement learning approach for developing routing policies in multi-agent production scheduling. Wang, Yi-Chi; Usher, John // International Journal of Advanced Manufacturing Technology;Jun2007, Vol. 33 Issue 3/4, p323 

    Most recent research studies on agent-based production scheduling have focused on developing negotiation schema for agent cooperation. However, successful implementation of agent-based approaches not only relies on the cooperation among the agents, but the individual agent�s intelligence...

  • Hybrid metaheuristics for unrelated parallel machine scheduling with sequence-dependent setup times. Chun-Lung Chen; Chuen-Lung Chen // International Journal of Advanced Manufacturing Technology;Oct2009, Vol. 43 Issue 1/2, p161 

    This paper proposes several hybrid metaheuristics for the unrelated parallel-machine scheduling problem with sequence-dependent setup times given the objective of minimizing the weighted number of tardy jobs. The metaheuristics begin with effective initial solution generators to generate initial...

  • Optimization of setup times in the furniture industry. Gawroński, Tomasz // Annals of Operations Research;Dec2012, Vol. 201 Issue 1, p169 

    The aim of this paper is to develop a scheduling policy oriented towards minimizing setup times in the made-to-order furniture industry. The task is treated as a dynamic job shop scheduling problem, with the exception that customers' orders collected over a specified period of time are combined...

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