Pesulaitteen horisontaalisen harjan nostomekanismin kehittäminen

Työssä on pyritty löytämään ratkaisuvaihtoehtoja pesulaitteen horisontaalisen harjan nostomekanismin parantamiseksi. Nostomekanismia pyrittiin kehittämään vähemmän huoltoa vaativaksi, toimintavarmemmaksi sekä kustannuksiltaan halvemmaksi. Uusia vaihtoehtoja mekanismille pyrittiin löytämään järjestelmällisen ideoinnin avulla, käyttäen hyödyksi alan kirjallisuutta, käytössä olevia pesulaitteita sekä jokapäiväisessä elämässä eteen tulleita havaintoja. Korroosiota aiheuttavat olosuhteet, horisontaalisen harjakokoonpanon pitkä liikerata sekä paino asettavat erityisvaatimuksia uudelle mekanismille. Lisäksi mekanismin täytyy liikuttaa harjaa vertikaalisessa suunnassa vakiona pysyvällä nopeudella. Valittuja ratkaisuvaihtoehtoja tarkasteltiin pistearvioinnin avulla ennen jatkokehittelyn aloittamista. Alustavassa komponenttien mitoituksessa pyrittiin mekanismin komponenteille löytämään oikea valmistusmateriaali sekä komponenttien geometriset mitat. Mekanismin valmistuskustannuksia eri valmistusmenetelmien kesken kartoitettiin yhteydenotoilla eri konepajojen kanssa. Alustavien kustannuslaskelmien perusteella jatkokehittelyyn otetun mekanismin kustannukset on 70 prosenttia pienemmät kuin nykyisen mekanismin kustannukset. Osien vähyys sekä mekanismin yksinkertaisuus lisää nostomekanismin luotettavuutta sekä vähentää tarvittavia huoltotoimenpiteitä.

Disseny d’un programa que assisteix en la seqüenciació de peces de taller basats en mètodes heurístics

El GREP (grup de recerca de producte, procés i producció) de la UdG actualment disposa d’una eina informàtica desenvolupada en un PFC del 2003 que li permet fer la seqüenciació de la producció d’un taller mecànic amb un màxim de cinc productes, un nombre definit de possibles rutes de fabricació per a cada producte i tres màquines. Aquesta eina és molt resolutiva per a aquests casos, ja que estudia totes les possibilitats i les comprova una per una. No obstant aquest fet presenta una sèrie de limitacions com són el temps d’execució doncs al comprovar totes les seqüències té un elevat cost computacional i la rigidesa del sistema doncs no ens permet seqüenciar més productes ni més màquines. Per tal de donar solució a aquest problema es planteja generar una nova eina informàtica a partir de l’actual però que permeti seqüenciar més peces sense ocupar tanta memòria per així implementar-hi futures millores com el temps de preparació etc... Per a desenvolupar l’eina informàtica s’han utilitzat mètodes heurístics, concretament dos que són: algoritmes genètics i cerca TABU. Aquests mètodes destaquen perquè no busquen totes les combinacions possibles sinó que estudien una sèrie de combinacions i utilitzant mètodes de creuament i generació d’entorns busquen una solució

O canteiro experimental e o ensino

Não disponível

Operator, organizational, and direct support maintenance manual, including repair parts and special tools lists : welding shop, trailer mounted, Libby model unassigned, FSN 3431-935-7821.

"February 1972."

Operator, organizational, direct support and general support maintenance manual : shop equipment, contact maintenance, truck mounted (Southwest model SECM), serial no. range SECM 1001 thru SECM 2532, NSN 4940-01-016-2262.

Includes index.

Operator's, organizational, direct support and general support maintenance manual : electronic shop, transportable, AN/TSM-126A.

"1 May 1981."

Scheduling batches with sequential job processing for two-machine flow and open shops

In this paper, we study a problem of scheduling and batching on two machines in a flow-shop and open-shop environment. Each machine processes operations in batches, and the processing time of a batch is the sum of the processing times of the operations in that batch. A setup time, which depends only on the machine, is required before a batch is processed on a machine, and all jobs in a batch remain at the machine until the entire batch is processed. The aim is to make batching and sequencing decisions, which specify a partition of the jobs into batches on each machine, and a processing order of the batches on each machine, respectively, so that the makespan is minimized. The flow-shop problem is shown to be strongly NP-hard. We demonstrate that there is an optimal solution with the same batches on the two machines; we refer to these as consistent batches. A heuristic is developed that selects the best schedule among several with one, two, or three consistent batches, and is shown to have a worst-case performance ratio of 4/3. For the open-shop, we show that the problem is NP-hard in the ordinary sense. By proving the existence of an optimal solution with one, two or three consistent batches, a close relationship is established with the problem of scheduling two or three identical parallel machines to minimize the makespan. This allows a pseudo-polynomial algorithm to be derived, and various heuristic methods to be suggested.

Manual of instruction in forge and machine work, with figured drawings of methods and exercises used in the Fowler shops of Kansas University.

Mode of access: Internet.

Asynchronous teams for joint lot-sizing and scheduling problem in flow shops

The integrated production scheduling and lot-sizing problem in a flow shop environment consists of establishing production lot sizes and allocating machines to process them within a planning horizon in a production line with machines arranged in series. The problem considers that demands must be met without backlogging, the capacity of the machines must be respected, and machine setups are sequence-dependent and preserved between periods of the planning horizon. The objective is to determine a production schedule to minimise the setup, production and inventory costs. A mathematical model from the literature is presented, as well as procedures for obtaining feasible solutions. However, some of the procedures have difficulty in obtaining feasible solutions for large-sized problem instances. In addition, we address the problem using different versions of the Asynchronous Team (A-Team) approach. The procedures were compared with literature heuristics based on Mixed Integer Programming. The proposed A-Team procedures outperformed the literature heuristics, especially for large instances. The developed methodologies and the results obtained are presented.