Abstract
Maritime transportation has been, historically, a major factor in economic development and prosperity since it enables trade and contacts between nations. The amount of trade through maritime transport has increased drastically; for example, about 90% of the European Union’s external trade and one-third of its internal trade depend on maritime transport. Major ports, typically, incorporate multiple terminals serving containerships, railways, and other forms of hinterland transportation and require interterminal and intraterminal container transport. Many factors influence the productivity and efficiency of ports and hence their economic viability. Moreover, environmental concerns have been leading to stern regulation that requires ports to reduce, for example, greenhouse gas emissions. Therefore, port authorities need to balance economic and ecological objectives in order to ensure sustainable growth and to remain competitive. Once a containership moors at a container terminal, several quay cranes are assigned to the ship to load/unload the containers to/from the ship. Loading activities require the containers to have been previously made available at the quayside, while unloading ones require the containers to be removed from the quayside. The containers are transported between the quayside and the storage yard by a set of vehicles. This chapter addresses the intraterminal container transport scheduling problem by simultaneously scheduling the loading/unloading activities of quay cranes and the transport (between the quayside and the storage yard) activities of vehicles. In addition, the problem includes vehicles with adjustable travelling speed, a characteristic never considered in this context. For this problem, we propose bi-objective mixed-integer linear programming (MILP) models aiming at minimizing the makespan and the total energy consumption simultaneously. Computational experiments are conducted on benchmark instances that we also propose. The computational results show the effectiveness of the MILP models as well as the impact of considering vehicles with adjustable speed, which can reduce the makespan by up to 16.2% and the total energy consumption by up to 2.5%. Finally, we also show that handling unloading and loading activities simultaneously rather than sequentially (the usual practice rule) can improve the makespan by up to 34.5% and the total energy consumption by up to 18.3%. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

Abstract
This paper proposes a new problem by integrating the job shop scheduling, the part feeding, and the automated storage and retrieval problems. These three problems are intertwined and the performance of each of these problems influences and is influenced by the performance of the other problems. We consider a manufacturing environment composed of a set of machines (production system) connected by a transport system and a storage/retrieval system. Jobs are retrieved from storage and delivered to a load/unload area (LU) by the automated storage retrieval system. Then they are transported to and between the machines where their operations are processed on by the transport system. Once all operations of a job are processed, the job is taken back to the LU and then returned to the storage cell. We propose a mixed-integer linear programming (MILP) model that can be solved to optimality for small-sized instances. We also propose a hybrid simulated annealing (HSA) algorithm to find good quality solutions for larger instances. The HSA incorporates a late acceptance hill-climbing algorithm and a multistart strategy to promote both intensification and exploration while decreasing computational requirements. To compute the optimality gap of the HSA solutions, we derive a very fast lower bounding procedure. Computational experiments are conducted on two sets of instances that we also propose. The computational results show the effectiveness of the MILP on small-sized instances as well as the effectiveness, efficiency, and robustness of the HSA on medium and large-sized instances. Furthermore, the computational experiments clearly shown that importance of optimizing the three problems simultaneous. Finally, the importance and relevance of including the storage/retrieval activities are empirically demonstrated as ignoring them leads to wrong and misleading results.

Abstract
This paper addresses an extension of the flexible job shop scheduling problem by considering that jobs need to be moved around the shop-floor by a set of vehicles. Thus, this problem involves assigning each production operation to one of the alternative machines, finding the sequence of operations for each machine, assigning each transport task to one of the vehicles, and finding the sequence of transport tasks for each vehicle, simultaneously. Transportation is usually neglected in the literature and when considered, an unlimited number of vehicles is, typically, assumed. Here, we propose the first mixed integer linear programming model for this problem and show its efficiency at solving small-sized instances to optimality. In addition, and due to the NP-hard nature of the problem, we propose a local search based heuristic that the computational experiments show to be effective, efficient, and robust.

Abstract
Sea port container terminals play an important role in the national and regional economy. The integrated scheduling of handling equipment has been recently investigated in literature to improve the performance of the container terminals. In this paper, an integrated scheduling of quay cranes and automated guided vehicles is formulated as a mixed integer linear programming model. This model minimizes the makespan of all the loading and unloading tasks for a set of cranes in a scheduling problem. Based on the simulated annealing (SA) algorithm, a scheduling method is proposed to solve the problem in a relatively short period of time. Comparison of the respective results of the mathematical model and the SA algorithm evidently shows acceptable performance of the proposed SA algorithm in finding good solutions for practical scheduling problems. Moreover, the effects of three cooling processes and two sets of control parameters on the best solution of the SA are investigated. © 2011 Academic Journals.

Abstract
Containers have been used in past decades increasingly as one of the most important transportation tools. Containers have revolutionized cargo shipping and thus changed the world trade systematically. Container terminals as the transhipment facility play a valuable role in performance of this transportation system. Improvement of this facility has been widely considered in literatures. Automated container terminals (ACTs) have been introduced to pursue this purpose. In ACTs various transport vehicles are automated and integrated to each other. Automated guided vehicles (AGVs) are used in ACTs to handle containers between quay cranes and storage yards. Usually scheduling of the AGVs is known as the key factor to improve the performance of ACTs. This paper proposed a heuristic algorithm to schedule the AGVs concurrently with quay cranes. A genetic algorithm is proposed to optimize the simultaneous scheduling of AGVs and QCs. The results showed that proposed genetic algorithm can be used in practical implications while its running time is reasonably low.

Abstract
Genetic distributed fuzzy (GDF) controllers are proposed for multi-part-type production line. These production systems can produce more than one part type. For these systems, "production rate" and "priority of production" for each part type is determined by production controllers. The GDF controllers have already been applied to single-part-type production systems. The methodology is illustrated and evaluated using a two-part-type production line. For these controllers, genetic algorithm (GA) is used to tune the membership functions (MFs) of GDF. The objective function of the GDF controllers minimizes the surplus level in production line. The results show that GDF controllers can improve the performance of production systems. GDF controllers show their abilities in reducing the backlog level. In production systems in which the backlog has a high penalty or is not allowed, the implementation of GDF controllers is advisable. © World Scientific Publishing Company.