Branch and Bound Algorithm for Multiprocessor Scheduling

The multiprocessor task graph scheduling problem has been extensively studied asacademic optimization problem which occurs in optimizing the execution time of parallelalgorithm with parallel computer. The problem is already being known as one of the NPhardproblems. There are many good approaches made with many optimizing algorithmto find out the optimum solution for this problem with less computational time. One ofthem is branch and bound algorithm.In this paper, we propose a branch and bound algorithm for the multiprocessor schedulingproblem. We investigate the algorithm by comparing two different lower bounds withtheir computational costs and the size of the pruned tree.Several experiments are made with small set of problems and results are compared indifferent sections.

The program and treatment effect of summer jobs on girls’ post-schooling incomes

Public programs (of disputed effect) offering summer jobs or work while in high school to smooth the transition from school to work is commonplace. In this paper, 1447 girls in their first grade of high school between 1997-2003 and randomly allotted summer jobs via a program in Falun (Sweden) are followed 5-12 years after graduation. The program led to a substantially larger accumulation of income while in high school. The causal effect of the high school income on post-schooling incomes was substantial and statistically significant. The implied elasticity of 0.4 is however potentially inflated dueto heterogeneous effects.