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.

Abstract
Energy-efficient scheduling has become a new trend in industry and academia, mainly due to extreme weather conditions, stricter environmental regulations, and volatile energy prices. This work addresses the energy-efficient Job shop Scheduling Problem with speed adjustable machines. Thus, in addition to determining the sequence of the operations for each machine, one also needs to decide on the processing speed of each operation. We propose a multi-population biased random key genetic algorithm that finds effective solutions to the problem efficiently and outperforms the state-of-the-art solution approaches.

Abstract
This work formulates a mixed-integer linear programming (MILP) model and proposes a bi-objective multi-population biased random key genetic algorithm (mp-BRKGA) for the joint scheduling of quay cranes and speed adjustable vehicles in container terminals considering the dual-cycling strategy. Under such a strategy, a combination of loading and unloading containers are handled by a set of cranes (moved between ships and vehicles) and transported by a set of vehicles (transported between the quayside and the storage area). The problem consists of four components: crane scheduling, vehicle assignment, vehicle scheduling, and speed assignment both for empty and loaded journey legs. The results show that an approximated true Pareto front can be found by solving the proposed MILP model and that the mp-BRKGA finds uniformly distributed Pareto fronts, close to the true ones. Additionally, the results clearly demonstrate the advantages of considering speed adjustable vehicles since both the makespan and the energy consumption can be considerably reduced.

Abstract
To design and deploy their supply chains, companies must naturally take quite different decisions, some being strategic or tactical, and others of an operational nature. This work resulted in a decision support system for optimising a biomass supply chain in Portugal, allowing a more efficient operations management, and enhancing the design process. Uncertainty and variability in the biomass supply chain is a critical issue that needs to be considered in the production planning of bioenergy plants. A simulation/optimisation framework was developed to support decision-making, by combining plans generated by a resource allocation optimisation model with the simulation of disruptive wildfire scenarios in the forest biomass supply chain. Different scenarios have been generated to address uncertainty and variability in the quantity and quality of raw materials in the different supply nodes. Computational results show that this simulation/optimisation approach can have a significant impact in the operations efficiency, particularly when disruptions occur closer to the end of the planning horizon. The approach seems to be easily scalable and easy to extend to other sectors.

Abstract
Purpose: The assessment and observation of critical service factors within the retail industry have garnered increased importance in recent times, due to their perceived ability to shape superior future strategies. The aim of this study is to investigate the service elements that are deemed essential by consumers in the retail sector, specifically targeting the grocery retail industry. Design/Methodology/Approach: Our methodological framework incorporates a systematic review of previous literature and a meta-analysis of past studies that highlight the pivotal service elements within the chosen industry. Following the evaluation of existing literature, 55 studies met the inclusion criteria and were selected for further investigation. The systematic review first compiled information from multiple studies, which was then followed by a meta-analysis. This enabled us to statistically analyze the empirical data from the chosen studies, thereby drawing significant conclusions. Findings: The analyses pinpoint that elements such as personal interaction attributes, product quality and availability, and reliable service are of utmost importance to consumers. Interestingly, customer satisfaction was the only outcome that was positively influenced by all the examined service attributes. Additionally, our findings underscore that certain moderators, such as geographic region and timing of the study, sway the relationship between service attributes and customer outcomes. Originality: Despite numerous meta-analyses attempting to pinpoint the key service attributes for consumers, to the best of our understanding, this study is the first to focus on the retail industry, specifically on hypermarkets, supermarkets, or grocery stores. Therefore, this research bridges a gap in the literature and offers a significant contribution to the academic community by proposing an agenda for future research on customer service factors. It also provides invaluable insight for retail managers, outlining numerous practical implications and offering guidance.