Beyond C<i>max</i>: an optimization-oriented framework for constraint-based scheduling

This paper presents a framework taking advantage of both the flexibility of constraint programming and the efficiency of operations research algorithms for solving scheduling problems under various objectives and constraints. Built upon a constraint programming engine, the framework allows the use of scheduling global constraints, and it offers, in addition, a modular and simplified way to perform optimality reasoning based on well-known scheduling relaxations. We present a first instantiation on the single machine problem with release dates and lateness minimization. Beyond the simplicity of use, the ptimizationoriented framework appears to be, from the experiments, effective for dealing with such a pure problem even without any ad-hoc heuristics

Beyond C<i>max</i>: an optimization-oriented framework for constraint-based scheduling

This paper presents a framework taking advantage of both the flexibility of constraint programming and the efficiency of operations research algorithms for solving scheduling problems under various objectives and constraints. Built upon a constraint programming engine, the framework allows the use of scheduling global constraints, and it offers, in addition, a modular and simplified way to perform optimality reasoning based on well-known scheduling relaxations. We present a first instantiation on the single machine problem with release dates and lateness minimization. Beyond the simplicity of use, the ptimizationoriented framework appears to be, from the experiments, effective for dealing with such a pure problem even without any ad-hoc heuristics

A GPU-accelerated Branch-and-Bound Algorithm for the Flow-Shop Scheduling Problem

Branch-and-Bound (B&B) algorithms are time intensive tree-based exploration methods for solving to optimality combinatorial optimization problems. In this paper, we investigate the use of GPU computing as a major complementary way to speed up those methods. The focus is put on the bounding mechanism of B&B algorithms, which is the most time consuming part of their exploration process. We propose a parallel B&B algorithm based on a GPU-accelerated bounding model. The proposed approach concentrate on optimizing data access management to further improve the performance of the bounding mechanism which uses large and intermediate data sets that do not completely fit in GPU memory. Extensive experiments of the contribution have been carried out on well known FSP benchmarks using an Nvidia Tesla C2050 GPU card. We compared the obtained performances to a single and a multithreaded CPU-based execution. Accelerations up to x100 are achieved for large problem instances

Integrating Occlusion Culling and Hardware Instancing for Efficient Real-Time Rendering of Building Information Models

This paper presents an efficient approach for integrating occlusion culling and hardware instancing. The work is primarily targeted at Building Information Models (BIM), which typically share characteristics addressed by these two acceleration techniques separately – high level of occlusion and frequent reuse of building components. Together, these two acceleration techniques complement each other and allows large and complex BIMs to be rendered in real-time. Specifically, the proposed method takes advantage of temporal coherence and uses a lightweight data transfer strategy to provide an efficient hardware instancing implementation. Compared to only using occlusion culling, additional speedups of 1.25x-1.7x is achieved for rendering large BIMs received from real-world projects. These speedups are measured in viewpoints that represents the worst case scenarios in terms of rendering performance when only occlusion culling is utilized

Revisiting the definition of field capacity as a functional parameter in a layered agronomic soil profile beneath irrigated maize

The soil water content at the condition of field capacity (θFC) is a key parameter in irrigation scheduling and has been suggested to be determined by running a synthetic drainage experiment until the flux rate (q) at the bottom of the soil profile achieves a predefined negligible value (qFC). We question the impact of qFC on the assessment of field capacity. Moreover, calculating θFC as the integral mean of the water content profile when q is equal to qFC is strictly valid only for uniform soil profiles. By contrast, this practice is ambiguous and biased for stratified soil profiles due to the soil water content discontinuity at the layer interfaces. In this study, the concept of field capacity was revisited and adapted to practical agronomic heuristics. By resorting to the assessment of root-zone water storage capacity (W), we envision field capacity as a functional hydraulic parameter derived from synthetic irrigation scheduling scenarios to minimize drought stress, drainage, and nitrate leachate below the root zone. A functional analysis was carried out on a 135-cm-thick layered soil profile beneath maize in eastern Nebraska. Onfarm irrigation scheduling applications and agricultural practices were recorded for 20 years (2001–2020) at a daily time step. Hydrus-1D was calibrated and validated with direct measurements of the soil water retention curve and soil water content data, respectively, in each soil layer. A set of functional field capacity values was derived from 24 irrigation scheduling scenarios, and the optimal water storage capacity at field capacity (WFC) was approximately 50 cm (corresponding to about 80% saturation in the soil profile). An average irrigation amount of 217.5 mm distributed over 21 events was obtained by using optimal irrigation scheduling, which was initiated when the matric pressure head took on a value of - 700 cm and the irrigation rate was set at 1.0 cm d-1. This irrigation practice ensured water storage at approximately the same level (ideally at WFC) by sustaining only evapotranspiration fluxes in the uppermost portion of the root zone and by limiting excessive drainage. This protocol can be transferred to other agricultural fields