Abstract
This study evaluates a new solution approach for the Resource -Constrained Project Scheduling with Alternative Subgraphs (RCPSP-AS) in case that complex relations (i.e. nested and linked alternatives) are considered. In the RCPSP-AS, the project activity structure is extended with alternative activity sequences. This implies that only a subset of all activities should be scheduled, which corresponds with a set of activities in the project network that model an alternative execution mode for a work package. Since only the selected activities should be scheduled, the RCPSP-AS comes down to a traditional RCPSP problem when the selection subproblem is solved. It is known that the RCPSP and, hence, its extension to the RCPSP-AS is NP -hard. Since similar scheduling and selection subproblems have already been successfully solved by satisfiability (SAT) solvers in the existing literature, we aim to test the performance of a GA -SAT approach that is derived from the literature and adjusted to be able to deal with the problem -specific constraints of the RCPSP-AS. Computational results on smalland large-scale instances (both artificial and empirical) show that the algorithm can compete with existing metaheuristic algorithms from the literature. Also, the performance is compared with an exact mathematical solver and learning behaviour is observed and analysed. This research again validates the broad applicability of SAT solvers as well as the need to search for better and more suited algorithms for the RCPSP-AS and its extensions.

Abstract
This paper presents a matheuristic solution algorithm to solve the well-known resource-constrained project scheduling problem (RCPSP). The problem makes use of a restricted neighbourhood method using an activity selection and a search space restriction module and implements them as two alternative search algorithms. The first algorithm makes use of the best-performing components of the branch-and-bound procedures from the literature, and embeds them into a greedy neighbourhood search. The second matheuristic implements the exact branch-and-bound procedures into a known and well-performing meta-heuristic search algorithm. Computational experiments have been carried out on seven different datasets consisting of 10,000+ project instances. Experiments reveal that the choice of exact algorithm is key in finding high-quality solutions, and illustrate that the trade-off between selecting an activity set size and search space restriction depends on the specific implementation. The computational tests demonstrate that the matheuristic discovered 24 new best known solutions that could not be found by either a meta-heuristic or an exact method individually. Moreover, a new benchmark dataset has been proposed that can be used to develop new matheuristic search procedures to solve the problem consisting of 461 instances from the literature.

Abstract
This article summarises the research studies published in the special issue on Project Management and Scheduling devoted to the 18th International Conference on Project Management and Scheduling (PMS). The special issue contains state-of-the art research in the field of (non-)robust project and machine scheduling and the contribution of each individual study to the academic literature are discussed. We notice that there is a growing interest in the research community to investigate robust scheduling approaches and optimisation problems observed in real-life business settings. This allows us to derive some interesting future research directions for the project and machine scheduling community.

Abstract
Association Rule Mining (ARM) is a field of data mining (DM) that attempts to identify correlations among database items. It has been applied in various domains to discover patterns, provide insight into different topics, and build understandable, descriptive, and predictive models. On the one hand, Enterprise Architecture (EA) is a coherent set of principles, methods, and models suitable for designing organizational structures. It uses viewpoints derived from EA models to express different concerns about a company and its IT landscape, such as organizational hierarchies, processes, services, applications, and data. EA mining is the use of DM techniques to obtain EA models. This paper presents a literature review to identify the newest and most cited ARM algorithms and techniques suitable for EA mining that focus on automating the creation of EA models from existent data in application systems and services. It systematically identifies and maps fourteen candidate algorithms into four categories useful for EA mining: (i) General Frequent Pattern Mining, (ii) High Utility Pattern Mining, (iii) Parallel Pattern Mining, and (iv) Distribute Pattern Mining. Based on that, it discusses some possibilities and presents an exemplification with a prototype hypothesizing an ARM application for EA mining.

Abstract
The research objective of this work is to develop and evaluate an enterprise architecture for rural accommodation in the Iberian Peninsula that responds to the demand of the remote labor market. Through an extensive literature review and the application of ArchiMate modeling, this study focuses on providing an enterprise architecture that promotes business resilience and environmental sustainability and boosts the local economy. The proposed enterprise architecture is remotely evaluated by experts, highlighting potential benefits, challenges, and areas for improvement. The results show that the proposed enterprise architecture has the potential to improve the long-term success of rural lodging businesses, enhance the customer experience, promote sustainability, and contribute to economic growth in rural areas through value exchange among stakeholders. The ArchiMate model provides a holistic perspective on stakeholder interactions and interoperability across all functional business areas: Customer Service, Product Management, Omnichannel Commerce, Human Resources, Business Strategy, Marketing, and Sustainability Management. The idea is to empower rural lodging businesses to create a better customer experience, achieve energy and environmental efficiency, contribute to local development, respond quickly to regulatory changes and compliance, and develop new revenue streams. The main goal is to improve offers, mitigate seasonal effects, and reverse the continuous cycle of decline in areas with low population density. Therefore, this ArchiMate modeling can be the initial basis for the digitization or expansion of the rural lodging industry in other geographies.

Abstract
Organizations find themselves at a pivotal crossroads in an era propelled by the sweeping tide of digital transformation, where the wake of the COVID-19 pandemic has reshaped the global landscape. Within these novel contexts, the imperative to cultivate Learning Organizations (LOs) has emerged as a beacon of adaptability and progress. Creating Learning Organizations Through Digital Transformation weaves the fabric of LOs within the digital tapestry, where minds perpetually expand, and learning begets learning. This journey hinges on the synergy of knowledge and digital prowess, as LOs harness data and digital content with finesse. From immersive learning to artificial intelligence, these technological frontiers reshape learning, spurring change. Unveiling the core concepts, implementations, and global impacts of LOs, this book is a compass for academics, researchers, and practitioners. It deciphers people capacities, digital contents, learning technologies, and evaluation, nurturing the symbiotic relationship between learning and transformation. Creating Learning Organizations Through Digital Transformation is the scholarly guidepost in a swiftly evolving landscape. It beckons to those attuned to academia and those shaping real-world organizations, resonating with the pursuit of knowledge in an era of unceasing change. © 2024 by IGI Global. All rights reserved.