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.

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. 

What aspects of rehabilitation provision contribute to self-reported met needs for rehabilitation one year after stroke - amount, place, operator or timing?

BACKGROUND AND OBJECTIVE: To a large extent, people who have suffered a stroke report unmet needs for rehabilitation. The purpose of this study was to explore aspects of rehabilitation provision that potentially contribute to self-reported met needs for rehabilitation 12 months after stroke with consideration also to severity of stroke. METHODS: The participants (n = 173) received care at the stroke units at the Karolinska University Hospital, Sweden. Using a questionnaire, the dependent variable, self-reported met needs for rehabilitation, was collected at 12 months after stroke. The independent variables were four aspects of rehabilitation provision based on data retrieved from registers and structured according to four aspects: amount of rehabilitation, service level (day care rehabilitation, primary care rehabilitation and home-based rehabilitation), operator level (physiotherapist, occupational therapist, speech therapist) and time after stroke onset. Multivariate logistic regression analyses regarding the aspects of rehabilitation were performed for the participants who were divided into three groups based on stroke severity at onset. RESULTS: Participants with moderate/severe stroke who had seen a physiotherapist at least once during each of the 1st, 2nd and 3rd-4th quarters of the first year (OR 8.36, CI 1.40-49.88 P = 0.020) were more likely to report met rehabilitation needs. CONCLUSION: For people with moderate/severe stroke, continuity in rehabilitation (preferably physiotherapy) during the first year after stroke seems to be associated with self-reported met needs for rehabilitation.