Scheduling parallel dedicated machines under a single non-shared resource

The scheduling problem of minimizing the makespan for m parallel dedicated machines under single resource constraints is considered. For different variants of the problem the complexity status is established. Heuristic algorithms employing the so-called group technology approach are presented and their worst-case behavior is examined. Finally, a polynomial time approximation scheme is presented for the problem with fixed number of machines.

Scheduling problems for parallel dedicated machines under multiple resource constraints

The paper considers scheduling problems for parallel dedicated machines subject to resource constraints. A fairly complete computational complexity classification is obtained, a number of polynomial-time algorithms are designed. For the problem with a fixed number of machines in which a job uses at most one resource of unit size a polynomial-time approximation scheme is offered.

Scheduling parallel dedicated machines with the speeding-up resource

We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two-machine problem is NP-hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst-case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple-choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008

The food multimix concept: potential of an innovative food based approach on nutritional status in pregnant women in resource-poor communities

RATIONALE & OBJECTIVES: The food multimix (FFM)concept states that limited food resources can be combined using scientific knowledge to meet nutrient needs of vulnerable groups at low cost utilizing the ‘nutrient strengths’ of individual or candidate foods in composite recipes within a cultural context. METHODS: The method employed the food-to-food approach for recipe development using traditional food ingredients. Recipes were subjected to proximate and micronutrient analysis and optimized to meet at tleast 40% of recommended daily intakes. End products including breads, porridge and soup were developed. RESULTS: FMM products were employed in a feeding trial among 120 healthy pregnant women in Gauteng, South Africa resulting in improvements in serum iron levels from baseline values of 14.59 (=/-7.67) umol/L and 14.02 (=/-8.13) umol/L for control and intervention groups (p=0.71), to 16.03 (=/-5.67) umol/L and 18.66 (=/-9.41) umol/L (p=0.19). The increases from baseline to post-intervention were however statistically significant within groups. Similarly Mean Cell Volume values improved from baseline as well as serum ferritin and transferritin levels. CONCLUSION: The FMM concept has potential value in feeding programs for vulnerable groups including pregnant and lactating mothers.

A critical evaluation of Enterprise Resource Planning (ERP) software sourcing and provision using theoretical constructs

Deliberating on Enterprise Resource Planning (ERP) software sourcing and provision, this paper contrasts the corporate environment with the small business environment. The paper is about Enterprise Resource Planning client (ERPc) expectations and Enterprise Resource Planning vendor (ERPv) value propositions as a mutually compatible process for achieving acceptable standards of ERP software performance. It is suggested that a less-than-equitable vendor–client relationship would not contribute to the implementation of the optimum solution. Adapting selected theoretical concepts and models, the researchers analyse ERPv to ERPc relationship. This analysis is designed to discover if the provision of the very large ERP vendors who market systems such as SAP, and the provision of the smaller ERP vendors (in this instance Eshbel Technologies Ltd who market an ERP software solution called Priority) when framed as a value proposition (Walters, D. (2002) Operations Strategy. Hampshire, UK: Palgrave), is at all comparable or distinctive.