The Employment Protection Act (1982:80) provides provisions regarding priority of re-employment. A few cases where these provisions have been subject to examination, have been discussed thoroughly in SOU 2014:55. In these cases the Labour Court has identified the question whether the provisions regarding priority of re-employment can be subject to circumvention in an illegal manner. The Labour Court has stated that it would be incompatible with the sense of justice if the provisions could be circumvented to the detriment of employees entitled to priority of re-employment. However, the Labour Court stated that certain conditions have to be imposed for the assessment.After analysis of the conditions, it is established that they are deemed to cause major difficulties for employees, why it is held that the purpose and the function of the conditions are not achieved. The purpose of the essay is therefore to investigate whether the application of the conditions imposed by the Labour Court, need to undergo modifications to meet the underlying purpose of the creation of the conditions.By reason of the difficulty with the conditions, the essay provides three different amendments in which two of the amendments are ascertained to not contribute to such an improvement that they should actually be applied.

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: To investigate how three of the biggest political parties in Sweden made use of socialmedia in the election campaign in 2010, and to get a picture of how the parties perceive therole of social media in political communication today and in the future.Method: The research is conducted through personal interviews and qualitative textualanalysis.Theory: The theory that the study is based on is Habermas theory of the public sphereMain results: Social media is today an excellent channel for communication and informationbetween politicians and voters, and they will probably become increasingly important inpolitical communication in the future. So far, they are only an addition to the traditional mediaand are in no way substituted for them. Internet and some social media is an excellent forumfor political debate and opinion-former..

AbstractThe Swedish agricultural organisation, LRF, stands in front of many changes and the work with the changes in the organisation has caused some conflicts at the top. Is it like Michels say that it's a few people at the top that rules? The case with LRF shows to be something different, since the president Caroline Trapp was re-elected. The election committee proposed a new president, but the assembly had another opinion and re-elected Caroline Trapp. This shows that the opinions at the top were not the same as among the members of the organisation and the election committee couldn?t rule over them.In this essay I try to understand what kind of organisation LRF is and what made this case special.

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.

erspective [80][upps-01.gif] This is a thesis on the Swedish Public Lending Right PLR, from a historical perspective. Some of the questions which are investigated in this thesis are: why did the State decide to introduce a PLR and why did it take about 20 years to make the decision? The question why the PLR was not introduced on a copyright basis is also discussed. The focus of this study is during the period of 1934-1956 and it is a literature-study. Mainly there are four reports made by different committees that have been examined.

When a company is part of an agreement there is a risk that one of the collaborators pursues similar business and takes up competition with the partner or chooses to reveal information about their partner to other parties. To avoid this, companies establish a confidentiality agreement that prohibits the parties to reveal any information. Confidentiality agreements that are eternal have become more common in Swedish contract law in commercial relations. As a result, disputes between collaborators have occurred regarding the unreasonable length and validity of the agreement at a later stage.When a confidentiality agreement is considered to be unreasonable, 36 § of the Swedish contract law (AvtL) can be applicable. The paragraph deals with the legitimacy and the opportunities of re-adjustment of the unreasonable contract.

AbstractDelta Terminal owns an outdated industrial building which they now rent out to businesses. This property currently has a high energy con-sumption and therfore it is desirable to improve the efficiency. In ordet to reduce the energy consumption within the industrial building enve-lope, the heating systems and lighting are being investegated. A good building envelope emits less heat and thus reduces the energy consump-tion. An energy audit is a tool used to determine the energy loss.

Problem: Our opinion is that it is important to consider about usability in system development. In this thesis we will focus on usability in point-of-sale systems. The point-of-sale system we base this thesis on is Extenda Retail. Our case study is performed on Ica Kvantum in Bromölla, which implemented Extenda Retail about two years ago. Purpose: The purpose of this thesis is to figure out what important factors there are to consider, in usability aspects, when developing point-of-sale systems, with focus on the cashier.

Environmental management systems are a way of systematizing and streamlining an organization's environmental efforts. Within its EMS the organization determines it´s environmental policy and various environmental objectives. In order to achieve their environmental objectives the organization produces action plans that describe how they will work towards the objectives. Stora Enso Skog AB´s districts have been assigned to produce action plans for the company´s environmental objective of 90 % approved everyday nature consideration in final felling and any targets included within this objective. The purpose of this study was to investigate how the districts work with these action plans and how this could be improved.

This study is about the child?s perspective when it comes to work with financial assistance. The purpose of the study was partly to describe how social workers regard the child?s perspective in their work with financial assistance and partly to look into whether they impose a child?s perspective in their practical work. To fulfill this purpose the authors used a quantitative method and sent out a web based survey to all the social workers actively working with financial assistance in Stockholm town.

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.