Waste prevention: policy instruments and business model innovation

Waste prevention (WP) is a strategy which helps societies and individuals to strive for sufficiency in resource consumption within planetary boundaries alongside sustainable and equitable well-being and to decouple the concepts of well-being and life satisfaction from materialism. Within this dissertation, some instruments to promote WP are analysed, by adopting two perspectives: firstly, the one of policymakers, at different governance levels, and secondly, the one of business in the electrical and electronic equipment (EEE) sector. At a national level, the role of WP programmes and market-based instruments (extended producer responsibility, pay-as-you-throw schemes, deposit-refund systems, environmental taxes) in boosting prevention of municipal solid waste is investigated. Then, focusing on the Emilia-Romagna Region (Italy), the performances of the waste management system are assessed over a long period, including some years before and after an institutional reform of the waste management governance regime. The impact of a centralisation (at a regional level) of both planning and economic regulation of the waste services on waste generation and WP is analysed. Finally, to support the regional decision-makers in the prioritisation of publicly funded projects for WP, a framework for the sustainability assessment, the evaluation of success, and the prioritisation of WP measures was applied to some projects implemented by Municipalities in the Region. Trying to close the research gap between engineering and business, WP strategies are discussed as drivers for business model (BM) innovation in EEE sector. Firstly, an innovative approach to a digital tracking solution for professional EEE management is analysed. New BMs which facilitate repair, reuse, remanufacturing, and recycling are created and discussed. Secondly, the impact of BMs based on servitisation and on producer ownership on the extension of equipment lifetime is analysed, by performing a review of real cases of organizations in the EEE sector applying result- and use-oriented BMs.

Hybrid Methods for Resource Allocation and Scheduling Problems in Deterministic and Stochastic Environments

This work presents exact, hybrid algorithms for mixed resource Allocation and Scheduling problems; in general terms, those consist into assigning over time finite capacity resources to a set of precedence connected activities. The proposed methods have broad applicability, but are mainly motivated by applications in the field of Embedded System Design. In particular, high-performance embedded computing recently witnessed the shift from single CPU platforms with application-specific accelerators to programmable Multi Processor Systems-on-Chip (MPSoCs). Those allow higher flexibility, real time performance and low energy consumption, but the programmer must be able to effectively exploit the platform parallelism. This raises interest in the development of algorithmic techniques to be embedded in CAD tools; in particular, given a specific application and platform, the objective if to perform optimal allocation of hardware resources and to compute an execution schedule. On this regard, since embedded systems tend to run the same set of applications for their entire lifetime, off-line, exact optimization approaches are particularly appealing. Quite surprisingly, the use of exact algorithms has not been well investigated so far; this is in part motivated by the complexity of integrated allocation and scheduling, setting tough challenges for ``pure'' combinatorial methods. The use of hybrid CP/OR approaches presents the opportunity to exploit mutual advantages of different methods, while compensating for their weaknesses. In this work, we consider in first instance an Allocation and Scheduling problem over the Cell BE processor by Sony, IBM and Toshiba; we propose three different solution methods, leveraging decomposition, cut generation and heuristic guided search. Next, we face Allocation and Scheduling of so-called Conditional Task Graphs, explicitly accounting for branches with outcome not known at design time; we extend the CP scheduling framework to effectively deal with the introduced stochastic elements. Finally, we address Allocation and Scheduling with uncertain, bounded execution times, via conflict based tree search; we introduce a simple and flexible time model to take into account duration variability and provide an efficient conflict detection method. The proposed approaches achieve good results on practical size problem, thus demonstrating the use of exact approaches for system design is feasible. Furthermore, the developed techniques bring significant contributions to combinatorial optimization methods.

Ultra-low power WSNs: distributed signal processing and dynamic resource management

This thesis presents several data processing and compression techniques capable of addressing the strict requirements of wireless sensor networks. After introducing a general overview of sensor networks, the energy problem is introduced, dividing the different energy reduction approaches according to the different subsystem they try to optimize. To manage the complexity brought by these techniques, a quick overview of the most common middlewares for WSNs is given, describing in detail SPINE2, a framework for data processing in the node environment. The focus is then shifted on the in-network aggregation techniques, used to reduce data sent by the network nodes trying to prolong the network lifetime as long as possible. Among the several techniques, the most promising approach is the Compressive Sensing (CS). To investigate this technique, a practical implementation of the algorithm is compared against a simpler aggregation scheme, deriving a mixed algorithm able to successfully reduce the power consumption. The analysis moves from compression implemented on single nodes to CS for signal ensembles, trying to exploit the correlations among sensors and nodes to improve compression and reconstruction quality. The two main techniques for signal ensembles, Distributed CS (DCS) and Kronecker CS (KCS), are introduced and compared against a common set of data gathered by real deployments. The best trade-off between reconstruction quality and power consumption is then investigated. The usage of CS is also addressed when the signal of interest is sampled at a Sub-Nyquist rate, evaluating the reconstruction performance. Finally the group sparsity CS (GS-CS) is compared to another well-known technique for reconstruction of signals from an highly sub-sampled version. These two frameworks are compared again against a real data-set and an insightful analysis of the trade-off between reconstruction quality and lifetime is given.