# Mathematical Optimization Model for Truck Scheduling in a Distribution Center with a Mixed Service-Mode Dock Area

Authors: Gustavo Correa Issi; Rodrigo Linfati; John Willmer Escobar
Journal: Journal of Advanced Transportation
 (2020)

---

## Abstract

Cross-docking is a logistics strategy in which products arriving at a distribution center are unloaded from inbound trucks and sorted for transfer directly to outbound trucks, reducing costs and storage and product handling times. This paper addresses a cross-docking problem by designing a mixed-integer linear programming (MILP) model to determine a schedule for inbound and outbound trucks in a mixed service-mode dock area that minimizes the time from when the first inbound truck arrives until the last outbound truck departs (makespan). The model is developed using AMPL software with the CPLEX and Gurobi solvers, which provide results for different instances, most of these with actual shift data from an integrated distribution center of a multinational food company located in Concepción, Chile. The results obtained from the case study are notable and show the effectiveness of the proposed mathematical model.


---

## Body

## 1. Introduction

In a traditional distribution center, products are received and then stored. When a customer requests a product, workers take it from storage and send it to the destination in four main operations: receiving, storage, order picking, and shipping [1]. Storage and order picking are usually the costliest processes since inventory maintenance costs, plus the use of labor, are included [2]. One approach to reducing costs could be adopting a cross-docking system, eliminating storage and order picking operations [3]. Cross-docking is a logistics strategy used by many companies throughout the world. Cross-docking consists of transferring the flow of products directly to outbound vehicles without storing the products, which in practice helps to consolidate shipments, reduce delivery times, and reduce storage costs [4, 5]; Mavi et al. [6]. Nasiri et al. [7] present a MILP model incorporating supplier selection and order allocation into the VRPCD in a multi-cross-dock system minimizing the total costs, including purchasing, transportation, cross-docking, inventory, and early/tardy delivery penalty costs.Cross-docking requires correct synchronization of inbound and outbound vehicles; however, perfect synchronization is difficult to achieve in practice because incoming products must, at least, be sorted, consolidated, and stored until complete outbound shipment. Indeed, cross-docking can be defined as the process of consolidating freight with the same destination (coming from several origins), with minimal handling and with little or no storage [8]. If the products are temporarily stored, this should only be for a short time. An exact limit is difficult to define, but many authors speak of no more than 24  hours [9]. Otherwise, if the products are placed in a warehouse or on shelves to prepare orders and wait for several days or even weeks in storage before being dispatched, it is not considered cross-docking but as traditional storage. Many organizations use a combination of warehousing and cross-docking to reap both approaches [10]. Arbabi et al. [11] developed a hub-and-spoke architecture for a parcel delivery system using a network that includes a distribution center and several cross-dock facilities. Several real-world assumptions, including an electric truck fleet, mobile charging station, third-party logistics, capacity constraints, last-mile deliveries, and customer dissatisfaction, are incorporated in this problem. A combined algorithm based on the fix-and-relax algorithm (FARA) and genetic algorithm (GA), namely, Mb-FARGA, is proposed to solve the problem.In the cross-docking studies, various types of decisions can be classified and differentiated. The types of decisions are strategic (long-term) and operational (short-term) [9, 12]. Long-term decisions consider the location of distribution centers and the best distribution of docks, in addition to establishing a network between the cross-docking center and the suppliers and customers [13]. Operational or short-term decisions involve dock assignment, truck scheduling, and temporary storage in the cross-docking center [14].


### 1.1. Cross-Docking Strategic Decisions

A distribution center’s location is treated as one of the initial steps to install and start cross-docking processes. Bachlaus et al. [15] considered a supply chain that included suppliers, plants, distribution centers, cross-docks, and customers. The objective was to optimize the flow of materials throughout the supply chain and identify the facilities’ optimal quantity and location. The problem was formulated as a multi-objective optimization model that sought to minimize total costs and maximize plant flexibility and volume. Another strategic decision that has to be made for a cross-docking platform is its design. Bartholdi & Gue [16] studied the relationship between the system with performance and productivity. Finally, organizing the collection and delivery of products after consolidation in the cross-docking platform is called vehicle routing. This problem has been addressed by Lee et al. [17] and Liao et al. [18].Some studies have been briefly described that analyze cross-docking strategic problems whose decisions are oriented in the long term and which, for this work, serve to contextualize the dimension of what the cross-docking system generally involves.


### 1.2. Cross-Docking Operational Decisions

Given that this paper has an operational focus, problems existing within cross-docking whose decisions are short term or operational and that serves as the basis for the considered problem are described below.


#### 1.2.1. Platform Assignment

When a vehicle arrives at the dock for loading or unloading, the trucks’ dock assignment needs to be chosen. This allocation could mean an increase or decrease in productivity, handling costs, or even, in extreme cases, to deliver or not order on time. For these problems, it is assumed that there are as many platforms as the number of trucks; otherwise, the problem would become a truck scheduling problem analyzed in the following section.Dock assignment was addressed by Tsui & Chang [19]. In their work, storage was not allowed, and therefore all products went directly to outbound trucks. The authors presented this case as a bilinear programming problem that attempted to minimize cranes’ travel distance.


#### 1.2.2. Truck Scheduling

In the truck scheduling problem, docks are scarce, and trucks compete for that resource. It is not enough to assign a specific dock to an inbound or outbound truck. Instead, it must also be decided when to process the truck. For this reason, this kind of problem often combines the dock assignment issue with some characteristics that change, such as the number of docks, manual transport (hand pallet truck, reach crane) vs. automatic transport (conveyor belts), and whether internal storage is allowed, among others. Multi-objective truck scheduling problems have been proposed by Rahbari et al. [20]. The authors propose a bi-objective MILP model for the vehicle routing and scheduling problem with cross-docking for perishable products. Two robust models have been proposed by considering the travel time of the outbound vehicles and the products’ freshness-life as uncertain.Goodarzi et al. [21] address a multi-objective vehicle routing problem with cross-docking (VRPCD), considering truck scheduling, splitting pickup, and delivery orders with a time-windows supplier and retailer locations, optimizing the cost efficiency and responsiveness. A new bi-objective mixed-integer linear programming model is presented, and a multi-objective meta-heuristic evolutionary algorithm is proposed for solving the problem. Besides, Khorshidian et al. [22] develop a bi-objective mathematical model to integrate truck scheduling and transportation planning in a cross-docking system in a forward/reverse logistics network. A hybrid of the improved version of the augmented e-constraint method and TOPSIS is used for solving the problem.


#### 1.2.3. Stacking and Individual Platforms

Several authors consider a simplified cross-docking center with a single product stacking location and a single platform to study the truck scheduling problem. In this way, the problem is reduced to the sequence of inbound and outbound trucks.Chen & Lee [23] evaluated the problem called the “two-machine cross-docking flow shop problem.” The objective is to sequence inbound and outbound trucks to minimize the makespan. This problem was modeled as a flow problem of two machines, with additional precedence constraints to ensure that an outbound truck was not processed before its predecessor tasks were completed. In Chen & Song [24], this scheduling problem was extended to a two-stage hybrid cross-docking problem. The difference in the problem was that now multiple trucks could be loaded or unloaded at the same time because the machines were considered in parallel at the inbound and outbound stages.Boysen et al. [25] considered the same type of problem with a time horizon scheme divided into discrete time intervals and assumed that trucks could be loaded or unloaded within these intervals. The problem was formulated as an integer programming model, and to solve it, a decomposition approach that considered two subproblems was proposed.


#### 1.2.4. Inbound Truck Scheduling

Other papers deal with problems considering real cases, multiple platforms, and stacking places but only focus on scheduling inbound trucks. It is assumed that outbound trucks are already scheduled or assigned in a medium horizon term. In other words, the destinations of these trucks have already been previously set to the exit platforms.Rosales et al. [26] studied inbound truck assignments at a large cross-dock facility in Georgetown, Kentucky. The assignments were scheduled during a shift period, and the goal was to minimize the operating cost by providing a balanced workload for all workers. Temporary storage was allowed in this work. The authors formulated the scheduling problem as a mixed-integer programming model that included workload balancing constraints.Other authors consider the same problem but propose some dispatching rules applied to a dynamic environment. Wang & Regan [27] considered several inbound trucks waiting to be unloaded when a dock was available. Usually, the next truck to arrive should follow a first-in, first-out policy as a fair wait time rule for all trucks. However, this policy could lead to a suboptimal result in a cross-dock center. Therefore, the authors proposed two algorithms based on the time associated with a new inbound truck’s impact on the entire process (from when a product arrived on the inbound truck until it left on an outbound truck) or the total transfer time of products. Temporary storage is not allowed, and one truck is available for each destination. Stochastic approaches for this problem have been considered by Konur & Golias [28]. This paper considers scheduling inbound trucks at the doors of a cross-dock facility under truck arrival time uncertainty. The authors propose a genetic algorithm (GA) to solve the truck-to-door assignments for truck arrival times, which solves the problem by considering different scenarios according to the uncertainty of parameters.Finally, Boysen et al. [29] consider an operational truck scheduling problem, where a dock door and a start time have to be assigned to each inbound truck. A set of outbound trucks is scheduled beforehand and, therefore, departure times are fixed. Indeed, the paper introduces and formalizes a truck scheduling problem.


#### 1.2.5. Inbound and Outbound Trucks Scheduling

The works analyzed above take on more relevance in real life when combined and cover the most significant number of characteristics and processes that occur within a distribution center or cross-docks. Therefore, many authors refer to the scheduling of inbound and outbound trucks to get closer to a cross’s reality dock center. For this work, the articles described below are very relevant for the considered problem.Boysen [30] addressed the problem of scheduling inbound and outbound trucks with a zero-inventory policy: temporary storage was not allowed since the work focused on handling food products with stringent cooling requirements without breaking the cold chain. The author presented several operational objectives, such as minimizing flow time, processing time, and delays of outbound trucks. Shakeri et al. [31] studied the problem of the exchange of products between trucks. The objective was to minimize the makespan of the problem. In that work, the process was described as follows: in the unloading stage, goods were unloaded and moved to temporary storage (assuming an infinite capacity); then, the products were loaded sequentially on the trucks. Loading the truck could only start if the truck had been fully unloaded and if all products to be loaded were ready in the storage area. The authors provided a mixed-integer programming (nonlinear) formulation of the problem used for small-scale instances. Li et al. [32] presented a dependency ranking search (DRS) heuristic method consisting of two parts to resolve larger problems. The first part constructed a feasible sequence of tasks concerning the number of docks, and the second part assigned those tasks to docks depending on the distances. Some computational tests showed that, for small-scale instances, the CPLEX solver performed slightly better than the DRS heuristic, but CPLEX was significantly slower. For instances of medium and large problems, CPLEX did not find feasible solutions in most cases, while the heuristic found a solution in a few minutes in more than eight of every ten instances. Enderer et al. [33] presented an integrated cross-dock-door assignment and vehicle routing problem in cross-dock terminals’ operation. The problem considers the assignments of platforms to inbound trucks and the scheduling of outbound trucks to destinations. The objective is the minimization of the total material handling and transportation costs.Thai [34] mentioned that seaports’ role is essential since these transport nodes are essential and indispensable for the effective and efficient management of products and information in the supply chain. This research issue is explored through a conceptual model of competencies constructed based on a thorough literature review and in-depth interviews validated by a survey with port personnel in Singapore and Vietnam. Saranen et al. [35] studied the purpose of providing knowledge on the transportation strategies employed in international lean oriented supply chains involving developing economies. In this work, it is essential to mention that some products (e.g., after-sales, spare parts) are requested to country-level dedicated warehouses to serve customer demands.One of the most important articles published regarding cross-docking was by Yu & Egbelu [36]. The article’s objective was to find the best “coupling sequence” or schedule for inbound and outbound trucks and minimize the total operations time or makespan. Temporary storage was permitted and occurred in front of the shipping docks. Two different solution approaches were developed to address the problem. The first approach proposed a mixed-integer programming model. In the second approach, a two-stage heuristic algorithm was developed. The first stage found the best subset of inbound trucks that were the best candidates for transferring freight to each unscheduled outbound truck. In the second stage, each unscheduled outbound truck and the associated inbound trucks were selected and scheduled.Yu [37] proposed a method to find the best docking sequences for trucks at each receiving and shipping dock and assignments of inbound and outbound trucks to docks to minimize the cross-docking system’s makespan multiple docks. The unloading sequences of products from inbound trucks, product routing, and routing sequences are also determined simultaneously. In this work, a mathematical model and two heuristic algorithms have been proposed. Stochastic approaches for the inbound and outbound truck scheduling are proposed by Heidari et al. [38]. In this paper, the problem of scheduling inbound and outbound trucks at a cross-dock facility when vehicle arrival times are unknown through a cost-stable scheduling strategy is addressed. Two meta-heuristics are used for solving the considered problem.Recently, Rijal et al. [39] and Sayed et al. [40] have considered this research’s problems. Rijal et al. [39] considered the problem of operational decisions at cross-dock facilities by including a mixed service mode when both inbound and outbound trucks can be processed at the same doors. The literature and practice often consider the truck scheduling and dock-door assignment problem sequentially or only for either inbound or outbound operations. An adaptive large neighborhood search algorithm to solve the integrated problem and find good solutions within a reasonable amount of computational effort is proposed in this work. Sayed et al. [40] addressed an integrated cross-dock door assignment and truck scheduling problem determining the assignment and scheduling of inbound trucks to inbound doors and outgoing trucks to outbound doors without considering temporal storage. The objective function is the minimization of the total time to process all trucks. Two mathematical programming formulations and two-hybrid metaheuristics are proposed to solve the problem. Finally, Guo et al. [41] proposed a parallel machine scheduling problem with job synchronization for a generic hub terminal problem synchronizing inbound and outbound flows. Two mathematical models and an efficient heuristic have been proposed for solving the considered problem.Based on the literature review, cross-docking has been the focus of many authors who have written a significant number of papers, documents, or theses in the last twenty years. Several articles deal with cross-docking in a more general way, while other documents address a specific type of problem at either the strategic or operational level. Despite this, the same authors point out that there are still many opportunities to improve and expand the research that so far exists. For example, few articles refer to cross-docking with temporary storage; although this approach tries to eradicate all storage types, it is not so in practice. Another case that the authors rarely analyze is expanding the research by considering that the same platforms could load and unload products (mixed modality), as is the case analysis of the considered problem; few documents constrains the departure date or time limit for the outbound trucks. Most of the papers analyzed assume that the platforms are located on opposite sides, and it is not considered that these platforms could be located only in one sector of the distribution center (mixed platform area). Finally, concerning real applications, Ladier & Alpan [42] have determined the gap between the proposed approaches to cross-docking problems and real case applications. The authors mentioned that the number of articles on the subject has been growing very fast but largely detached from industry practice. That work proposes a common framework that compares the literature review regarding cross-docking operations with on-field observations and platform managers׳ interviews to see whether the current state of the art matches the industry practice.This paper proposes a mathematical model in a cross-docking environment for scheduling inbound and outbound trucks that arrive at the docks. The proposed model aims to reduce the operation time of transferring products, that is, to minimize the time from when the first inbound truck arrives to unload its products until the last outbound truck leaves with its load. This time is known as the makespan. The model is tested with actual data obtained from a multinational food company in Chile, located in Concepción, and under different scenarios. The main contribution is the consideration and integration of several approaches to find a model that fits into the reality of the cross-docking operation of the companies and, at the same time, contribute other types of considerations, such as platforms located in a single sector and of mixed modality, which has been scarcely analyzed even in cross-docking research. Similarly, the real application case results measure the solution strategy’s efficiency, allowing its scalability to other companies with similar characteristics.


## 1.1. Cross-Docking Strategic Decisions

A distribution center’s location is treated as one of the initial steps to install and start cross-docking processes. Bachlaus et al. [15] considered a supply chain that included suppliers, plants, distribution centers, cross-docks, and customers. The objective was to optimize the flow of materials throughout the supply chain and identify the facilities’ optimal quantity and location. The problem was formulated as a multi-objective optimization model that sought to minimize total costs and maximize plant flexibility and volume. Another strategic decision that has to be made for a cross-docking platform is its design. Bartholdi & Gue [16] studied the relationship between the system with performance and productivity. Finally, organizing the collection and delivery of products after consolidation in the cross-docking platform is called vehicle routing. This problem has been addressed by Lee et al. [17] and Liao et al. [18].Some studies have been briefly described that analyze cross-docking strategic problems whose decisions are oriented in the long term and which, for this work, serve to contextualize the dimension of what the cross-docking system generally involves.


## 1.2. Cross-Docking Operational Decisions

Given that this paper has an operational focus, problems existing within cross-docking whose decisions are short term or operational and that serves as the basis for the considered problem are described below.


### 1.2.1. Platform Assignment

When a vehicle arrives at the dock for loading or unloading, the trucks’ dock assignment needs to be chosen. This allocation could mean an increase or decrease in productivity, handling costs, or even, in extreme cases, to deliver or not order on time. For these problems, it is assumed that there are as many platforms as the number of trucks; otherwise, the problem would become a truck scheduling problem analyzed in the following section.Dock assignment was addressed by Tsui & Chang [19]. In their work, storage was not allowed, and therefore all products went directly to outbound trucks. The authors presented this case as a bilinear programming problem that attempted to minimize cranes’ travel distance.


### 1.2.2. Truck Scheduling

In the truck scheduling problem, docks are scarce, and trucks compete for that resource. It is not enough to assign a specific dock to an inbound or outbound truck. Instead, it must also be decided when to process the truck. For this reason, this kind of problem often combines the dock assignment issue with some characteristics that change, such as the number of docks, manual transport (hand pallet truck, reach crane) vs. automatic transport (conveyor belts), and whether internal storage is allowed, among others. Multi-objective truck scheduling problems have been proposed by Rahbari et al. [20]. The authors propose a bi-objective MILP model for the vehicle routing and scheduling problem with cross-docking for perishable products. Two robust models have been proposed by considering the travel time of the outbound vehicles and the products’ freshness-life as uncertain.Goodarzi et al. [21] address a multi-objective vehicle routing problem with cross-docking (VRPCD), considering truck scheduling, splitting pickup, and delivery orders with a time-windows supplier and retailer locations, optimizing the cost efficiency and responsiveness. A new bi-objective mixed-integer linear programming model is presented, and a multi-objective meta-heuristic evolutionary algorithm is proposed for solving the problem. Besides, Khorshidian et al. [22] develop a bi-objective mathematical model to integrate truck scheduling and transportation planning in a cross-docking system in a forward/reverse logistics network. A hybrid of the improved version of the augmented e-constraint method and TOPSIS is used for solving the problem.


### 1.2.3. Stacking and Individual Platforms

Several authors consider a simplified cross-docking center with a single product stacking location and a single platform to study the truck scheduling problem. In this way, the problem is reduced to the sequence of inbound and outbound trucks.Chen & Lee [23] evaluated the problem called the “two-machine cross-docking flow shop problem.” The objective is to sequence inbound and outbound trucks to minimize the makespan. This problem was modeled as a flow problem of two machines, with additional precedence constraints to ensure that an outbound truck was not processed before its predecessor tasks were completed. In Chen & Song [24], this scheduling problem was extended to a two-stage hybrid cross-docking problem. The difference in the problem was that now multiple trucks could be loaded or unloaded at the same time because the machines were considered in parallel at the inbound and outbound stages.Boysen et al. [25] considered the same type of problem with a time horizon scheme divided into discrete time intervals and assumed that trucks could be loaded or unloaded within these intervals. The problem was formulated as an integer programming model, and to solve it, a decomposition approach that considered two subproblems was proposed.


### 1.2.4. Inbound Truck Scheduling

Other papers deal with problems considering real cases, multiple platforms, and stacking places but only focus on scheduling inbound trucks. It is assumed that outbound trucks are already scheduled or assigned in a medium horizon term. In other words, the destinations of these trucks have already been previously set to the exit platforms.Rosales et al. [26] studied inbound truck assignments at a large cross-dock facility in Georgetown, Kentucky. The assignments were scheduled during a shift period, and the goal was to minimize the operating cost by providing a balanced workload for all workers. Temporary storage was allowed in this work. The authors formulated the scheduling problem as a mixed-integer programming model that included workload balancing constraints.Other authors consider the same problem but propose some dispatching rules applied to a dynamic environment. Wang & Regan [27] considered several inbound trucks waiting to be unloaded when a dock was available. Usually, the next truck to arrive should follow a first-in, first-out policy as a fair wait time rule for all trucks. However, this policy could lead to a suboptimal result in a cross-dock center. Therefore, the authors proposed two algorithms based on the time associated with a new inbound truck’s impact on the entire process (from when a product arrived on the inbound truck until it left on an outbound truck) or the total transfer time of products. Temporary storage is not allowed, and one truck is available for each destination. Stochastic approaches for this problem have been considered by Konur & Golias [28]. This paper considers scheduling inbound trucks at the doors of a cross-dock facility under truck arrival time uncertainty. The authors propose a genetic algorithm (GA) to solve the truck-to-door assignments for truck arrival times, which solves the problem by considering different scenarios according to the uncertainty of parameters.Finally, Boysen et al. [29] consider an operational truck scheduling problem, where a dock door and a start time have to be assigned to each inbound truck. A set of outbound trucks is scheduled beforehand and, therefore, departure times are fixed. Indeed, the paper introduces and formalizes a truck scheduling problem.


### 1.2.5. Inbound and Outbound Trucks Scheduling

The works analyzed above take on more relevance in real life when combined and cover the most significant number of characteristics and processes that occur within a distribution center or cross-docks. Therefore, many authors refer to the scheduling of inbound and outbound trucks to get closer to a cross’s reality dock center. For this work, the articles described below are very relevant for the considered problem.Boysen [30] addressed the problem of scheduling inbound and outbound trucks with a zero-inventory policy: temporary storage was not allowed since the work focused on handling food products with stringent cooling requirements without breaking the cold chain. The author presented several operational objectives, such as minimizing flow time, processing time, and delays of outbound trucks. Shakeri et al. [31] studied the problem of the exchange of products between trucks. The objective was to minimize the makespan of the problem. In that work, the process was described as follows: in the unloading stage, goods were unloaded and moved to temporary storage (assuming an infinite capacity); then, the products were loaded sequentially on the trucks. Loading the truck could only start if the truck had been fully unloaded and if all products to be loaded were ready in the storage area. The authors provided a mixed-integer programming (nonlinear) formulation of the problem used for small-scale instances. Li et al. [32] presented a dependency ranking search (DRS) heuristic method consisting of two parts to resolve larger problems. The first part constructed a feasible sequence of tasks concerning the number of docks, and the second part assigned those tasks to docks depending on the distances. Some computational tests showed that, for small-scale instances, the CPLEX solver performed slightly better than the DRS heuristic, but CPLEX was significantly slower. For instances of medium and large problems, CPLEX did not find feasible solutions in most cases, while the heuristic found a solution in a few minutes in more than eight of every ten instances. Enderer et al. [33] presented an integrated cross-dock-door assignment and vehicle routing problem in cross-dock terminals’ operation. The problem considers the assignments of platforms to inbound trucks and the scheduling of outbound trucks to destinations. The objective is the minimization of the total material handling and transportation costs.Thai [34] mentioned that seaports’ role is essential since these transport nodes are essential and indispensable for the effective and efficient management of products and information in the supply chain. This research issue is explored through a conceptual model of competencies constructed based on a thorough literature review and in-depth interviews validated by a survey with port personnel in Singapore and Vietnam. Saranen et al. [35] studied the purpose of providing knowledge on the transportation strategies employed in international lean oriented supply chains involving developing economies. In this work, it is essential to mention that some products (e.g., after-sales, spare parts) are requested to country-level dedicated warehouses to serve customer demands.One of the most important articles published regarding cross-docking was by Yu & Egbelu [36]. The article’s objective was to find the best “coupling sequence” or schedule for inbound and outbound trucks and minimize the total operations time or makespan. Temporary storage was permitted and occurred in front of the shipping docks. Two different solution approaches were developed to address the problem. The first approach proposed a mixed-integer programming model. In the second approach, a two-stage heuristic algorithm was developed. The first stage found the best subset of inbound trucks that were the best candidates for transferring freight to each unscheduled outbound truck. In the second stage, each unscheduled outbound truck and the associated inbound trucks were selected and scheduled.Yu [37] proposed a method to find the best docking sequences for trucks at each receiving and shipping dock and assignments of inbound and outbound trucks to docks to minimize the cross-docking system’s makespan multiple docks. The unloading sequences of products from inbound trucks, product routing, and routing sequences are also determined simultaneously. In this work, a mathematical model and two heuristic algorithms have been proposed. Stochastic approaches for the inbound and outbound truck scheduling are proposed by Heidari et al. [38]. In this paper, the problem of scheduling inbound and outbound trucks at a cross-dock facility when vehicle arrival times are unknown through a cost-stable scheduling strategy is addressed. Two meta-heuristics are used for solving the considered problem.Recently, Rijal et al. [39] and Sayed et al. [40] have considered this research’s problems. Rijal et al. [39] considered the problem of operational decisions at cross-dock facilities by including a mixed service mode when both inbound and outbound trucks can be processed at the same doors. The literature and practice often consider the truck scheduling and dock-door assignment problem sequentially or only for either inbound or outbound operations. An adaptive large neighborhood search algorithm to solve the integrated problem and find good solutions within a reasonable amount of computational effort is proposed in this work. Sayed et al. [40] addressed an integrated cross-dock door assignment and truck scheduling problem determining the assignment and scheduling of inbound trucks to inbound doors and outgoing trucks to outbound doors without considering temporal storage. The objective function is the minimization of the total time to process all trucks. Two mathematical programming formulations and two-hybrid metaheuristics are proposed to solve the problem. Finally, Guo et al. [41] proposed a parallel machine scheduling problem with job synchronization for a generic hub terminal problem synchronizing inbound and outbound flows. Two mathematical models and an efficient heuristic have been proposed for solving the considered problem.Based on the literature review, cross-docking has been the focus of many authors who have written a significant number of papers, documents, or theses in the last twenty years. Several articles deal with cross-docking in a more general way, while other documents address a specific type of problem at either the strategic or operational level. Despite this, the same authors point out that there are still many opportunities to improve and expand the research that so far exists. For example, few articles refer to cross-docking with temporary storage; although this approach tries to eradicate all storage types, it is not so in practice. Another case that the authors rarely analyze is expanding the research by considering that the same platforms could load and unload products (mixed modality), as is the case analysis of the considered problem; few documents constrains the departure date or time limit for the outbound trucks. Most of the papers analyzed assume that the platforms are located on opposite sides, and it is not considered that these platforms could be located only in one sector of the distribution center (mixed platform area). Finally, concerning real applications, Ladier & Alpan [42] have determined the gap between the proposed approaches to cross-docking problems and real case applications. The authors mentioned that the number of articles on the subject has been growing very fast but largely detached from industry practice. That work proposes a common framework that compares the literature review regarding cross-docking operations with on-field observations and platform managers׳ interviews to see whether the current state of the art matches the industry practice.This paper proposes a mathematical model in a cross-docking environment for scheduling inbound and outbound trucks that arrive at the docks. The proposed model aims to reduce the operation time of transferring products, that is, to minimize the time from when the first inbound truck arrives to unload its products until the last outbound truck leaves with its load. This time is known as the makespan. The model is tested with actual data obtained from a multinational food company in Chile, located in Concepción, and under different scenarios. The main contribution is the consideration and integration of several approaches to find a model that fits into the reality of the cross-docking operation of the companies and, at the same time, contribute other types of considerations, such as platforms located in a single sector and of mixed modality, which has been scarcely analyzed even in cross-docking research. Similarly, the real application case results measure the solution strategy’s efficiency, allowing its scalability to other companies with similar characteristics.


## 1.2.1. Platform Assignment

When a vehicle arrives at the dock for loading or unloading, the trucks’ dock assignment needs to be chosen. This allocation could mean an increase or decrease in productivity, handling costs, or even, in extreme cases, to deliver or not order on time. For these problems, it is assumed that there are as many platforms as the number of trucks; otherwise, the problem would become a truck scheduling problem analyzed in the following section.Dock assignment was addressed by Tsui & Chang [19]. In their work, storage was not allowed, and therefore all products went directly to outbound trucks. The authors presented this case as a bilinear programming problem that attempted to minimize cranes’ travel distance.


## 1.2.2. Truck Scheduling

In the truck scheduling problem, docks are scarce, and trucks compete for that resource. It is not enough to assign a specific dock to an inbound or outbound truck. Instead, it must also be decided when to process the truck. For this reason, this kind of problem often combines the dock assignment issue with some characteristics that change, such as the number of docks, manual transport (hand pallet truck, reach crane) vs. automatic transport (conveyor belts), and whether internal storage is allowed, among others. Multi-objective truck scheduling problems have been proposed by Rahbari et al. [20]. The authors propose a bi-objective MILP model for the vehicle routing and scheduling problem with cross-docking for perishable products. Two robust models have been proposed by considering the travel time of the outbound vehicles and the products’ freshness-life as uncertain.Goodarzi et al. [21] address a multi-objective vehicle routing problem with cross-docking (VRPCD), considering truck scheduling, splitting pickup, and delivery orders with a time-windows supplier and retailer locations, optimizing the cost efficiency and responsiveness. A new bi-objective mixed-integer linear programming model is presented, and a multi-objective meta-heuristic evolutionary algorithm is proposed for solving the problem. Besides, Khorshidian et al. [22] develop a bi-objective mathematical model to integrate truck scheduling and transportation planning in a cross-docking system in a forward/reverse logistics network. A hybrid of the improved version of the augmented e-constraint method and TOPSIS is used for solving the problem.


## 1.2.3. Stacking and Individual Platforms

Several authors consider a simplified cross-docking center with a single product stacking location and a single platform to study the truck scheduling problem. In this way, the problem is reduced to the sequence of inbound and outbound trucks.Chen & Lee [23] evaluated the problem called the “two-machine cross-docking flow shop problem.” The objective is to sequence inbound and outbound trucks to minimize the makespan. This problem was modeled as a flow problem of two machines, with additional precedence constraints to ensure that an outbound truck was not processed before its predecessor tasks were completed. In Chen & Song [24], this scheduling problem was extended to a two-stage hybrid cross-docking problem. The difference in the problem was that now multiple trucks could be loaded or unloaded at the same time because the machines were considered in parallel at the inbound and outbound stages.Boysen et al. [25] considered the same type of problem with a time horizon scheme divided into discrete time intervals and assumed that trucks could be loaded or unloaded within these intervals. The problem was formulated as an integer programming model, and to solve it, a decomposition approach that considered two subproblems was proposed.


## 1.2.4. Inbound Truck Scheduling

Other papers deal with problems considering real cases, multiple platforms, and stacking places but only focus on scheduling inbound trucks. It is assumed that outbound trucks are already scheduled or assigned in a medium horizon term. In other words, the destinations of these trucks have already been previously set to the exit platforms.Rosales et al. [26] studied inbound truck assignments at a large cross-dock facility in Georgetown, Kentucky. The assignments were scheduled during a shift period, and the goal was to minimize the operating cost by providing a balanced workload for all workers. Temporary storage was allowed in this work. The authors formulated the scheduling problem as a mixed-integer programming model that included workload balancing constraints.Other authors consider the same problem but propose some dispatching rules applied to a dynamic environment. Wang & Regan [27] considered several inbound trucks waiting to be unloaded when a dock was available. Usually, the next truck to arrive should follow a first-in, first-out policy as a fair wait time rule for all trucks. However, this policy could lead to a suboptimal result in a cross-dock center. Therefore, the authors proposed two algorithms based on the time associated with a new inbound truck’s impact on the entire process (from when a product arrived on the inbound truck until it left on an outbound truck) or the total transfer time of products. Temporary storage is not allowed, and one truck is available for each destination. Stochastic approaches for this problem have been considered by Konur & Golias [28]. This paper considers scheduling inbound trucks at the doors of a cross-dock facility under truck arrival time uncertainty. The authors propose a genetic algorithm (GA) to solve the truck-to-door assignments for truck arrival times, which solves the problem by considering different scenarios according to the uncertainty of parameters.Finally, Boysen et al. [29] consider an operational truck scheduling problem, where a dock door and a start time have to be assigned to each inbound truck. A set of outbound trucks is scheduled beforehand and, therefore, departure times are fixed. Indeed, the paper introduces and formalizes a truck scheduling problem.


## 1.2.5. Inbound and Outbound Trucks Scheduling

The works analyzed above take on more relevance in real life when combined and cover the most significant number of characteristics and processes that occur within a distribution center or cross-docks. Therefore, many authors refer to the scheduling of inbound and outbound trucks to get closer to a cross’s reality dock center. For this work, the articles described below are very relevant for the considered problem.Boysen [30] addressed the problem of scheduling inbound and outbound trucks with a zero-inventory policy: temporary storage was not allowed since the work focused on handling food products with stringent cooling requirements without breaking the cold chain. The author presented several operational objectives, such as minimizing flow time, processing time, and delays of outbound trucks. Shakeri et al. [31] studied the problem of the exchange of products between trucks. The objective was to minimize the makespan of the problem. In that work, the process was described as follows: in the unloading stage, goods were unloaded and moved to temporary storage (assuming an infinite capacity); then, the products were loaded sequentially on the trucks. Loading the truck could only start if the truck had been fully unloaded and if all products to be loaded were ready in the storage area. The authors provided a mixed-integer programming (nonlinear) formulation of the problem used for small-scale instances. Li et al. [32] presented a dependency ranking search (DRS) heuristic method consisting of two parts to resolve larger problems. The first part constructed a feasible sequence of tasks concerning the number of docks, and the second part assigned those tasks to docks depending on the distances. Some computational tests showed that, for small-scale instances, the CPLEX solver performed slightly better than the DRS heuristic, but CPLEX was significantly slower. For instances of medium and large problems, CPLEX did not find feasible solutions in most cases, while the heuristic found a solution in a few minutes in more than eight of every ten instances. Enderer et al. [33] presented an integrated cross-dock-door assignment and vehicle routing problem in cross-dock terminals’ operation. The problem considers the assignments of platforms to inbound trucks and the scheduling of outbound trucks to destinations. The objective is the minimization of the total material handling and transportation costs.Thai [34] mentioned that seaports’ role is essential since these transport nodes are essential and indispensable for the effective and efficient management of products and information in the supply chain. This research issue is explored through a conceptual model of competencies constructed based on a thorough literature review and in-depth interviews validated by a survey with port personnel in Singapore and Vietnam. Saranen et al. [35] studied the purpose of providing knowledge on the transportation strategies employed in international lean oriented supply chains involving developing economies. In this work, it is essential to mention that some products (e.g., after-sales, spare parts) are requested to country-level dedicated warehouses to serve customer demands.One of the most important articles published regarding cross-docking was by Yu & Egbelu [36]. The article’s objective was to find the best “coupling sequence” or schedule for inbound and outbound trucks and minimize the total operations time or makespan. Temporary storage was permitted and occurred in front of the shipping docks. Two different solution approaches were developed to address the problem. The first approach proposed a mixed-integer programming model. In the second approach, a two-stage heuristic algorithm was developed. The first stage found the best subset of inbound trucks that were the best candidates for transferring freight to each unscheduled outbound truck. In the second stage, each unscheduled outbound truck and the associated inbound trucks were selected and scheduled.Yu [37] proposed a method to find the best docking sequences for trucks at each receiving and shipping dock and assignments of inbound and outbound trucks to docks to minimize the cross-docking system’s makespan multiple docks. The unloading sequences of products from inbound trucks, product routing, and routing sequences are also determined simultaneously. In this work, a mathematical model and two heuristic algorithms have been proposed. Stochastic approaches for the inbound and outbound truck scheduling are proposed by Heidari et al. [38]. In this paper, the problem of scheduling inbound and outbound trucks at a cross-dock facility when vehicle arrival times are unknown through a cost-stable scheduling strategy is addressed. Two meta-heuristics are used for solving the considered problem.Recently, Rijal et al. [39] and Sayed et al. [40] have considered this research’s problems. Rijal et al. [39] considered the problem of operational decisions at cross-dock facilities by including a mixed service mode when both inbound and outbound trucks can be processed at the same doors. The literature and practice often consider the truck scheduling and dock-door assignment problem sequentially or only for either inbound or outbound operations. An adaptive large neighborhood search algorithm to solve the integrated problem and find good solutions within a reasonable amount of computational effort is proposed in this work. Sayed et al. [40] addressed an integrated cross-dock door assignment and truck scheduling problem determining the assignment and scheduling of inbound trucks to inbound doors and outgoing trucks to outbound doors without considering temporal storage. The objective function is the minimization of the total time to process all trucks. Two mathematical programming formulations and two-hybrid metaheuristics are proposed to solve the problem. Finally, Guo et al. [41] proposed a parallel machine scheduling problem with job synchronization for a generic hub terminal problem synchronizing inbound and outbound flows. Two mathematical models and an efficient heuristic have been proposed for solving the considered problem.Based on the literature review, cross-docking has been the focus of many authors who have written a significant number of papers, documents, or theses in the last twenty years. Several articles deal with cross-docking in a more general way, while other documents address a specific type of problem at either the strategic or operational level. Despite this, the same authors point out that there are still many opportunities to improve and expand the research that so far exists. For example, few articles refer to cross-docking with temporary storage; although this approach tries to eradicate all storage types, it is not so in practice. Another case that the authors rarely analyze is expanding the research by considering that the same platforms could load and unload products (mixed modality), as is the case analysis of the considered problem; few documents constrains the departure date or time limit for the outbound trucks. Most of the papers analyzed assume that the platforms are located on opposite sides, and it is not considered that these platforms could be located only in one sector of the distribution center (mixed platform area). Finally, concerning real applications, Ladier & Alpan [42] have determined the gap between the proposed approaches to cross-docking problems and real case applications. The authors mentioned that the number of articles on the subject has been growing very fast but largely detached from industry practice. That work proposes a common framework that compares the literature review regarding cross-docking operations with on-field observations and platform managers׳ interviews to see whether the current state of the art matches the industry practice.This paper proposes a mathematical model in a cross-docking environment for scheduling inbound and outbound trucks that arrive at the docks. The proposed model aims to reduce the operation time of transferring products, that is, to minimize the time from when the first inbound truck arrives to unload its products until the last outbound truck leaves with its load. This time is known as the makespan. The model is tested with actual data obtained from a multinational food company in Chile, located in Concepción, and under different scenarios. The main contribution is the consideration and integration of several approaches to find a model that fits into the reality of the cross-docking operation of the companies and, at the same time, contribute other types of considerations, such as platforms located in a single sector and of mixed modality, which has been scarcely analyzed even in cross-docking research. Similarly, the real application case results measure the solution strategy’s efficiency, allowing its scalability to other companies with similar characteristics.


## 2. Problem Description and Proposed Mathematical Model

The considered problem is related to a cross-docking system and encompasses two operational procedures: reception and dispatch. The problem allows the scheduling of inbound and outbound trucks minimizing the time from when the first truck enters until the last truck leaves, known as makespan. The cross-docking system addressed in this paper works as described below.Inbound trucks arrive at the distribution center and are assigned a platform, and all unloaded products are transferred to temporary storage with two options: front of the platforms or the racks. Then, the operators consolidate on the pallets all the products that must be dispatched in a truck. Each truck’s loads are checked by a dock controller and loaded onto dispatch trucks. Once all products are loaded onto the corresponding truck, they leave the distribution center.Inbound trucks and outbound trucks must remain on the platforms until they complete their unloading or loading processes, respectively, and must leave the platform immediately when they complete their task. All trucks are assumed to be available at the beginning of the schedule or the beginning of the shift. The proposed model considers platforms located in a single area of the distribution center and serves to load and unload products. It is assumed that the total products unloaded from the inbound trucks are equal to the number of products loaded on the outbound trucks; this avoids long-term storage, although temporary storage is permitted. Product transfer from inbound trucks to outbound trucks is determined by the model and dock assignments along with inbound and outbound truck sequences. The loading and unloading time for each type of product are known as well as differences between them. The truck exchange time is the time required for a truck to leave the platform and enter another truck on the same platform, and it is assumed to be the same for inbound trucks and outbound trucks.The model’s mathematical formulation proposed to solve the truck scheduling problem in a distribution center with mixed service-mode docks is explained as follows.


### 2.1. Sets

V = trucks V=I∪O.I = inbound trucks.O = outbound trucks.P = type of product.D = number of mixed docks.S = number of temporary storage locations.


### 2.2. Parameters

fvp = number of units of product type p that are unloaded (inbound) or loaded (outbound) from truck v.PUp = unloading time of product p.PLp = loading time of product p.Qsk = capacity of temporary storage location s that is in front of dock k.Wkk′ = travel time of the products from dock k to dock k′k≠k′, through storage location s=1.TS = travel time of the products from temporary storage location s=2 to the outbound truck.TE = truck exchange time.M = a large positive number.lj = latest departure time for outbound truck j.


### 2.3. Decision Variables

#### 2.3.1. Continuous Variables

T = “makespan” or total operation time.av = arrival time of truck v at the dock.dv = departure time of truck v at the dock.


#### 2.3.2. Discrete Variables

xijps = number of units of product type p that are transferred from inbound truck i to outbound truck j, through temporary storage location s.


#### 2.3.3. Binary Variables

(1)vijs=1,if any product is transferred from inbound truck into outbound truckjthrough temporary storages,0,Otherwise.pijk=1,if truckiprecedes truckjin the sequence of inbound trucks, at dockk,0,Otherwise.qijk=1,if truckiprecedes truckjin the sequence of outbound trucks, at dockk,0,Otherwise.yik=1,if inbound truckiis assigned to dockk,0,Otherwise.zjk=1,if outbound truckjis assigned to dockk,0,Otherwise.


### 2.4. Objective Function

Minimize:T.


### 2.5. Constraints

(2)T≥dj,∀j∈O,(3)∑s=1S∑j=1Oxijps=fip,∀i∈I;∀p∈P,(4)∑s=1S∑i=1Ixijps=fjp,∀j∈O,∀p∈P,(5)xijps≤M∗vijs,∀i∈I;∀j∈O;∀p∈P;∀s∈S,(6)∑p=1Pxijps≥vijs,∀i∈I;∀j∈O;∀s∈S,(7)∑i=1I∑p=1Pxijps≤Qsk,∀j∈O;∀s∈S;∀k∈D,(8)∑j=1O∑p=1Pxijps≤Qsk,∀i∈I;∀s∈S;∀i∈I,(9)di≥ai+∑p=1Pfip∗PUp,∀i∈I,(10)dj≥aj+∑p=1Pfjp∗PLp,∀j∈O,(11)dj≤lj,∀j∈O,(12)aj≥di+TE−M∗1−∑k=1Dpijk,∀i,j∈I;i≠j,(13)aj≥di+TE−M∗1−∑k=1Dqijk,∀i,j∈O;i≠j,(14)aj≥ai+TE−M∗2−yik−zjk,∀i∈I;∀j∈O;∀k∈K,(15)aj+M∗3−vij1−yik−zjk≥di+∑p=1Pxijp1∗Wkk′,∀i∈I;∀j∈O;∀k,k′∈D,(16)aj+M∗1−vij2≥di+∑p=1Pxijp2∗TS,∀i∈I;∀j∈O,(17)∑k=1Dyik=1,∀i∈I,(18)∑k=1Dzjk=1,∀j∈O,(19)pijk+pjik≤1,∀i,j∈I;i≠j∀k∈D,(20)qijk+qjik≤1,∀i,j∈O;i≠j∀k∈D,(21)pijk+pjik≥yik+yjk−1,∀i,j∈I;i>j∀k∈D,(22)qijk+qjik≥zik+zjk−1,∀i,j∈O;i>j∀k∈D,(23)T,c,F,d,L≥0,x∈Z+∪0,v,p,q,y,z∈0,1.Constraints (2) establish a makespan greater than or equal to the time the last scheduled outbound truck departs the dock. Constraints (3) ensure the number of units of product type p transferred from inbound truck i to all outbound trucks through all temporary storage locations is equal to the number of units of product type p originally unloaded from inbound truck i. Similarly, the set of constraints (4) ensures that the number of units of product type p transferred from all inbound trucks to outbound truck j, through all temporary storage locations, equals the number of units of product p loaded on outbound truck j. Constraint (5) forces the correct relationship between integer variable xijps and binary variable vijs; it establishes that when at least one product of type p is transferred from an inbound to an outbound truck through temporary storage location s, the integer variable has a positive value and the binary variable equals 1. Constraint (6) complements constraint (5) and establishes that when there is no transfer (0 products are transferred), variable vijs does not take the value of 1 because we assume there are 0 products transferred. Constraint (7) establishes that the total number of products transferred from all inbound trucks to outbound truck j through temporary storage location s does not exceed the capacity of temporary storage location s that is in front of the dock where truck j is. Similarly, constraint (8) establishes that the total number of products transferred from inbound truck i to all outbound trucks, through temporary storage location s, does not exceed the capacity of temporary storage location s that is in front of the dock where truck i is. In short, the above constraints ensure that the quantity of products unloaded or loaded at a single dock does not exceed the capacity of the temporary storage location.Constraint (9) establishes that the departure time of inbound truck i is greater than or equal to the arrival time of the same truck plus the time to unload all products. This constraint also ensures that the inbound truck departs the dock once all its products are unloaded. Constraint (10) is similar to that one but for outbound trucks: it establishes that the departure time of outbound truck j is greater than or equal to the arrival time of that truck plus the time to load its freight. This constraint also ensures outbound truck j only leaves after all its products are loaded. Constraint (11) establishes that the departure time of outbound truck j should also be less than or equal to the latest departure time set previously.Constraint (12) establishes a valid sequence for inbound trucks. In the event an inbound truck i precedes inbound truck j at the same dock k, the arrival time of truck j will be greater than or equal to the departure time of truck i plus the time it takes to exchange trucks. Constraint (13) establishes the same relationship but for outbound trucks. In the event that inbound and outbound trucks are assigned to the same dock, constraint (14) ensures that if outbound truck j is assigned to dock k, where inbound truck i is parked, the arrival time of outbound truck j will be greater than or equal to the time when inbound truck i departs the dock plus the truck exchange time.Constraint (15) establishes that if products are transferred from inbound truck i to outbound truck j through temporary storage location s=1, and truck i is at dock k and truck j is at dock k′, then the arrival time of outbound truck j will be greater than or equal to the departure time of inbound truck i plus the transfer time of all products from dock k to k′. If both trucks are at the same dock, this transfer time is 0. Constraint (16) establishes that if products are transferred from inbound truck i to outbound truck j through temporary storage location s=2, the arrival time of outbound truck j will be greater than or equal to the departure time of inbound truck i plus the time to move the products from temporary storage location s=2 to outbound truck j. With constraints (14)–(16), it is established that inbound trucks arrive before outbound trucks. Constraints (17) and (18) ensure that each inbound truck and each outbound truck, respectively, are only assigned to one dock.Constraint (19) ensures that if inbound truck i precedes inbound truck j, then inbound truck j cannot precede truck i. Constraint (20) establishes the same relationship but for outbound trucks. Constraints (21) and (22) complement constraints (19) and (20), respectively. Constraint (21) establishes that if two inbound trucks are assigned to the same dock, then only one of them may precede the other. Constraint (22) does the same for outbound trucks. Finally, constraint (23) defines the types of decision variables considered in the model.


## 2.1. Sets

V = trucks V=I∪O.I = inbound trucks.O = outbound trucks.P = type of product.D = number of mixed docks.S = number of temporary storage locations.


## 2.2. Parameters

fvp = number of units of product type p that are unloaded (inbound) or loaded (outbound) from truck v.PUp = unloading time of product p.PLp = loading time of product p.Qsk = capacity of temporary storage location s that is in front of dock k.Wkk′ = travel time of the products from dock k to dock k′k≠k′, through storage location s=1.TS = travel time of the products from temporary storage location s=2 to the outbound truck.TE = truck exchange time.M = a large positive number.lj = latest departure time for outbound truck j.


## 2.3. Decision Variables

### 2.3.1. Continuous Variables

T = “makespan” or total operation time.av = arrival time of truck v at the dock.dv = departure time of truck v at the dock.


### 2.3.2. Discrete Variables

xijps = number of units of product type p that are transferred from inbound truck i to outbound truck j, through temporary storage location s.


### 2.3.3. Binary Variables

(1)vijs=1,if any product is transferred from inbound truck into outbound truckjthrough temporary storages,0,Otherwise.pijk=1,if truckiprecedes truckjin the sequence of inbound trucks, at dockk,0,Otherwise.qijk=1,if truckiprecedes truckjin the sequence of outbound trucks, at dockk,0,Otherwise.yik=1,if inbound truckiis assigned to dockk,0,Otherwise.zjk=1,if outbound truckjis assigned to dockk,0,Otherwise.


## 2.3.1. Continuous Variables

T = “makespan” or total operation time.av = arrival time of truck v at the dock.dv = departure time of truck v at the dock.


## 2.3.2. Discrete Variables

xijps = number of units of product type p that are transferred from inbound truck i to outbound truck j, through temporary storage location s.


## 2.3.3. Binary Variables

(1)vijs=1,if any product is transferred from inbound truck into outbound truckjthrough temporary storages,0,Otherwise.pijk=1,if truckiprecedes truckjin the sequence of inbound trucks, at dockk,0,Otherwise.qijk=1,if truckiprecedes truckjin the sequence of outbound trucks, at dockk,0,Otherwise.yik=1,if inbound truckiis assigned to dockk,0,Otherwise.zjk=1,if outbound truckjis assigned to dockk,0,Otherwise.


## 2.4. Objective Function

Minimize:T.


## 2.5. Constraints

(2)T≥dj,∀j∈O,(3)∑s=1S∑j=1Oxijps=fip,∀i∈I;∀p∈P,(4)∑s=1S∑i=1Ixijps=fjp,∀j∈O,∀p∈P,(5)xijps≤M∗vijs,∀i∈I;∀j∈O;∀p∈P;∀s∈S,(6)∑p=1Pxijps≥vijs,∀i∈I;∀j∈O;∀s∈S,(7)∑i=1I∑p=1Pxijps≤Qsk,∀j∈O;∀s∈S;∀k∈D,(8)∑j=1O∑p=1Pxijps≤Qsk,∀i∈I;∀s∈S;∀i∈I,(9)di≥ai+∑p=1Pfip∗PUp,∀i∈I,(10)dj≥aj+∑p=1Pfjp∗PLp,∀j∈O,(11)dj≤lj,∀j∈O,(12)aj≥di+TE−M∗1−∑k=1Dpijk,∀i,j∈I;i≠j,(13)aj≥di+TE−M∗1−∑k=1Dqijk,∀i,j∈O;i≠j,(14)aj≥ai+TE−M∗2−yik−zjk,∀i∈I;∀j∈O;∀k∈K,(15)aj+M∗3−vij1−yik−zjk≥di+∑p=1Pxijp1∗Wkk′,∀i∈I;∀j∈O;∀k,k′∈D,(16)aj+M∗1−vij2≥di+∑p=1Pxijp2∗TS,∀i∈I;∀j∈O,(17)∑k=1Dyik=1,∀i∈I,(18)∑k=1Dzjk=1,∀j∈O,(19)pijk+pjik≤1,∀i,j∈I;i≠j∀k∈D,(20)qijk+qjik≤1,∀i,j∈O;i≠j∀k∈D,(21)pijk+pjik≥yik+yjk−1,∀i,j∈I;i>j∀k∈D,(22)qijk+qjik≥zik+zjk−1,∀i,j∈O;i>j∀k∈D,(23)T,c,F,d,L≥0,x∈Z+∪0,v,p,q,y,z∈0,1.Constraints (2) establish a makespan greater than or equal to the time the last scheduled outbound truck departs the dock. Constraints (3) ensure the number of units of product type p transferred from inbound truck i to all outbound trucks through all temporary storage locations is equal to the number of units of product type p originally unloaded from inbound truck i. Similarly, the set of constraints (4) ensures that the number of units of product type p transferred from all inbound trucks to outbound truck j, through all temporary storage locations, equals the number of units of product p loaded on outbound truck j. Constraint (5) forces the correct relationship between integer variable xijps and binary variable vijs; it establishes that when at least one product of type p is transferred from an inbound to an outbound truck through temporary storage location s, the integer variable has a positive value and the binary variable equals 1. Constraint (6) complements constraint (5) and establishes that when there is no transfer (0 products are transferred), variable vijs does not take the value of 1 because we assume there are 0 products transferred. Constraint (7) establishes that the total number of products transferred from all inbound trucks to outbound truck j through temporary storage location s does not exceed the capacity of temporary storage location s that is in front of the dock where truck j is. Similarly, constraint (8) establishes that the total number of products transferred from inbound truck i to all outbound trucks, through temporary storage location s, does not exceed the capacity of temporary storage location s that is in front of the dock where truck i is. In short, the above constraints ensure that the quantity of products unloaded or loaded at a single dock does not exceed the capacity of the temporary storage location.Constraint (9) establishes that the departure time of inbound truck i is greater than or equal to the arrival time of the same truck plus the time to unload all products. This constraint also ensures that the inbound truck departs the dock once all its products are unloaded. Constraint (10) is similar to that one but for outbound trucks: it establishes that the departure time of outbound truck j is greater than or equal to the arrival time of that truck plus the time to load its freight. This constraint also ensures outbound truck j only leaves after all its products are loaded. Constraint (11) establishes that the departure time of outbound truck j should also be less than or equal to the latest departure time set previously.Constraint (12) establishes a valid sequence for inbound trucks. In the event an inbound truck i precedes inbound truck j at the same dock k, the arrival time of truck j will be greater than or equal to the departure time of truck i plus the time it takes to exchange trucks. Constraint (13) establishes the same relationship but for outbound trucks. In the event that inbound and outbound trucks are assigned to the same dock, constraint (14) ensures that if outbound truck j is assigned to dock k, where inbound truck i is parked, the arrival time of outbound truck j will be greater than or equal to the time when inbound truck i departs the dock plus the truck exchange time.Constraint (15) establishes that if products are transferred from inbound truck i to outbound truck j through temporary storage location s=1, and truck i is at dock k and truck j is at dock k′, then the arrival time of outbound truck j will be greater than or equal to the departure time of inbound truck i plus the transfer time of all products from dock k to k′. If both trucks are at the same dock, this transfer time is 0. Constraint (16) establishes that if products are transferred from inbound truck i to outbound truck j through temporary storage location s=2, the arrival time of outbound truck j will be greater than or equal to the departure time of inbound truck i plus the time to move the products from temporary storage location s=2 to outbound truck j. With constraints (14)–(16), it is established that inbound trucks arrive before outbound trucks. Constraints (17) and (18) ensure that each inbound truck and each outbound truck, respectively, are only assigned to one dock.Constraint (19) ensures that if inbound truck i precedes inbound truck j, then inbound truck j cannot precede truck i. Constraint (20) establishes the same relationship but for outbound trucks. Constraints (21) and (22) complement constraints (19) and (20), respectively. Constraint (21) establishes that if two inbound trucks are assigned to the same dock, then only one of them may precede the other. Constraint (22) does the same for outbound trucks. Finally, constraint (23) defines the types of decision variables considered in the model.


## 3. Results

### 3.1. Case Study

The proposed approach has been tested with actual data obtained from a multinational food company in Chile, located in the Bio-Bio region. Currently, the integrated distribution center (IDC) of the company supplies supermarket chains such as Walmart, SMU (Unimarc, Mayorista 10), and Cencosud, which are its wholesale customers, and other customers that are its retail-type customers (businesses, grocery stores, minimarkets, etc.). The products distributed are divided into four categories: Traditional or Food, Beverages, and Dairy (FBD), including products such as coffee, breakfast cereals, milk, candy, and culinary products. The Ice Cream category is for brand products Savory and Chamonix. The Refrigerated category is for yogurts and desserts. The Pet Care category is for pet food, including brands like Purina, Dog-Chow, and Doko. It is found that the supply and distribution trucks arrive at the IDC arbitrarily within the operational processes. Therefore, it is necessary to establish a schedule for the supply and dispatch trucks to reduce the trucks’ loading and unloading time windows.Since this is the only distribution center in Chile that works with four product categories in which each has different brands and, in each brand, there are other formats, it is complex to manage tasks in an eight-hour shift, such as receiving, classifying, storing, and shipping a variety of orders to customers. For that reason, one of the problems identified in high-demand months, such as December, is that overtime work is quadruple that of low-demand months, such as March. This excess of overtime is mainly due to inadequate coordination between internal warehouse operations and inbound trucks, which arrive arbitrarily at the IDC without any schedule or timetable.This truck scheduling deficiency also causes delay fees due to the inability to unload certain inbound trucks when these arrive at the IDC. These situations occur daily, and the company has to send inbound trucks “on tour”; that is, the truck has to wait somewhere else because there is not enough space in the maneuvering area, and the 11 docks that are busy otherwise cannot be used for work operations. A similar situation is when outbound trucks must wait in the maneuvering area because the products of their routes are not ready to be loaded or when orders ready to be shipped occupy space in the loading area because the truck assigned to deliver those orders has not arrived at the IDC.Many of these scenarios that involve inbound and outbound trucks occur because the docks are located in one area of the warehouse and are used for loading and unloading trucks (mixed service mode), unlike most distribution centers analyzed in the literature, which have docks exclusively dedicated to loading and others dedicated to unloading and are usually “I”-shaped and located on opposite sides of the warehouse [16].The IDC currently has two exclusive docks for loading and unloading Ice Cream products (docks 1 and 2, see Figure1) and a dock exclusively for Refrigerated and RCC products (Refrigerated products that are dispatched to others customers different from supermarkets) (dock 3). However, there is the flexibility to use a dock for Ice Cream to load Refrigerated products and vice versa. The FBD warehouse has six docks (docks 4 through 9) that are exclusively for loading and unloading Traditional or FBD products and Beverage and Pet Care products. For a future scenario in which a new Ice Cream chamber will be operational (area in green of Figure 1), tests are being run where there are three exclusive docks for Refrigerated and RCC products (docks 1 through 3) and two exclusive docks for Ice Cream products (docks 10 and 11).Figure 1
Structural warehouse layout, Concepción IDC, section: operations warehouse (source: emergency layout, Concepción IDC).


### 3.2. Obtained Results

This section presents the proposed model results and evaluates real scenarios in the IDC’s operational shifts. Besides, since there are no studies that resemble the IDC characteristics, exploratory factor analysis is carried out to validate whether the model delivers, within a reasonable time, feasible results of the makespan’s behavior when its parameters change. Mainly, one parameter value is changed at a time while the others remain constant. For the exploratory factor analysis, four parameters are evaluated: inbound trucks (I), outbound trucks (O), number of products (P), and number of docks (D). The instances were solved by setting three of the four parameters with a value of 5. The other parameter takes values between 1 and 21 to carry out the experimental analysis and test the proposed model’s efficiency. For example, for the first execution, I, O, and P are set to 5, and D varies from 1 to 21. For the subsequent execution, I, O, and D are set to 5, and P ranges from 1 to 21, and so on. Finally, the best results are chosen.Maximum runtime of 9000 seconds (2.5 hours) is established to obtain the results presented in this chapter. All instances are run using the mathematical modeling software AMPL (version 20180308), and the results obtained are compared to those of the CPLEX and Gurobi solvers on a computer with Intel Xeon CPU processor E5-2660, 48 GB RAM, and the Red Hat Enterprise Linux 7 operating system.Extensive tests were performed on three rotating shifts of operation of the IDC. Similarly, tests were run for the current scenario and a future scenario where the number of trucks changes in some cases and the number of docks changes in other cases. Tests were done for B shift, which runs between 15 : 00 and 23 : 00. In the first test, three inbound trucks arrive and 15 trucks are dispatched. In the second test, four trucks arrive, and 17 are dispatched. The types of products handled are FBD, Beverages, and Pet Care. Both tests were done to determine how many docks are needed to obtain a schedule with minimal makespan. For C shift, which is between 23 : 00 and 07 : 00, two tests were also performed, although this time the number of available docks changes because, in a future scenario, the Ice Cream chamber moves to a different area in the warehouse and frees the current Ice Cream chamber for increased capacity of the Refrigeration chamber. In each category, one inbound truck arrives. In the Ice Cream category, 19 trucks are dispatched, and in the Refrigerated category, 17 trucks are dispatched, of which 12 go to wholesale customers such as supermarkets and five to retail customers (RCC).


#### 3.2.1. Factor Analysis

Once all tests with the variation of each parameter have been analyzed, it can be said that, in general, the model delivers optimal solutions in a few seconds when parameter values remain close to each other, for example, four inbound trucks, six outbound trucks, and five docks. These three parameters (I, O, D) have the most influence on makespan; the number of types of products (P) is negligible since it will depend on each product’s characteristics and not on how many types are being handled. However, when loading and/or unloading times are different between the types of products (P), it is not recommended to load more than three different types of products on the same truck since that would cause significant makespan variation.Therefore, a minimum makespan is obtained when products are distributed equally in the fewest possible trucks, both inbound and outbound, and consequently, the consolidation of products in few trucks must be prioritized over the diversification of products in many trucks. The makespan will also decrease as the number of docks increases, but after the minimum time required for the operation with a certain number of docks is reached, or if there is a critical route in the schedule, the makespan will have the minimum value obtained above or the value of the critical route, and it will keep that value even if the number of docks is increased.


#### 3.2.2. B Shift Results

For the current state, the minimum makespan with one and two docks available exceeds the duration of a shift (420 minutes), so this is not a feasible solution. With three docks available, a feasible solution of 338 minutes is obtained. This solution is not optimal since both solvers require the maximum run time of 9000 seconds to obtain this makespan, as it did for the two previous cases. Changing from three to four docks causes a makespan decrease of 68.9 minutes.When four, five, or six docks are available, a minimum makespan of 269.1 minutes is obtained. Thus, multiple optimal solutions can be found with more docks available. This fact seems to suggest that workflows with four, five, and six docks are equal but based on what is seen in each schedule and the opinion of experts, the best would be to schedule trucks with five docks; this allows for a larger slack time between trucks than scheduling four docks. This slack time between trucks’ exchange could be two or three times the current slack time, set at 10 minutes. This fact would result in a more flexible schedule for the warehouse’s operational work, and one dock would also be available for eventualities such as truck delays or the arrival of an extra truck. Table1 summarizes the obtained results by using CPLEX and Gurobi.Table 1
Obtained results for the current B shift.
Number of platformsMakespan (min)Lower bound (min)Gap (%)CPU time (sec)CPLEX11034.3691.633.139000.002512.1337.834.049000.003338.1254.121.899000.004269.1269.10.004.415269.1269.10.003.006269.1269.10.003.90Gurobi11034.3756.4426.869000.002512.1282.3244.879000.003338269.120.389000.004269.1269.10.004.525269.1269.10.002.396269.1269.10.001.91Source: owner.When tests are performed for a future scenario with more trucks (one inbound and two outbound), the minimum makespan is 269.1 minutes with five or six docks. With four docks, the makespan increases to 315.2 minutes, 46 minutes longer than five docks, which might not be relevant. However, considering the opinion of experts, this is a considerable amount of time and is quite important because this difference determines whether workers have to stay an extra hour. Additionally, considering that 16 people work in the area of operations on this shift, the company could save the monthly salary of one worker only by avoiding an extra hour of B shift. With six docks, the makespan is the same as five; however, five docks would recommend this schedule since it leaves one dock available if there are any problems during the shift’s operations. It is important to mention that the experts also point out that saving 45 minutes or more justifies using another dock for scheduling trucks because, according to the variability of this time in the schedule, it could easily result in an extra hour of work. Table2 shows the results for the future scenario by using CPLEX and Gurobi.Table 2
Obtained results for the future scenario B shift.
Number of platformsMakespan (min)Lower bound (min)Gap (%)CPU time (sec)CPLEX11290.60766.740.599000.002640.2312.1751.249000.003419264.136.979000.004315.2264.116.219000.005269.1264.11.8611.896269.1264.11.866.27Gurobi11290.60815.236.805331.002640.2279.156.409000.203418.52267.0236.209000.204315.4269.114.689000.205269.1265.491.3415.86269.1268.950.057.53Source: owner.


#### 3.2.3. C Shift Results

For the current scenario, the instances evaluated include all trucks assigned to any of the three docks (instance 1), sharing docks 2 and 3 (instance 2), and each product category with its corresponding docks (instance 3). After the results were obtained, instance 3 was discarded because its makespan exceeds the available time in a shift. Instance 1 has a makespan three minutes shorter than instance 2. The latter is chosen because it prevents refrigerated products from being shipped from dock 1 (instance 1), which is the farthest from the Refrigerated chamber, and so the product travel time is more significant. However, the travel time of Refrigerated products should be minimized because having the product outside the recommended environment or in transit for a long time should be avoided not to break the cold chain. Instance 2 also allows a lesser crossover of products, fewer temperature changes for workers walking with products through the two chambers, and fewer errors in the transfer from trucks to warehouses and vice versa. In the results of instance 2, outbound trucks with Refrigerated and RCC products depart right at their time limit of 360 minutes after operations start, and the last Ice Cream trucks depart only 12 minutes later. For this reason, it is recommended to prioritize Refrigerated and RCC trucks since Ice Cream trucks, according to the schedule, have 50 more minutes of slack time to be dispatched within the shift. Table3 shows the obtained results for the current scenario of the C shift.Table 3
Obtained results for the current C shift.
InstanceMakespan (min)Lower bound (min)Gap (%)CPU time (sec)CPLEX1369.3160.956.439000.002372.5180.4951.559000.003594.2351.2340.899000.00Gurobi1367.47161.0856.169000.002370.5198.346.489000.003594.2422.328.939000.00Source: owner.For a future scenario with the new arrangement of the Ice Cream and Refrigerated chambers, both categories see benefits. In the previous case, when the Refrigerated chamber only had one exclusive dock and used one dock from the Ice Cream chamber, trucks departed right at the time limit, which was at six hours of operations or 360 minutes. With the new chambers, there are three docks available only for the Refrigerated category and RCC subcategory, letting the makespan decrease by 81.7 minutes for a total of 278.3 minutes, which is enough time to dispatch all trucks in this category before the time limit and without pressing the operations. The makespan of the Ice Cream category also decreases thanks to having two exclusive docks. In the previous case, the last trucks were dispatched in 372.5 minutes; with the new chambers, the makespan decreases by almost two hours, for a minimum makespan of 253.9 minutes.The main benefit for both categories is makespan reduction since operation time decreases considerably in both. For the company, this also means not paying overtime because, considering that 21 people work on the C shift, just by not asking workers to stay over two hours (which can be saved with this new schedule), the company could save two to three times the monthly salary of a worker each time C shift does not work overtime. Finally, the improved schedules for both shifts reduce the makespan, prevent sending trucks “on tour,” and reduce delay fees paid by the IDC to transport companies. Tables4 and 5 summarize the future scenario for C Shift.Table 4
Obtained results for the future scenario of ice cream in C shift.
Number of platformsMakespan (min)Lower bound (min)Gap (%)CPU time (sec)CPLEX1737.00442.5739.959000.002363.90249.1031.559000.003263.90245.107.129000.004245.10245.100.001.265245.10245.100.001.746245.10245.100.001.697245.10245.100.001.869245.10245.100.003.1612245.10245.100.003.0315245.10245.100.004.5618245.10245.100.005.119245.10245.100.005.721245.10245.100.0011.29Gurobi1737.00515.4030.079000.002363.90245.1032.659000.003264.30245.107.269000.004245.10245.100.001.745245.10245.100.003.256245.10245.100.001.037245.10245.100.002.139245.10245.100.003.3512245.10245.100.004.7815245.10245.100.005.3718245.10245.100.005.1319245.10245.100.0010.421245.10245.100.008.01Source: owner.Table 5
Obtained results for the future scenario of refrigerated products in C shift.
Number of platformsMakespan (min)Lower bound (min)Gap (%)CPU time (sec)11033.10691.8533.039000.002511.70313.9638.649000.003380.90295.9022.329000.004315.10295.906.099000.005295.90295.900.003.56295.90295.900.003.837295.90295.900.002.069295.90295.900.002.4612295.90295.900.005.1415295.90295.900.003.1118295.90295.900.005.1321295.90295.900.0010.6711033.10760.0026.409702511.70297.7741.819000.003381.70295.9022.479000.004315.90295.906.339000.005295.90295.900.003.166295.90295.900.003.057295.90295.900.003.379295.90295.900.004.1412295.90295.900.0010.2715295.90295.900.0018.2518295.90295.900.0023.1421295.90295.900.0030.83Source: owner.


## 3.1. Case Study

The proposed approach has been tested with actual data obtained from a multinational food company in Chile, located in the Bio-Bio region. Currently, the integrated distribution center (IDC) of the company supplies supermarket chains such as Walmart, SMU (Unimarc, Mayorista 10), and Cencosud, which are its wholesale customers, and other customers that are its retail-type customers (businesses, grocery stores, minimarkets, etc.). The products distributed are divided into four categories: Traditional or Food, Beverages, and Dairy (FBD), including products such as coffee, breakfast cereals, milk, candy, and culinary products. The Ice Cream category is for brand products Savory and Chamonix. The Refrigerated category is for yogurts and desserts. The Pet Care category is for pet food, including brands like Purina, Dog-Chow, and Doko. It is found that the supply and distribution trucks arrive at the IDC arbitrarily within the operational processes. Therefore, it is necessary to establish a schedule for the supply and dispatch trucks to reduce the trucks’ loading and unloading time windows.Since this is the only distribution center in Chile that works with four product categories in which each has different brands and, in each brand, there are other formats, it is complex to manage tasks in an eight-hour shift, such as receiving, classifying, storing, and shipping a variety of orders to customers. For that reason, one of the problems identified in high-demand months, such as December, is that overtime work is quadruple that of low-demand months, such as March. This excess of overtime is mainly due to inadequate coordination between internal warehouse operations and inbound trucks, which arrive arbitrarily at the IDC without any schedule or timetable.This truck scheduling deficiency also causes delay fees due to the inability to unload certain inbound trucks when these arrive at the IDC. These situations occur daily, and the company has to send inbound trucks “on tour”; that is, the truck has to wait somewhere else because there is not enough space in the maneuvering area, and the 11 docks that are busy otherwise cannot be used for work operations. A similar situation is when outbound trucks must wait in the maneuvering area because the products of their routes are not ready to be loaded or when orders ready to be shipped occupy space in the loading area because the truck assigned to deliver those orders has not arrived at the IDC.Many of these scenarios that involve inbound and outbound trucks occur because the docks are located in one area of the warehouse and are used for loading and unloading trucks (mixed service mode), unlike most distribution centers analyzed in the literature, which have docks exclusively dedicated to loading and others dedicated to unloading and are usually “I”-shaped and located on opposite sides of the warehouse [16].The IDC currently has two exclusive docks for loading and unloading Ice Cream products (docks 1 and 2, see Figure1) and a dock exclusively for Refrigerated and RCC products (Refrigerated products that are dispatched to others customers different from supermarkets) (dock 3). However, there is the flexibility to use a dock for Ice Cream to load Refrigerated products and vice versa. The FBD warehouse has six docks (docks 4 through 9) that are exclusively for loading and unloading Traditional or FBD products and Beverage and Pet Care products. For a future scenario in which a new Ice Cream chamber will be operational (area in green of Figure 1), tests are being run where there are three exclusive docks for Refrigerated and RCC products (docks 1 through 3) and two exclusive docks for Ice Cream products (docks 10 and 11).Figure 1
Structural warehouse layout, Concepción IDC, section: operations warehouse (source: emergency layout, Concepción IDC).


## 3.2. Obtained Results

This section presents the proposed model results and evaluates real scenarios in the IDC’s operational shifts. Besides, since there are no studies that resemble the IDC characteristics, exploratory factor analysis is carried out to validate whether the model delivers, within a reasonable time, feasible results of the makespan’s behavior when its parameters change. Mainly, one parameter value is changed at a time while the others remain constant. For the exploratory factor analysis, four parameters are evaluated: inbound trucks (I), outbound trucks (O), number of products (P), and number of docks (D). The instances were solved by setting three of the four parameters with a value of 5. The other parameter takes values between 1 and 21 to carry out the experimental analysis and test the proposed model’s efficiency. For example, for the first execution, I, O, and P are set to 5, and D varies from 1 to 21. For the subsequent execution, I, O, and D are set to 5, and P ranges from 1 to 21, and so on. Finally, the best results are chosen.Maximum runtime of 9000 seconds (2.5 hours) is established to obtain the results presented in this chapter. All instances are run using the mathematical modeling software AMPL (version 20180308), and the results obtained are compared to those of the CPLEX and Gurobi solvers on a computer with Intel Xeon CPU processor E5-2660, 48 GB RAM, and the Red Hat Enterprise Linux 7 operating system.Extensive tests were performed on three rotating shifts of operation of the IDC. Similarly, tests were run for the current scenario and a future scenario where the number of trucks changes in some cases and the number of docks changes in other cases. Tests were done for B shift, which runs between 15 : 00 and 23 : 00. In the first test, three inbound trucks arrive and 15 trucks are dispatched. In the second test, four trucks arrive, and 17 are dispatched. The types of products handled are FBD, Beverages, and Pet Care. Both tests were done to determine how many docks are needed to obtain a schedule with minimal makespan. For C shift, which is between 23 : 00 and 07 : 00, two tests were also performed, although this time the number of available docks changes because, in a future scenario, the Ice Cream chamber moves to a different area in the warehouse and frees the current Ice Cream chamber for increased capacity of the Refrigeration chamber. In each category, one inbound truck arrives. In the Ice Cream category, 19 trucks are dispatched, and in the Refrigerated category, 17 trucks are dispatched, of which 12 go to wholesale customers such as supermarkets and five to retail customers (RCC).


### 3.2.1. Factor Analysis

Once all tests with the variation of each parameter have been analyzed, it can be said that, in general, the model delivers optimal solutions in a few seconds when parameter values remain close to each other, for example, four inbound trucks, six outbound trucks, and five docks. These three parameters (I, O, D) have the most influence on makespan; the number of types of products (P) is negligible since it will depend on each product’s characteristics and not on how many types are being handled. However, when loading and/or unloading times are different between the types of products (P), it is not recommended to load more than three different types of products on the same truck since that would cause significant makespan variation.Therefore, a minimum makespan is obtained when products are distributed equally in the fewest possible trucks, both inbound and outbound, and consequently, the consolidation of products in few trucks must be prioritized over the diversification of products in many trucks. The makespan will also decrease as the number of docks increases, but after the minimum time required for the operation with a certain number of docks is reached, or if there is a critical route in the schedule, the makespan will have the minimum value obtained above or the value of the critical route, and it will keep that value even if the number of docks is increased.


### 3.2.2. B Shift Results

For the current state, the minimum makespan with one and two docks available exceeds the duration of a shift (420 minutes), so this is not a feasible solution. With three docks available, a feasible solution of 338 minutes is obtained. This solution is not optimal since both solvers require the maximum run time of 9000 seconds to obtain this makespan, as it did for the two previous cases. Changing from three to four docks causes a makespan decrease of 68.9 minutes.When four, five, or six docks are available, a minimum makespan of 269.1 minutes is obtained. Thus, multiple optimal solutions can be found with more docks available. This fact seems to suggest that workflows with four, five, and six docks are equal but based on what is seen in each schedule and the opinion of experts, the best would be to schedule trucks with five docks; this allows for a larger slack time between trucks than scheduling four docks. This slack time between trucks’ exchange could be two or three times the current slack time, set at 10 minutes. This fact would result in a more flexible schedule for the warehouse’s operational work, and one dock would also be available for eventualities such as truck delays or the arrival of an extra truck. Table1 summarizes the obtained results by using CPLEX and Gurobi.Table 1
Obtained results for the current B shift.
Number of platformsMakespan (min)Lower bound (min)Gap (%)CPU time (sec)CPLEX11034.3691.633.139000.002512.1337.834.049000.003338.1254.121.899000.004269.1269.10.004.415269.1269.10.003.006269.1269.10.003.90Gurobi11034.3756.4426.869000.002512.1282.3244.879000.003338269.120.389000.004269.1269.10.004.525269.1269.10.002.396269.1269.10.001.91Source: owner.When tests are performed for a future scenario with more trucks (one inbound and two outbound), the minimum makespan is 269.1 minutes with five or six docks. With four docks, the makespan increases to 315.2 minutes, 46 minutes longer than five docks, which might not be relevant. However, considering the opinion of experts, this is a considerable amount of time and is quite important because this difference determines whether workers have to stay an extra hour. Additionally, considering that 16 people work in the area of operations on this shift, the company could save the monthly salary of one worker only by avoiding an extra hour of B shift. With six docks, the makespan is the same as five; however, five docks would recommend this schedule since it leaves one dock available if there are any problems during the shift’s operations. It is important to mention that the experts also point out that saving 45 minutes or more justifies using another dock for scheduling trucks because, according to the variability of this time in the schedule, it could easily result in an extra hour of work. Table2 shows the results for the future scenario by using CPLEX and Gurobi.Table 2
Obtained results for the future scenario B shift.
Number of platformsMakespan (min)Lower bound (min)Gap (%)CPU time (sec)CPLEX11290.60766.740.599000.002640.2312.1751.249000.003419264.136.979000.004315.2264.116.219000.005269.1264.11.8611.896269.1264.11.866.27Gurobi11290.60815.236.805331.002640.2279.156.409000.203418.52267.0236.209000.204315.4269.114.689000.205269.1265.491.3415.86269.1268.950.057.53Source: owner.


### 3.2.3. C Shift Results

For the current scenario, the instances evaluated include all trucks assigned to any of the three docks (instance 1), sharing docks 2 and 3 (instance 2), and each product category with its corresponding docks (instance 3). After the results were obtained, instance 3 was discarded because its makespan exceeds the available time in a shift. Instance 1 has a makespan three minutes shorter than instance 2. The latter is chosen because it prevents refrigerated products from being shipped from dock 1 (instance 1), which is the farthest from the Refrigerated chamber, and so the product travel time is more significant. However, the travel time of Refrigerated products should be minimized because having the product outside the recommended environment or in transit for a long time should be avoided not to break the cold chain. Instance 2 also allows a lesser crossover of products, fewer temperature changes for workers walking with products through the two chambers, and fewer errors in the transfer from trucks to warehouses and vice versa. In the results of instance 2, outbound trucks with Refrigerated and RCC products depart right at their time limit of 360 minutes after operations start, and the last Ice Cream trucks depart only 12 minutes later. For this reason, it is recommended to prioritize Refrigerated and RCC trucks since Ice Cream trucks, according to the schedule, have 50 more minutes of slack time to be dispatched within the shift. Table3 shows the obtained results for the current scenario of the C shift.Table 3
Obtained results for the current C shift.
InstanceMakespan (min)Lower bound (min)Gap (%)CPU time (sec)CPLEX1369.3160.956.439000.002372.5180.4951.559000.003594.2351.2340.899000.00Gurobi1367.47161.0856.169000.002370.5198.346.489000.003594.2422.328.939000.00Source: owner.For a future scenario with the new arrangement of the Ice Cream and Refrigerated chambers, both categories see benefits. In the previous case, when the Refrigerated chamber only had one exclusive dock and used one dock from the Ice Cream chamber, trucks departed right at the time limit, which was at six hours of operations or 360 minutes. With the new chambers, there are three docks available only for the Refrigerated category and RCC subcategory, letting the makespan decrease by 81.7 minutes for a total of 278.3 minutes, which is enough time to dispatch all trucks in this category before the time limit and without pressing the operations. The makespan of the Ice Cream category also decreases thanks to having two exclusive docks. In the previous case, the last trucks were dispatched in 372.5 minutes; with the new chambers, the makespan decreases by almost two hours, for a minimum makespan of 253.9 minutes.The main benefit for both categories is makespan reduction since operation time decreases considerably in both. For the company, this also means not paying overtime because, considering that 21 people work on the C shift, just by not asking workers to stay over two hours (which can be saved with this new schedule), the company could save two to three times the monthly salary of a worker each time C shift does not work overtime. Finally, the improved schedules for both shifts reduce the makespan, prevent sending trucks “on tour,” and reduce delay fees paid by the IDC to transport companies. Tables4 and 5 summarize the future scenario for C Shift.Table 4
Obtained results for the future scenario of ice cream in C shift.
Number of platformsMakespan (min)Lower bound (min)Gap (%)CPU time (sec)CPLEX1737.00442.5739.959000.002363.90249.1031.559000.003263.90245.107.129000.004245.10245.100.001.265245.10245.100.001.746245.10245.100.001.697245.10245.100.001.869245.10245.100.003.1612245.10245.100.003.0315245.10245.100.004.5618245.10245.100.005.119245.10245.100.005.721245.10245.100.0011.29Gurobi1737.00515.4030.079000.002363.90245.1032.659000.003264.30245.107.269000.004245.10245.100.001.745245.10245.100.003.256245.10245.100.001.037245.10245.100.002.139245.10245.100.003.3512245.10245.100.004.7815245.10245.100.005.3718245.10245.100.005.1319245.10245.100.0010.421245.10245.100.008.01Source: owner.Table 5
Obtained results for the future scenario of refrigerated products in C shift.
Number of platformsMakespan (min)Lower bound (min)Gap (%)CPU time (sec)11033.10691.8533.039000.002511.70313.9638.649000.003380.90295.9022.329000.004315.10295.906.099000.005295.90295.900.003.56295.90295.900.003.837295.90295.900.002.069295.90295.900.002.4612295.90295.900.005.1415295.90295.900.003.1118295.90295.900.005.1321295.90295.900.0010.6711033.10760.0026.409702511.70297.7741.819000.003381.70295.9022.479000.004315.90295.906.339000.005295.90295.900.003.166295.90295.900.003.057295.90295.900.003.379295.90295.900.004.1412295.90295.900.0010.2715295.90295.900.0018.2518295.90295.900.0023.1421295.90295.900.0030.83Source: owner.


## 3.2.1. Factor Analysis

Once all tests with the variation of each parameter have been analyzed, it can be said that, in general, the model delivers optimal solutions in a few seconds when parameter values remain close to each other, for example, four inbound trucks, six outbound trucks, and five docks. These three parameters (I, O, D) have the most influence on makespan; the number of types of products (P) is negligible since it will depend on each product’s characteristics and not on how many types are being handled. However, when loading and/or unloading times are different between the types of products (P), it is not recommended to load more than three different types of products on the same truck since that would cause significant makespan variation.Therefore, a minimum makespan is obtained when products are distributed equally in the fewest possible trucks, both inbound and outbound, and consequently, the consolidation of products in few trucks must be prioritized over the diversification of products in many trucks. The makespan will also decrease as the number of docks increases, but after the minimum time required for the operation with a certain number of docks is reached, or if there is a critical route in the schedule, the makespan will have the minimum value obtained above or the value of the critical route, and it will keep that value even if the number of docks is increased.


## 3.2.2. B Shift Results

For the current state, the minimum makespan with one and two docks available exceeds the duration of a shift (420 minutes), so this is not a feasible solution. With three docks available, a feasible solution of 338 minutes is obtained. This solution is not optimal since both solvers require the maximum run time of 9000 seconds to obtain this makespan, as it did for the two previous cases. Changing from three to four docks causes a makespan decrease of 68.9 minutes.When four, five, or six docks are available, a minimum makespan of 269.1 minutes is obtained. Thus, multiple optimal solutions can be found with more docks available. This fact seems to suggest that workflows with four, five, and six docks are equal but based on what is seen in each schedule and the opinion of experts, the best would be to schedule trucks with five docks; this allows for a larger slack time between trucks than scheduling four docks. This slack time between trucks’ exchange could be two or three times the current slack time, set at 10 minutes. This fact would result in a more flexible schedule for the warehouse’s operational work, and one dock would also be available for eventualities such as truck delays or the arrival of an extra truck. Table1 summarizes the obtained results by using CPLEX and Gurobi.Table 1
Obtained results for the current B shift.
Number of platformsMakespan (min)Lower bound (min)Gap (%)CPU time (sec)CPLEX11034.3691.633.139000.002512.1337.834.049000.003338.1254.121.899000.004269.1269.10.004.415269.1269.10.003.006269.1269.10.003.90Gurobi11034.3756.4426.869000.002512.1282.3244.879000.003338269.120.389000.004269.1269.10.004.525269.1269.10.002.396269.1269.10.001.91Source: owner.When tests are performed for a future scenario with more trucks (one inbound and two outbound), the minimum makespan is 269.1 minutes with five or six docks. With four docks, the makespan increases to 315.2 minutes, 46 minutes longer than five docks, which might not be relevant. However, considering the opinion of experts, this is a considerable amount of time and is quite important because this difference determines whether workers have to stay an extra hour. Additionally, considering that 16 people work in the area of operations on this shift, the company could save the monthly salary of one worker only by avoiding an extra hour of B shift. With six docks, the makespan is the same as five; however, five docks would recommend this schedule since it leaves one dock available if there are any problems during the shift’s operations. It is important to mention that the experts also point out that saving 45 minutes or more justifies using another dock for scheduling trucks because, according to the variability of this time in the schedule, it could easily result in an extra hour of work. Table2 shows the results for the future scenario by using CPLEX and Gurobi.Table 2
Obtained results for the future scenario B shift.
Number of platformsMakespan (min)Lower bound (min)Gap (%)CPU time (sec)CPLEX11290.60766.740.599000.002640.2312.1751.249000.003419264.136.979000.004315.2264.116.219000.005269.1264.11.8611.896269.1264.11.866.27Gurobi11290.60815.236.805331.002640.2279.156.409000.203418.52267.0236.209000.204315.4269.114.689000.205269.1265.491.3415.86269.1268.950.057.53Source: owner.


## 3.2.3. C Shift Results

For the current scenario, the instances evaluated include all trucks assigned to any of the three docks (instance 1), sharing docks 2 and 3 (instance 2), and each product category with its corresponding docks (instance 3). After the results were obtained, instance 3 was discarded because its makespan exceeds the available time in a shift. Instance 1 has a makespan three minutes shorter than instance 2. The latter is chosen because it prevents refrigerated products from being shipped from dock 1 (instance 1), which is the farthest from the Refrigerated chamber, and so the product travel time is more significant. However, the travel time of Refrigerated products should be minimized because having the product outside the recommended environment or in transit for a long time should be avoided not to break the cold chain. Instance 2 also allows a lesser crossover of products, fewer temperature changes for workers walking with products through the two chambers, and fewer errors in the transfer from trucks to warehouses and vice versa. In the results of instance 2, outbound trucks with Refrigerated and RCC products depart right at their time limit of 360 minutes after operations start, and the last Ice Cream trucks depart only 12 minutes later. For this reason, it is recommended to prioritize Refrigerated and RCC trucks since Ice Cream trucks, according to the schedule, have 50 more minutes of slack time to be dispatched within the shift. Table3 shows the obtained results for the current scenario of the C shift.Table 3
Obtained results for the current C shift.
InstanceMakespan (min)Lower bound (min)Gap (%)CPU time (sec)CPLEX1369.3160.956.439000.002372.5180.4951.559000.003594.2351.2340.899000.00Gurobi1367.47161.0856.169000.002370.5198.346.489000.003594.2422.328.939000.00Source: owner.For a future scenario with the new arrangement of the Ice Cream and Refrigerated chambers, both categories see benefits. In the previous case, when the Refrigerated chamber only had one exclusive dock and used one dock from the Ice Cream chamber, trucks departed right at the time limit, which was at six hours of operations or 360 minutes. With the new chambers, there are three docks available only for the Refrigerated category and RCC subcategory, letting the makespan decrease by 81.7 minutes for a total of 278.3 minutes, which is enough time to dispatch all trucks in this category before the time limit and without pressing the operations. The makespan of the Ice Cream category also decreases thanks to having two exclusive docks. In the previous case, the last trucks were dispatched in 372.5 minutes; with the new chambers, the makespan decreases by almost two hours, for a minimum makespan of 253.9 minutes.The main benefit for both categories is makespan reduction since operation time decreases considerably in both. For the company, this also means not paying overtime because, considering that 21 people work on the C shift, just by not asking workers to stay over two hours (which can be saved with this new schedule), the company could save two to three times the monthly salary of a worker each time C shift does not work overtime. Finally, the improved schedules for both shifts reduce the makespan, prevent sending trucks “on tour,” and reduce delay fees paid by the IDC to transport companies. Tables4 and 5 summarize the future scenario for C Shift.Table 4
Obtained results for the future scenario of ice cream in C shift.
Number of platformsMakespan (min)Lower bound (min)Gap (%)CPU time (sec)CPLEX1737.00442.5739.959000.002363.90249.1031.559000.003263.90245.107.129000.004245.10245.100.001.265245.10245.100.001.746245.10245.100.001.697245.10245.100.001.869245.10245.100.003.1612245.10245.100.003.0315245.10245.100.004.5618245.10245.100.005.119245.10245.100.005.721245.10245.100.0011.29Gurobi1737.00515.4030.079000.002363.90245.1032.659000.003264.30245.107.269000.004245.10245.100.001.745245.10245.100.003.256245.10245.100.001.037245.10245.100.002.139245.10245.100.003.3512245.10245.100.004.7815245.10245.100.005.3718245.10245.100.005.1319245.10245.100.0010.421245.10245.100.008.01Source: owner.Table 5
Obtained results for the future scenario of refrigerated products in C shift.
Number of platformsMakespan (min)Lower bound (min)Gap (%)CPU time (sec)11033.10691.8533.039000.002511.70313.9638.649000.003380.90295.9022.329000.004315.10295.906.099000.005295.90295.900.003.56295.90295.900.003.837295.90295.900.002.069295.90295.900.002.4612295.90295.900.005.1415295.90295.900.003.1118295.90295.900.005.1321295.90295.900.0010.6711033.10760.0026.409702511.70297.7741.819000.003381.70295.9022.479000.004315.90295.906.339000.005295.90295.900.003.166295.90295.900.003.057295.90295.900.003.379295.90295.900.004.1412295.90295.900.0010.2715295.90295.900.0018.2518295.90295.900.0023.1421295.90295.900.0030.83Source: owner.


## 4. Concluding Remarks and Future Directions

The problem solved is associated with a cross-docking system, focused on the trucks’ scheduling, excluding the warehouse’s internal operational tasks. The scheduling minimizes the total operating time, ranging from when the first truck enters until the last dispatch truck leaves, also known as “makespan.” The results obtained make it possible to minimize the trucks’ waiting on the platforms by providing a supply and dispatch schedule. This approach considers the questions “where? and when?” schedule of each truck, in other words, “which platform and at what time” each truck should enter and exit. The model’s execution time is reasonable; therefore, it is possible to implement solutions or make changes to eventualities in the same shift.This paper proposed a MILP model to solve the scheduling problem of inbound and outbound trucks of a cross-docking platform, with makespan minimization. The model has been tested with actual data obtained from a multinational food company in Concepción, Chile, under different scenarios. The model was run using the solvers CPLEX and Gurobi.The results obtained in the B shift instance establish that the company’s best schedule involves using five of the six docks available and leaving one for any eventuality. The main benefits will be reflected in a decrease in the monthly overtime of that shift, representing savings equivalent to one worker’s monthly salary for every overtime hour that the shift does not run. The C shift results show that the new Ice Cream chamber will bring significant savings in operating times. The benefits of this new schedule could also be reflected in decreased overtime.Regarding the model, solvers CPLEX and Gurobi deliver equal values for the objective function and find optimal solutions in a few seconds; when the problem becomes more complex, both solvers find feasible solutions close to the lower limit in less than 2.5 hours. Finally, based on the factor analysis results, it is recommended that products be received in equal distributions among all inbound trucks in general terms. This fact is an effort performed to load all outbound trucks equally; in each of the trucks, there should be no more than three different types of products if they have different characteristics; and lastly, the number of docks used justifies the total operating time (makespan).As future work, we suggest extending this research by incorporating all the warehouse tasks, such as order picking and the vehicle routing problem. Also, stochastic considerations must be incorporated into the proposed model. Solution strategies for the stochastic model such as Scenarios [43, 44] or Sample Average Approximation [45, 46] must be applied. Similarly, a heuristic method can be developed to solve problems with larger-scale instances and compare these with the results obtained in this paper.



---

*Source: 8813372-2020-11-27.xml*