Reducing mean flow time in permutation flow shop

This paper deals with the traditional permutation flow shop scheduling problem with the objective of minimizing mean flowtime, therefore reducing in-process inventory. A new heuristic method is proposed for the scheduling problem solution. The proposed heuristic is compared with the best one considered in the literature. Experimental results show that the new heuristic provides better solutions regarding both the solution quality and computational effort.

Sistema múltiplo de apoio à decisão para a programação de sistemas do tipo Job-Shop

Mestrado em Engenharia Electrotécnica e de Computadores

New Shop Floor Control Approaches for Virtual Enterprises

The virtual enterprise paradigm seems a fit response to face market instability and the volatile nature of business opportunities increasing enterprise’s interest in similar forms of networked organisations. The dynamic environment of a virtual enterprise requires that partners in the consortium own reconfigurable shop floors. This paper presents new approaches to shop floor control that meet the requirements of the new industrial paradigms and argues on work re-organization at shop floor level.

A genetic algorithm for the job shop scheduling with a new local search using Monte Carlo method

This paper presents a methodology for applying scheduling algorithms using Monte Carlo simulation. The methodology is based on a decision support system (DSS). The proposed methodology combines a genetic algorithm with a new local search using Monte Carlo Method. The methodology is applied to the job shop scheduling problem (JSSP). The JSSP is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. The methodology is tested on a set of standard instances taken from the literature and compared with others. The computation results validate the effectiveness of the proposed methodology. The DSS developed can be utilized in a common industrial or construction environment.

Coalition based approach for shop floor agility – a multiagent approach

Dissertation submitted for a PhD degree in Electrical Engineering, speciality of Robotics and Integrated Manufacturing from the Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia

An optimization approach for the job shop scheduling problem

This paper presents an optimization approach for the job shop scheduling problem (JSSP). The JSSP is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. The proposed approach is based on a genetic algorithm technique. The scheduling rules such as SPT and MWKR are integrated into the process of genetic evolution. The chromosome representation of the problem is based on random keys. The schedules are constructed using a priority rule in which the priorities and delay times of the operations are defined by the genetic algorithm. Schedules are constructed using a procedure that generates parameterized active schedules. After a schedule is obtained a local search heuristic is applied to improve the solution. The approach is tested on a set of standard instances taken from the literature and compared with other approaches. The computation results validate the effectiveness of the proposed approach.

Estudo e análise do sequenciamento de tarefas de produção: job shop scheduling

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.

Aircraft Engines Maintenance Costs and Reliability: An Appraisal of the Decision Process to Remove an Engine for a Shop Visit Aiming at Minimum Maintenance Unit Cost

Dissertação apresentada como requisito parcial para obtenção do grau de Mestre em Estatística e Gestão de Informação.

Corporate social responsibility and its effect on image and reputation: The case of L’Oréal and its acquisition of The Body Shop

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics

Evaluation of the impact of L’Oréal’s acquisition of The Body Shop on both brands

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics

A multiagent based shop floor transportation system simulator

Dissertação para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores

Service-oriented infrastructure to support the control, monitoring and management of a shop floor system

Dissertação para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores

L'Oreal acquisition policy: The Body Shop case study

The Work Project I present focuses on the analysis of L’Oréal acquisition policy, trying to outline if the M&A deals it has led over the last 14 years have succeeded in creating value. By replicating the model proposed by Todd Hazelkorn, Marc Zenner and Anil Shivdasani in their paper “Creating Value with Mergers and Acquisitions”, I analyzed the 29 M&A deals that L’Oréal has led worldwide, understanding the common factors able to explain the success of such transactions. Further, I focused on The Body Shop case study, a highly criticized and controversial acquisition that has proved to be profitable and able to create value.

A taxonomy for the flexible job shop scheduling problem

This chapter aims at developing a taxonomic framework to classify the studies on the flexible job shop scheduling problem (FJSP). The FJSP is a generalization of the classical job shop scheduling problem (JSP), which is one of the oldest NP-hard problems. Although various solution methodologies have been developed to obtain good solutions in reasonable time for FSJPs with different objective functions and constraints, no study which systematically reviews the FJSP literature has been encountered. In the proposed taxonomy, the type of study, type of problem, objective, methodology, data characteristics, and benchmarking are the main categories. In order to verify the proposed taxonomy, a variety of papers from the literature are classified. Using this classification, several inferences are drawn and gaps in the FJSP literature are specified. With the proposed taxonomy, the aim is to develop a framework for a broad view of the FJSP literature and construct a basis for future studies.

From the vendor in the hemp shop to the dealer in the alleyway? A comparison of the sources of supply of cannabis in a time of 'de-normalising' cannabis use.

Objectives: After several years of increasing 'normalisation' of cannabis use in Switzerland at the beginning of the new millennium, a reversed tendency, marked among others by a more stringent law-enforcement, set in. The presentation examines the question of where adolescents and young adults obtained cannabis, within the context of this societal change. In addition, it compares the sources of supply for cannabis with those found in studies of other European countries. Methods: Analyses are based on data from the Swiss Cannabis Monitoring Study. As part of this longitudinal, representative population survey, more than 5000 adolescents and young adults were interviewed by telephone on the topic of cannabis. Within the total sample, 593 (2004) or 554 (2007) respectively, current cannabis users replied to the questions on sources of supply. Changes in law-enforcement and societal climate concerning cannabis are assessed based on relevant literature, media reports and parliamentary discussions. Results: Whereas 22% of cannabis users stated in 2004 that they bought their cannabis from vendors in hemp shops, this proportion drastically decreased to 6% three years later. At the same time, cannabis was obtained increasingly from friends, while the proportion of users who purchased cannabis from dealers in the alleyway, more than doubled from 6% (2004) to 13% (2007). It was male cannabis users, and in particular, young adult and frequent users, who have moved into the alleyways. Generally, users who buy cannabis in the alleyway show more cannabis-related problems than those who mainly name other sources of supply, even when adjusted for sex, age and frequency of cannabis use. Discussion: Possible consequences of these changes in cannabis supply, like the risk of merging a previously cannabis-only market with other 'harder' drugs markets, are discussed.