Abstract
The term Dynamic Manufacturing Network (DMN) refers to a new collaborative business model that relies on real-time information sharing, synchronized planning and common business processes. DMNs are operational networks formed among autonomous and globally dispersed partners, and can be seen as the manufacturing industry application of the Virtual Enterprise (VE) concept. Despite their numerous practical benefits such as optimized processes and access to new and global markets, they are particularly vulnerable to disruptions. Any disruption in manufacturing or transportation of products may obviously result in failed orders, thus impacting the whole DMN reliability. Instead of developing stochastic models to deal with uncertainty, as it is usually done, we have rather integrated the concept of flexibility into the tactical and operational planning of such networks. We therefore propose in this work, a multi-objective optimization model that simultaneously maximizes reactive flexibility measures while minimizing total operating costs.

Abstract
Path relinking has been used for solving deterministic problems by exploring the neighborhood of elite solutions in an intelligent way. We present an algorithm that combines a mixed-integer linear solver with a truncated path-relinking method in order to solve two-stage stochastic integer problems with complete recourse and first-stage integer variables. This method takes advantage of a possible scenario-based decomposition in an innovative way. Therefore, path relinking is used to combine optimized solutions from different scenarios in order to pursue good stochastic solutions. To assess the computational performance of this method, we use the stochastic lot sizing and scheduling problem dealing with perishable products. In this problem, first-stage decision variables are linked to production sequences and production quantities. After the uncertain demand is unveiled, the second-stage variables decide on the inventory usage. Computational results show a clear advantage of the proposed method when compared to a state-of-the-art mixed-integer linear solver.

Abstract
In today's business, consumers are challenging manufacturers by increasingly demanding low volumes of innovative, fashionable and inexpensive products; adopting high quality standards; responding in smaller intervals of time, and with high configurability and parameterization. This omnipresent scenario poses challenging opportunities for collaborative networked organizations. The present paper addresses the main collaborative business processes tailored for responsiveness and efficient use of knowledge on customized manufacturing environments through a lean-based framework proposal for collaborative networks inspired in the Set-Based Concurrent Engineering (SBCE) methodology. In particular this work describes the ongoing implementation of the proposed concepts through a web-based collaborative portal.

Abstract
Selecting quality improvement projects among a variety of mutually competing ones is characterised by prioritisation. In practice, this is often done by the rule of thumb, following a single attribute criterion or by subjective preferences of individual stakeholders of a project team. An approach to track systematically nonconformities and to identify those critical ones that should be prioritised based on multi-attribute criteria is presented. The approach is introduced and its purpose is explained. After the background of relevant topics is given, the method's importance in research and for practitioners is derived. Steps of the approach are portrayed and an application case of a mature industrial company, integrated in the supply-chain of the automotive industry, is presented. Elements of quality tools and techniques are used as attributes, namely failure mode and effect analysis and Pareto diagram. Results based on industrial data indicate that the use of this approach contributes to support informed and structured prioritisation decisions, which foster a more efficient improvement of future quality-based projects.

Abstract
MOOCs are a recent phenomenon, although given their impact, they have been subject to a large debate. Several questions have been raised by researchers and educators alike regarding their sustainability, both economically and as an efficient mode of education provision. In this paper we contribute to this discussion by presenting a case study of the MOOC on Lived Experiences of Climate Change, which piloted the iMOOC pedagogical model developed at Universidade Aberta (UAb), the Portugese Distance Learning University. The iMOOC is a hybrid model which incorporates elements from existing MOOCs but adds other features drawn from UAb's experience with online learning and aims at better integrating in the larger context of the institutional pedagogical culture. The iMOOC implied also an integration of platforms - Moodle and Elgg. The pilot course had more than one thousand registrations, and it was the largest MOOC course on Portuguese language delivered so far. We discuss the effort required to design and deliver the course, the technological solution developed, and the results obtained. We registered a moderate effort to create and run the course, ensured by internal staff from the University. The technological solution was a success: an integrated architecture combining well-established, well-tested open software. The completion rate was 3.3%, but the high success of this innovative learning experience was demonstrated by the active involvement of about 50% of the registered participants, that followed the course until the end. Lessons learned from this experience and future research on the field are also discussed.

Abstract
We consider the problem of scheduling a number of jobs on a number of unrelated parallel machines in order to minimize the makespan. We develop three heuristic approaches, i.e., a genetic algorithm, a tabu search algorithm and a hybridization of these heuristics with a truncated branch-and-bound procedure. This hybridization is made in order to accelerate the search process to near-optimal solutions. The branch-and-bound procedure will check whether the solutions obtained by the meta-heuristics can be scheduled within a tight upper bound. We compare the performances of these heuristics on a standard dataset available in the literature. Moreover, the influence of the different heuristic parameters is examined as well. The computational experiments reveal that the hybrid heuristics are able to compete with the best known results from the literature.