Abstract
In the original publication [1], there was a minor error in Figure 1 and Table 6. Unfortunately, Figure 1 presented a smaller text size than appropriate, making it difficult for the reader, in addition to the abbreviation “FiO2” instead of “FiO2”. Then, in Table 6, the basal lactate values between the groups were corrected and the lactate peak values were included. The authors state that the scientific conclusions are unaffected. This correction was approved by the Academic Editor. The original publication has also been updated. © 2024 by the authors.

Abstract
In our data-flooded age, an enormous amount of redundant, but also disparate textual data is collected on a daily basis on a wide variety of topics. Much of this information refers to documents related to the same theme, that is, different versions of the same document, or different documents discussing the same topic. Being aware of such differences turns out to be an important aspect for those who want to perform a comparative task. However, as documents increase in size and volume, keeping up-to-date, detecting, and summarizing relevant changes between different documents or versions of it becomes unfeasible. This motivates the rise of the contrastive or comparative summarization task, which attempts to summarize the text of different documents related to the same topic in a way that highlights the relevant differences between them. Our research aims to provide a systematic literature review on contrastive or comparative summarization, highlighting the different methods, data sets, metrics, and applications. Overall, we found that contrastive summarization is most commonly used in controversial news articles, controversial opinions or sentiments on a topic, and reviews of a product. Despite the great interest in the topic, we note that standard data sets, as well as a competitive task dedicated to this topic, are yet to come to be proposed, eventually impeding the emergence of new methods. Moreover, the great breakthrough of using deep learning-based language models for abstract summaries in contrastive summarization is still missing.

Abstract
Our civilization creates enormous volumes of digital data, a substantial fraction of which is preserved and made publicly available for present and future usage. Additionally, historical born-analog records are progressively being digitized and incorporated into digital document repositories. While professionals often have a clear idea of what they are looking for in document archives, average users are likely to have no precise search needs when accessing available archives (e.g., through their online interfaces). Thus, if the results are to be relevant and appealing to average people, they should include engaging and recognizable material. However, state-of-the-art document archival retrieval systems essentially use the same approaches as search engines for synchronic document collections. In this article, we develop unique ranking criteria for assessing the usefulness of archived contents based on their estimated relationship with current times, which we call contemporary relevance. Contemporary relevance may be utilized to enhance access to archival document collections, increasing the likelihood that users will discover interesting or valuable material. We next present an effective strategy for estimating contemporary relevance degrees of news articles by utilizing learning to rank approach based on a variety of diverse features, and we then successfully test it on the New York Times news collection. The incorporation of the contemporary relevance computation into archival retrieval systems should enable a new search style in which search results are meant to relate to the context of searchers' times, and by this have the potential to engage the archive users. As a proof of concept, we develop and demonstrate a working prototype of a simplified ranking model that operates on the top of the Portuguese Web Archive portal (arquivo.pt).

Abstract
[No abstract available]

Abstract

Abstract
Traditionally, scheduling literature has focused mainly on solving problems related to processing jobs with non- assembly operations. Despite the growing interest in the assembly literature in recent years, knowledge of the problem is still in its early stages in many aspects. In this regard, we are not aware of any previous contributions that address the assembly scheduling problem with just-in-time objectives. To fill this gap, this paper studies the 2-stage assembly scheduling problem minimising the sum of total earliness and total tardiness. We first analyse the relationship between the decision problem and the generation of the due dates of the jobs, and identify the equivalences with different related decision problems depending on the instances. The properties and conclusions obtained in the analysis are applied to design two constructive heuristics and a composite heuristic. To evaluate our proposals, different heuristics from the state-of-the-art of related scheduling problems are adapted, and a computational evaluation is carried out. The excellent behaviour of the proposed algorithms is demonstrated by an extensive computational evaluation.