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.

One year Master's thesis, Degree of master in Business and Economics, School ofBusiness and Economics at Linnaeus University, Management, 4FE10E SpringSemester 2014.Author: Johanna Björklund and Sarah Gustafsson.Mentor: Magnus Forslund.Title: Lean in the public sector - Potential barriers to a long-term Lean work.Background: Organizational changes are something that is constantly done inorganizations, and in the last decade, there has arisen a plethora of different changemodels. A reorganization that is popular among companies today is Lean. Lean is aconcept that was developed within the Japanese automotive industry, but has evolvedfrom the Japanese shop floor and is now a concept that can be found in, for example,several Swedish municipalities.Purpose: The purpose of this study was to create an understanding of why the conceptLean may have difficulty getting a hold in the in the long term.Methodology: The study was done with a qualitative research approach and through anabductive approach. As we intended to create an understanding, of what potentialbarriers that may affect that a Lean work, in some cases, does not become a long-termcondition, it seemed natural to choose a hermeneutic approach to knowledge. Theempirical data collected via individual unstructured interviews, through a groupinterview, and by non-participant observations.

Ett av dagens stora problem i Stockholms tunnelbana är trängsel. Initiativet till projektet kommer från undertecknad då den upplevtträngsel som en av tunnelbanans stora framtida problem. En lång och spännande resa tog sin början..

The aim of this essey was to find out what kind of help problem gamblers can get at social service offices in the region Västra Götaland in Sweden. We also examined the knowledge regarding gambling problems at social sevice offices and who the head of the social service offices regarded having the responsibility for the question of helping problem gamblers. As a last question we wanted to know if the size of the population in the community had an impact on these questions. Central questions in our essey asked are:How much help does the social service offices in the region Väsra Götaland offer problem gamblers? Who has the responsabilety to help problem gamblers according to social service offices?What knowledge does the social service offices have concerning problem gambling?Does the population of the community have an impact on theese questions?This is a quantitative study made as a webbservey to the head of the social service offices in the region Västra Götaland.

Aim: The aim of this study was to examine health professionals´ experiences of giving advice regarding sleep to parents of infants and to perform and evaluate an intervention in the form of introducing information about the sleep of infants.Method: The study was designed as an intervention study with a qualitative approach where data was collected from two focus groups in the form of interviews. The intervention consisted of the information material Sugen på sömn. There were five participants whom three of them participated in the second interview. The interviews were processed by content analysis.Results: Health professionals´ experience of giving advice on sleep was summarized in three themes. The experiences of giving advice in interaction with parents, health professional themselves experienced the power to influence the parents with the advice they gave, while the parents' previous experience and knowledge impacted on how the advice came into practice.

The aim of this text is to study how sectional managers in the care of the elderly work so as to promote basic human values. Semi-structured interviews generated qualitative data from five sectional managers. A hermeneutical approach was applied for interpreting the interviews. The result shows that the respondents are conscious of the fact that it takes a lot of long term work before a change in current procedures will happen. Also, the common everyday principles of work and basic values will continue to be part of the care of the elderly.

?The management of innovation is inherently difficult and risky, most new technologies fail to be translated into products and services, and most new products and services are not commercial successes. In short, innovation can enhance competitiveness, but it requires a different set of management knowledge and skills from those of everyday business administration? (Bessant et al. 2005 p.

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.

Aim: The aim of this study was to examine health professionals´ experiences of giving advice regarding sleep to parents of infants and to perform and evaluate an intervention in the form of introducing information about the sleep of infants.Method: The study was designed as an intervention study with a qualitative approach where data was collected from two focus groups in the form of interviews. The intervention consisted of the information material Sugen på sömn. There were five participants whom three of them participated in the second interview. The interviews were processed by content analysis.Results: Health professionals´ experience of giving advice on sleep was summarized in three themes. The experiences of giving advice in interaction with parents, health professional themselves experienced the power to influence the parents with the advice they gave, while the parents' previous experience and knowledge impacted on how the advice came into practice.

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.