A survey of parallel hybrid applications to the permutation flow shop scheduling problem and similar problems

Parallel algorithms have focused an increased interest due to advantages in computation time and quality of solutions when applied to industrial engineering problems. This communication is a survey and classification of works in the field of hybrid algorithms implemented in parallel and applied to combinatorial optimization problems similar to the to the permutation flowshop problem with the objective of minimizing the makespan, Fm|prmu|Cmax according to the Graham notation, the travelling salesman problem (TSP), the quadratic assignment problem (QAP) and, in general, those whose solution can be expressed as a permutation

Permutation Flow Shop via Simulated Annealing and NEH

Permutation Flow Shop Scheduling refers to the process of allocating operations of jobs to machines such that an operation starts to process on machine j only after the processing completes in j-1machine. At a time a machine can process only one operation and similarly a job can have only one operation processed at a time. Finding a schedule that minimizes the overall completion times for Permutation Flow Shop problems is NP-Hard if the number of machines is greater than 2. Sowe concentrates on approaches with approximate solutions that are good enough for the problems. Heuristics is one way to find the approximate solutions for a problem. For our thesis, we have used two heuristics - NEH and Simulated Annealing, both individually and in a combined form, to find the solutions for Permutation Flow Shop problems. We have compared NEH and Simulated Annealing algorithm based on result and execution time and also compared the combined algorithm with existing ones. Standard benchmarks are used to evaluate the performances of the implemented algorithm

A decision support system for integrated semi-centralised urban wastewater treatment systems

The importance of adequate water supply and sanitation infrastructure as cornerstones for the development of civilizations is undeniable. Although a strategy based on centralised infrastructure has proven to be successful in the past, in some circumstances such conventional systems are inappropriate for future needs. A Semi-centralised Urban Wastewater Treatment System (SUWWTS) may be considered a viable sustainable urban water management solution to promote water security. A SUWWTS merges regulations of traditional centralised systems with the concepts of close-loop and resource recovery of decentralised systems. However, research on the design and feasibility of implementing semi-centralised systems is in its infancy. This Thesis is a first attempt to articulate the complexity, to systematize and to automatize the design of a SUWWTS. Here we show a novel method, referred to as framework, for the development of SUWWTS with allowance for the socio-economic and geographic context of any urban area. To demonstrate the proposed framework a Decision Support System (DSS) was developed; its output is a recommended design comprised of several wastewater treatment plants, their respective technology, and their associated sewerage and reclaimed water distribution networks. The results demonstrate the capabilities and the usefulness of the DSS; it applies the design engineers’ subjective preferences, such as regional technological inclinations and implementation strategies. The results from a feasibility study on the city of Rio de Janeiro validated and demonstrated how the DSS can be used to assist decision-makers. This Thesis discusses the framework, the DSS and the demonstration case. Overall, it will hopefully help both other researchers and practitioners by contributing to the discussion on how to promote urban water security, to decrease urban areas’ dependency on ecosystem services whilst delivering better social welfare

Ein genetischer Algorithmus zur kostenorientierten Losgrößen- und Reihenfolgebestimmung bei getakteten Mehrproduktfließlinien

In vorliegender Arbeit wird das Problem der kostenorientierten Losgrößen- und Reihenfolgebestimmung bei getakteter Mehrproduktfließlinienfertigung untersucht. Das Problem kann als Teilproblem der Produktionsablaufplanung für den Fall der Serien- oder Sortenproduktion charakterisiert werden. Hinsichtlich des Produktionsvollzugs läßt sich die Serien- oder Sortenproduktion allgemein als Fertigungsform beschreiben, bei welcher mehrere verschiedenartige Erzeugnisse in gemeinsamer Produktion gefertigt werden, wobei der Übergang von einer Produktart auf eine andere Kosten verursacht. Das Produktionssystem der Fließlinienfertigung, bei der die zur Bearbeitung der verschiedenen Produkte notwendigen Betriebsmittel entsprechend der Bearbeitungsfolge an den Werkstücken räumlich angeordnet werden, bedingt nicht nur eine gemeinsame Produktion der betrachteten Produktarten, sondern auch, daß die Produktarten in Reihenfertigung produziert werden können. Eine getaktete Mehrproduktfließlinienfertigung ist darüber hinaus durch einen organisatorisch bedingten Zeitzwang charakterisiert, welcher besagt, daß die jeweils nächste Produkteinheit eines Loses die einzelnen Bearbeitungsstationen in einem bestimmten zeitlichen Intervall, der so genannten Taktzeit oder auch synonym Auflegeintervall, erreicht. Das Produktionssystem der getakteten Fließlinienfertigung wird auch als Fließbandfertigung bezeichnet. Die spezifischen Besonderheiten der losweisen Fließbandfertigung werden hinsichtlich des Bearbeitungs- und des Umrüstungsvollzugs in adäquater Weise berücksichtigt, das Losgrößen- und Reihenfolgeproblem verbal und formal beschrieben, sowie ein problemspezifischer Genetischer Algorithmus zur Lösung des Planungsproblems vorgestellt und experimentell untersucht

Sessenta anos de Shop Scheduling : uma revisão sistemática da literatura

Orientador : Prof. Dr. Cassius Tadeu ScarpinDissertação (mestrado) - Universidade Federal do Paraná, Setor de Tecnologia, Programa de Pós-Graduação em Engenharia de Produção. Defesa: Curitiba, 09/02/2017Inclui referências : f. 449-492Resumo: Desde o seminal artigo de Johnson em 1954, a Programação da Produção em Shop Scheduling tem se tornado uma área relevante dentro da Pesquisa Operacional e, atualmente, duzentos trabalhos tangentes à temática são publicados anualmente. Dentre os artigos aqui citados tem-se aqueles que se dedicam à apresentação e síntese do estado da arte desse assunto, intitulados artigos de revisão. Quando tais artigos são elaborados a partir de um conjunto objetivo de critérios, relativos à categorização dos artigos selecionados, tem-se a Revisão Sistemática da Literatura (RSL). O presente trabalho realiza uma RSL em Shop Scheduling, a partir da análise de cada ambiente fabril que o compõe. Fez-se o escrutínio de 560 artigos, à luz de um conjunto de métricas, que constitui a estrutura basilar da proposta de nova taxonomia do Shop Scheduling, complementar à notação de Graham, objetivo fulcral do presente trabalho. Além disso, utilizou-se uma representação em redes dos resultados obtidos em algumas das métricas empregadas, como a característica dos itens, algo outrora inaudito em estudos de revisão desse assunto. Ademais, outro ponto relevante desse estudo repousa na identificação de campos pouco explorados, de modo a colaborar com a pesquisa futura neste tomo. Palavras-chave: Shop Scheduling. Revisão Sistemática da Literatura. Taxonomia. Representação em Redes.Abstract: Since Johnson's seminal article in 1954, Shop Scheduling in Production Scheduling has become a relevant area within Operational Research, and currently hundreds of tangential works on the subject are published annually. Among the articles cited here are those dedicated to the presentation and synthesis of the state of the art of this subject, which are entitled review articles. When these articles are elaborated from an objective set of criteria, regarding the categorization of the selected articles, we have the Systematic Review of Literature (SLR). The present work performs a SLR in Shop Scheduling, based on the analysis of each manufacturing environment that composes it. There were 560 articles scrutinized based on a set of metrics, which is the basic structure of the proposed new Taxonomy of Shop Scheduling, complementary to Graham's notation, the main objective of this work. In addition to that a network representation of the results was obtained in some of the metrics used, such as the job characteristics, something previously unheard of in review studies of this subject. Moreover, another relevant point of this study lies in the identification of less explored fields in order to collaborate with future research in this matter. Keywords: Shop Scheduling. Systematic Literature Review. Taxonomy. Network Representation