2 resultados para Continuous programming
em BORIS: Bern Open Repository and Information System - Berna - Suiça
Resumo:
AIMS/HYPOTHESIS: To assess the use of paediatric continuous subcutaneous infusion (CSII) under real-life conditions by analysing data recorded for up to 90 days and relating them to outcome. METHODS: Pump programming data from patients aged 0-18 years treated with CSII in 30 centres from 16 European countries and Israel were recorded during routine clinical visits. HbA(1c) was measured centrally. RESULTS: A total of 1,041 patients (age: 11.8 +/- 4.2 years; diabetes duration: 6.0 +/- 3.6 years; average CSII duration: 2.0 +/- 1.3 years; HbA(1c): 8.0 +/- 1.3% [means +/- SD]) participated. Glycaemic control was better in preschool (n = 142; 7.5 +/- 0.9%) and pre-adolescent (6-11 years, n = 321; 7.7 +/- 1.0%) children than in adolescent patients (12-18 years, n = 578; 8.3 +/- 1.4%). There was a significant negative correlation between HbA(1c) and daily bolus number, but not between HbA(1c) and total daily insulin dose. The use of <6.7 daily boluses was a significant predictor of an HbA(1c) level >7.5%. The incidence of severe hypoglycaemia and ketoacidosis was 6.63 and 6.26 events per 100 patient-years, respectively. CONCLUSIONS/INTERPRETATION: This large paediatric survey of CSII shows that glycaemic targets can be frequently achieved, particularly in young children, and the incidence of acute complications is low. Adequate substitution of basal and prandial insulin is associated with a better HbA(1c).
Resumo:
In process industries, make-and-pack production is used to produce food and beverages, chemicals, and metal products, among others. This type of production process allows the fabrication of a wide range of products in relatively small amounts using the same equipment. In this article, we consider a real-world production process (cf. Honkomp et al. 2000. The curse of reality – why process scheduling optimization problems are diffcult in practice. Computers & Chemical Engineering, 24, 323–328.) comprising sequence-dependent changeover times, multipurpose storage units with limited capacities, quarantine times, batch splitting, partial equipment connectivity, and transfer times. The planning problem consists of computing a production schedule such that a given demand of packed products is fulfilled, all technological constraints are satisfied, and the production makespan is minimised. None of the models in the literature covers all of the technological constraints that occur in such make-and-pack production processes. To close this gap, we develop an efficient mixed-integer linear programming model that is based on a continuous time domain and general-precedence variables. We propose novel types of symmetry-breaking constraints and a preprocessing procedure to improve the model performance. In an experimental analysis, we show that small- and moderate-sized instances can be solved to optimality within short CPU times.