Estimation of aortic pressure waveforms from 4D phase-contrast MRI

Several approaches for the non-invasive MRI-based measurement of the aortic pressure waveform over the heart cycle have been proposed in the last years. These methods are normally based on time-resolved, two-dimensional phase-contrast sequences with uni-directionally encoded velocities (2D PC-MRI). In contrast, three-dimensional acquisitions with tridirectional velocity encoding (4D PC-MRI) have been shown to be a suitable data source for detailed investigations of blood flow and spatial blood pressure maps. In order to avoid additional MR acquisitions, it would be advantageous if the aortic pressure waveform could also be computed from this particular form of MRI. Therefore, we propose an approach for the computation of the aortic pressure waveform which can be completely performed using 4D PC-MRI. After the application of a segmentation algorithm, the approach automatically computes the aortic pressure waveform without any manual steps. We show that our method agrees well with catheter measurements in an experimental phantom setup and produces physiologically realistic results in three healthy volunteers.

A hybrid method for large-scale short-term scheduling of make-and-pack production processes

Due to the ongoing trend towards increased product variety, fast-moving consumer goods such as food and beverages, pharmaceuticals, and chemicals are typically manufactured through so-called make-and-pack processes. These processes consist of a make stage, a pack stage, and intermediate storage facilities that decouple these two stages. In operations scheduling, complex technological constraints must be considered, e.g., non-identical parallel processing units, sequence-dependent changeovers, batch splitting, no-wait restrictions, material transfer times, minimum storage times, and finite storage capacity. The short-term scheduling problem is to compute a production schedule such that a given demand for products is fulfilled, all technological constraints are met, and the production makespan is minimised. A production schedule typically comprises 500–1500 operations. Due to the problem size and complexity of the technological constraints, the performance of known mixed-integer linear programming (MILP) formulations and heuristic approaches is often insufficient. We present a hybrid method consisting of three phases. First, the set of operations is divided into several subsets. Second, these subsets are iteratively scheduled using a generic and flexible MILP formulation. Third, a novel critical path-based improvement procedure is applied to the resulting schedule. We develop several strategies for the integration of the MILP model into this heuristic framework. Using these strategies, high-quality feasible solutions to large-scale instances can be obtained within reasonable CPU times using standard optimisation software. We have applied the proposed hybrid method to a set of industrial problem instances and found that the method outperforms state-of-the-art methods.

An MBLP model for scheduling assessment centers

Firms aim at assigning qualified and motivated people to jobs. Human resources managers often conduct assessment centers before making such personnel decisions. By means of an assessment center, the potential and skills of job applicants can be assessed more objectively. For the scheduling of such assessment centers, we present a formulation as a mixed-binary linear program and report on computational results for four real-life examples.