949 resultados para Multi-purpose -machines job shop


Relevância:

100.00% 100.00%

Publicador:

Resumo:

Assembly job shop scheduling problem (AJSP) is one of the most complicated combinatorial optimization problem that involves simultaneously scheduling the processing and assembly operations of complex structured products. The problem becomes even more complicated if a combination of two or more optimization criteria is considered. This thesis addresses an assembly job shop scheduling problem with multiple objectives. The objectives considered are to simultaneously minimizing makespan and total tardiness. In this thesis, two approaches viz., weighted approach and Pareto approach are used for solving the problem. However, it is quite difficult to achieve an optimal solution to this problem with traditional optimization approaches owing to the high computational complexity. Two metaheuristic techniques namely, genetic algorithm and tabu search are investigated in this thesis for solving the multiobjective assembly job shop scheduling problems. Three algorithms based on the two metaheuristic techniques for weighted approach and Pareto approach are proposed for the multi-objective assembly job shop scheduling problem (MOAJSP). A new pairing mechanism is developed for crossover operation in genetic algorithm which leads to improved solutions and faster convergence. The performances of the proposed algorithms are evaluated through a set of test problems and the results are reported. The results reveal that the proposed algorithms based on weighted approach are feasible and effective for solving MOAJSP instances according to the weight assigned to each objective criterion and the proposed algorithms based on Pareto approach are capable of producing a number of good Pareto optimal scheduling plans for MOAJSP instances.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Atualmente o sistema produtivo do tipo job shop é muito comum nas PMEs (Pequenas e Médias Empresas). Estas empresas trabalham por encomenda. Produzem grande variedade de modelos, e em pequenas quantidades. Os prazos de entrega são um fator de elevada importância, pois os clientes exigem um produto de qualidade no tempo certo. O presente trabalho, pretende criar uma ferramenta de programação da produção para a secção da costura, usando dados reais da empresa, que tem uma implantação do tipo job shop com máquinas multi-operação (Multi-Purpose -Machines Job Shop). No final, são reunidas as principais conclusões e perspetivados futuros desenvolvimentos. Os resultados obtidos comprovam que o algoritmo desenvolvido, com base no algoritmo de Giffler & Thompson, consegue obter com grande precisão e de forma rápida o escalonamento / balanceamento da secção da costura. Com a ferramenta criada, a empresa otimiza a programação da secção da costura e fornece informação importante á gestão da produção, possibilitando uma melhoria do planeamento da empresa.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Esta dissertação apresenta um estudo sobre os problemas de sequenciamento de tarefas de produção do tipo job shop scheduling. Os problemas de sequenciamento de tarefas de produção pretendem encontrar a melhor sequência para o processamento de uma lista de tarefas, o instante de início e término de cada tarefa e a afetação de máquinas para as tarefas. Entre estes, encontram-se os problemas com máquinas paralelas, os problemas job shop e flow shop. As medidas de desempenho mais comuns são o makespan (instante de término da execução de todas as tarefas), o tempo de fluxo total, a soma dos atrasos (tardiness), o atraso máximo, o número de tarefas que são completadas após a data limite, entre outros. Num problema do tipo job shop, as tarefas (jobs) consistem num conjunto de operações que têm de ser executadas numa máquina pré-determinada, obedecendo a um determinado sequenciamento com tempos pré-definidos. Estes ambientes permitem diferentes cenários de sequenciamento das tarefas. Normalmente, não são permitidas interrupções no processamento das tarefas (preemption) e pode ainda ser necessário considerar tempos de preparação dependentes da sequência (sequence dependent setup times) ou atribuir pesos (prioridades) diferentes em função da importância da tarefa ou do cliente. Pretende-se o estudo dos modelos matemáticos existentes para várias variantes dos problemas de sequenciamento de tarefas do tipo job shop e a comparação dos resultados das diversas medidas de desempenho da produção. Este trabalho contribui para demonstrar a importância que um bom sequenciamento da produção pode ter na sua eficiência e consequente impacto financeiro.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

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.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This paper describes a rainfall simulator developed for field and laboratory studies that gives great flexibility in plot size covered, that is highly portable and able to be used on steep slopes, and that is economical in its water use. The simulator uses Veejet 80100 nozzles mounted on a manifold, with the nozzles controlled to sweep to and from across a plot width of 1.5 m. Effective rainfall intensity is controlled by the frequency with which the nozzles sweep. Spatial uniformity of rainfall on the plots is high, with coefficients of variation (CV) on the body of the plot being 8-10%. Use of the simulator for erosion and infiltration measurements is discussed.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This work was focused on a multi-purpose estuarine environment (river Sado estuary, SW Portugal) around which a number of activities (e.g., fishing, farming, heavy industry, tourism and recreational activities) coexist with urban centres with a total of about 200 000 inhabitants. Based on previous knowledge of the hazardous chemicals within the ecosystem and their potential toxicity to benthic species, this project intended to evaluate the impact of estuarine contaminants on the human and ecosystem health. An integrative methodology based on epidemiological, analytical and biological data and comprising several lines of evidence, namely, human contamination pathways, human health effects, consumption of local produce, estuarine sediments, wells and soils contamination, effects on commercial benthic organisms, and genotoxic potential of sediments, was used. The epidemiological survey confirmed the occurrence of direct and indirect (through food chain) exposure of the local population to estuarine contaminants. Furthermore, the complex mixture of contaminants (e.g., metals, pesticides, polycyclic aromatic hydrocarbons) trapped in the estuary sediments was toxic to human liver cells exposed in vitro, causing cell death, oxidative stress and genotoxic effects that might constitute a risk factor for the development of chronic-degenerative diseases, on the long term. Finally, the integration of data from several endpoints indicated that the estuary is moderately impacted by toxicants that affect also the aquatic biota. Nevertheless, the human health risk can only be correctly assessed through a biomonitoring study including the quantification of contaminants (or metabolites) in biological fluids as well as biomarkers of early biological effects (e.g., biochemical, genetic and omics-based endpoints) and genetic susceptibility in the target population. Data should be supported by a detailed survey to assess the impact of the contaminated seafood and local farm products consumption on human health and, particularly, on metabolic diseases or cancer development.