The development of productivity in the construction industry has long been at a steady state compared to the manufacturing industry. Studies have shown that, amongst other things, waste on construction sites can reach up to one third of the total production cost. This has been observed from different aspects, and change is forthcoming.This thesis aims to provide a foundation for an increased productivity at production sites of building bridges. It is primarily based on a field study at Skanska, at a bridge construction site near Grängesberg. Via continuous interviews with the whole production crew, construction workers and management, information on interference and possibilities of improvement at the work site has been documented.

This paper presents the creation of a strengthening visual profile for StretchFlex UF. The project consists of an external as well as an internal part. The external part is on the order of the company StretchFlex. The company is created under the education concept by the name of Ung Företagsverksamhet (Young Entrepreneurship) and has passed on to the Swedish Championships in Young Entrepreneurship at the Stockholm International Fairs. Of that we have been commissioned to develop an updated logotype for the company, for the current does not keep proper quality according to the client.

This report describes the work of developing a specification of requirements for Waste Heat Recovery Units. The main part of the paper describes how the work with the specification of requirements has been performed. One specific question to be answered is:What are the customer?s demands in case of properties for the Waste Heat Recovery Units and how is that information collected as an order documentation to suit the business area Oil & Gas?The report begins with a description of the assignment and continues with the aim and background. A theoretical part describes the different areas and methods that have been important during the process.

The purpose of my study is to determine students? attitudes to the Natural Science subject. I want to contribute to scientific discourse about different learning styles that can respond to childrens? requirements in teaching as well as to determine the student?s experience of learning styles. The studies were carried out at an upper secondary school in Stockholm (spring term 2011) for three different classes.

This study concerns how organizations manage various problematic areaswhen implementeing Business Intelligence and experiences from BusinessIntelligence project failures on management level. In order to highlightthese questions, we have carried out interviews with four organizationswhich have great experience in working with Business Intelligence on adaily basis.The result of the study shows that all organizations deal with difficultiesregarding cost-benefit issues and justification concerning BusinessIntelligence investments. The result also showed that the organizationsfaced difficulties with integration concerning time and cost. Documentingand securing support systems presented different attitudes between theorganizations, primary in the question about sub complements to BusinessIntelligence and in the way that they were documented. In the discourse oflegal issues and privacy the majority of the organizations chose not to storepersonal information relative to legal security demands.

 We have chosen to write our thesis within a transport company. The work was carried out at DHL activities in Uppsala. DHL is one of the leading transport companies worldwide. Our interest lies in more efficient and advanced transportation and terminals, as globalization and new trends require effective solutions.The aim of our work is to explain the need for information technology applications in road haulage and associated terminal operations. Furthermore, we analyses terminal and applied information technology.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The aim of this Master's thesis is to study whether bibliometrics can serve as a method to analyse the humanities.To investigate this a literature study was conducted that examined previous studies concerning bibliometrics and the humanities. Furthermore a bibliometric analysis of comparative literature was carried out. These research findings were then further examined through the perspective of theories on intellectual and social organization of the scienceThe bibliometrical study includes 38 literature journals (11 855 articles in total) which were downloaded from ISI's Web of Science. The material was analysed by using co-citation analysis and co-word analysis. The results of the study are presented in five co-citation maps.