OBJECTIVE To determine the impact of an implementation intervention designed to introduce policies and practices supportive of healthy eating in centre-based child-care services. Intervention strategies included staff training, resources, incentives, follow-up support, and performance monitoring and feedback. DESIGN A quasi-experimental design was used to assess change over 20 months in healt...

Preventive maintenance policies are also planned so that the overall reliability. The optimal level of preventive maintenance that maxipreventive maintenance. Maintenance policies can be further improved when they.We design an optimal preventive maintenance policy for a system of N items. An optimal maintenance policy for a system of N items, from a particular class of.Taken into considerations...

We aim in this paper at designing an optimal management policy for a bulk service queueing system with random set-up time under Bernoulli vacation schedule and N-policy. We first study the discrete time parameter and continuous time parameter stochastic processes and derive all the quantities required to build a linear cost structure. Then an algorithm is suggested to determine the optimal mana...

We study a repairable system with Markovian deterioration and partial repair options, carried out at fixed times n = 1, 2, ... and look for optimal strategies under certain conditions. Two optimality criteria are considered: expected discounted cost and long-run average cost. Douer and Yechiali found conditions under which a policy in the class of generalized control limit policies is optimal. ...

BACKGROUND There is limited research on the use of evidence to inform policy-making in the Pacific. This study aims to identify and describe factors that facilitate or limit the use of evidence in food-related policy-making in the Health and Agriculture Ministries in Fiji. METHODS Semi-structured face-to-face interviews were conducted with selected policy-makers in two government ministries t...

Abstract. The shortest paths tree problem consists in finding a spanning tree rooted at a given node, in a directed weighted graph, such that for each node i , the path of the tree which goes from i to the root has minimal weight. We propose an algorithm which is a deterministic version of Howard’s policy iteration scheme. We show that policy iteration is faster than the Bellman (or value itera...