"Jag är bara här tillfälligt" : Identitetsskapande i arbetarromaner från 2010-talet av Sara Beischer och Jack Hildén

Syftet med denna uppsats är att reda ut hur huvudgestalterna i Sara Beischers roman Jag ska egentligen inte jobba här (2012) och Jack Hildéns roman Vi, vi vaktmästare (2014) formar identiteter utifrån arbetet samt hur de ser på sig själva utanför arbetet. Detta gör jag genom att utgå ifrån definitioner av begreppen "identitet" och "prekariat". Analysen visar att romankaraktärerna skapar identiteter kopplade till arbetet genom att studera hur deras kollegor beter sig och därefter härma detta beteende. De gör det även genom att bära arbetskläder, lära sig arbetsuppgifterna samt genom att differentiera sig mot arbetsgivaren respektive tjänstemännen på samma arbetsplats. Den identitet de har utanför arbetet är kopplad till kultur och åtskild från identiteten som arbetare.

Statistical bound of genetic solutions to quadratic assignment problems

Quadratic assignment problems (QAPs) are commonly solved by heuristic methods, where the optimum is sought iteratively. Heuristics are known to provide good solutions but the quality of the solutions, i.e., the confidence interval of the solution is unknown. This paper uses statistical optimum estimation techniques (SOETs) to assess the quality of Genetic algorithm solutions for QAPs. We examine the functioning of different SOETs regarding biasness, coverage rate and length of interval, and then we compare the SOET lower bound with deterministic ones. The commonly used deterministic bounds are confined to only a few algorithms. We show that, the Jackknife estimators have better performance than Weibull estimators, and when the number of heuristic solutions is as large as 100, higher order JK-estimators perform better than lower order ones. Compared with the deterministic bounds, the SOET lower bound performs significantly better than most deterministic lower bounds and is comparable with the best deterministic ones. 

On statistical bounds of heuristic solutions to location problems

Solutions to combinatorial optimization problems, such as problems of locating facilities, frequently rely on heuristics to minimize the objective function. The optimum is sought iteratively and a criterion is needed to decide when the procedure (almost) attains it. Pre-setting the number of iterations dominates in OR applications, which implies that the quality of the solution cannot be ascertained. A small, almost dormant, branch of the literature suggests using statistical principles to estimate the minimum and its bounds as a tool to decide upon stopping and evaluating the quality of the solution. In this paper we examine the functioning of statistical bounds obtained from four different estimators by using simulated annealing on p-median test problems taken from Beasley’s OR-library. We find the Weibull estimator and the 2nd order Jackknife estimator preferable and the requirement of sample size to be about 10 being much less than the current recommendation. However, reliable statistical bounds are found to depend critically on a sample of heuristic solutions of high quality and we give a simple statistic useful for checking the quality. We end the paper with an illustration on using statistical bounds in a problem of locating some 70 distribution centers of the Swedish Post in one Swedish region.