This paper presents a literature review of flow-shop scheduling problems with transportation or delivery of jobs. Flow-shop scheduling problems are one of the most widely studied optimisation problems in the literature on Operations Research. Although these have traditionally been studied assuming negligible or constant transport times, this does not correspond to real manufacturing scenarios in the industry. In fact, the extensive automation and synchronisation demanded by Industry 4.0 may well be a driving factor in the growing interest in the literature on flow-shop scheduling problems with transport constraints. Despite this interest, the literature is disjointed, and many terms have been used interchangeably. This review aims to organise the literature on the topic and propose a new notation for these problems. This contribution is expected to help structure advancements in the field, classifying them by problem type. Furthermore, a detailed study is carried out on the complexity and relationship between different variants. This provides a representation of the advances discovered in the literature while also demonstrating new theoretical results, before finally identifying the most promising research directions.

中文翻译：

---

流水车间调度问题中的运输和交付：系统评价


本文对流水车间调度问题与工作运输或交付进行了文献综述。流水车间调度问题是运筹学文献中研究最广泛的优化问题之一。尽管传统上这些研究假设运输时间可以忽略不计或恒定，但这与行业中的真实制造场景并不对应。事实上，工业 4.0 所要求的广泛自动化和同步很可能是人们对运输限制下的流水车间调度问题日益增长的兴趣的一个驱动因素。尽管有这种兴趣，但文献是脱节的，许多术语可以互换使用。本综述旨在组织有关该主题的文献，并为这些问题提出一种新的符号。预计这一贡献将有助于构建该领域的进步，按问题类型对其进行分类。此外，对不同变体之间的复杂性和关系进行了详细研究。这代表了文献中发现的进展，同时也展示了新的理论结果，然后最终确定了最有前途的研究方向。