Abstract
Globalisation, urbanisation and the recent COVID-19 pandemic has been raising the demand for logistic activities. This change is affecting the entire supply chain, especially the last-mile step. This step is considered the most expensive and ineffective part of the supply chain and a source of negative economic, environmental and social externalities. This article aims to characterise the sustainable urban last-mile logistics research field through a systematic literature review (N = 102). This wide and holistic review was organised into six thematic clusters that identified the main concepts addressed in the different areas of the last-mile research and the existence of 14 solutions, grouped into three types (vehicular, operational, and organisational solutions). The major findings are that there are no ideal last-mile solutions as their limitations should be further explored by considering the so-called triple bottom line of sustainability; the integration and combination of multiple last-mile alternative concepts; or by establishing collaboration schemes that minimise the stakeholders' conflicting interests.

Abstract
Globalization and the COVID-19 pandemic led to an increased number of consumers using e-commerce services. This trend has been raising the demand for logistic activities, especially on the last-mile. This part of the supply chain is expensive and ineffective, and a source of negative externalities such as air and noise pollution, traffic congestion and accidents. The anticipation of innovative solutions can help to mitigate these costs. In this context, this paper provides a systematic literature review of the existing literature regarding emerging solutions for last-mile parcel delivery. For guiding the development of more sustainable last-mile parcel distribution, and to provide some insights for future research, we identified and summarized the emerging concepts within this field domain. The results show that innovative solutions have been emerging at different levels: (i) definition of new crowdsourcing-based models, (ii) use of new types of vehicles, and (iii) development of optimization systems based on data collection and the combination of different technologies. Moreover, recent studies show that new strategies are being developed focusing on using consumers as active actors of delivery; non-road and autonomous vehicles are promising concepts in last-mile operations; and different logistic operations, such as vehicle routing, are being optimized with data analytics, cloud technology and mobile apps.

Abstract
The Vehicle Routing Problem with Divisible Deliveries and Pickups (VRPDDP) is under-explored in literature, yet it has a wide application in practice in a reverse logistics context, where the collection returnable items must also be ensured along with the traditional delivery of products to customers. problem considers that each customer has both delivery and pickup demands and may be visited twice in the same or different routes (i.e., splitting customers' visits). In several reverse logistics problems, capacity restrictions are required to either allow the movement of the driver inside the vehicle to arrange the loads or to avoid cross-contamination between delivery and pickup loads. In this work, explore the economic and the environmental impacts of the VRPDDP, with and without restrictions the free capacity, and compare it with the traditional Vehicle Routing Problem with Simultaneous Deliveries and Pickups (VRPSDP), on savings achieved by splitting customers visits. An exact method, solved through Gurobi, and an ALNS metaheuristic are coded in Python and used to test well-known and newly generated instances. A multi-objective approach based on the augmented e-constraint method is applied to obtain and compare solutions minimizing costs and CO2 emissions. The results demonstrate that splitting customer visits reduces the CO2 emissions for load-constrained distribution problems. Moreover, savings percentage of the VRPDDP when compared to the VRPSDP is higher for instances with a random network than when a clustered network of customers is considered.

Abstract

Abstract
This work addresses a variant of the job shop scheduling problem in which jobs need to be transported to the machines processing their operations by a limited number of vehicles. Given that vehicles must deliver the jobs to the machines for processing and that machines need to finish processing the jobs before they can be transported, machine scheduling and vehicle scheduling are intertwined. A coordi-nated approach that solves these interrelated problems simultaneously improves the overall performance of the manufacturing system. In the current competitive business environment, and integrated approach is imperative as it boosts cost savings and on-time deliveries. Hence, the job shop scheduling problem with transport resources (JSPT) requires scheduling production operations and transport tasks simultane-ously. The JSPT is studied considering the minimization of two alternative performance metrics, namely: makespan and exit time. Optimal solutions are found by a mixed integer linear programming (MILP) model. However, since integrated production and transportation scheduling is very complex, the MILP model can only handle small-sized problem instances. To find good quality solutions in reasonable com-putation times, we propose a hybrid particle swarm optimization and simulated annealing algorithm (PSOSA). Furthermore, we derive a fast lower bounding procedure that can be used to evaluate the perfor-mance of the heuristic solutions for larger instances. Extensive computational experiments are conducted on 73 benchmark instances, for each of the two performance metrics, to assess the efficacy and efficiency of the proposed PSOSA algorithm. These experiments show that the PSOSA outperforms state-of-the-art solution approaches and is very robust.(c) 2022 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license ( http://creativecommons.org/licenses/by-nc-nd/4.0/ )

Abstract
This work addresses the flexible job shop scheduling problem with transportation (FJSPT), which can be seen as an extension of both the flexible job shop scheduling problem (FJSP) and the job shop scheduling problem with transportation (JSPT). Regarding the former case, the FJSPT additionally considers that the jobs need to be transported to the machines on which they are processed on, while in the latter, the specific machine processing each operation also needs to be decided. The FJSPT is NP-hard since it extends NP-hard problems. Good-quality solutions are efficiently found by an operation-based multistart biased random key genetic algorithm (BRKGA) coupled with greedy heuristics to select the machine processing each operation and the vehicles transporting the jobs to operations. The proposed approach outperforms state-of-the-art solution approaches since it finds very good quality solutions in a short time. Such solutions are optimal for most problem instances. In addition, the approach is robust, which is a very important characteristic in practical applications. Finally, due to its modular structure, the multistart BRKGA can be easily adapted to solve other similar scheduling problems, as shown in the computational experiments reported in this paper.