Auction-based algorithm for solving scheduling problem in cross-docking centres

An optimisation model to increase the cross-dockings operational utilisation

“…A numerous surveys (Gu et al, 2007;Maknoon and Baptiste, 2009;Boysen and Fliedner, 2010;Van Belle et al, 2012;Buijs et al, 2014;Guastaroba et al, 2016;Haddad et al, 2018;Schiffer et al, 2019;Cortes and Suzuki, 2020;Esmizadeh and Mellat Parast, 2021) devoted to vehicle routing problems with cross-docking (VRPCD), and articles to study operations management in TDAS (Cohen and Keren, 2009;Darestani and Tahaei, 2015;Ferretti et al, 2018;Goodarzi et al, 2020;Haial et al, 2020;Parker et al, 2016) are examples of this trend. Generally, the scheduling goals include but not limited to the minimisation of tardiness of outbound trucks, earliness of inbound trucks, makespan, and waiting time for trucks to be processed (Rijal et al, 2019;Wisittipanich et al, 2019;Paul and Paul, 2020). This section provides a detailed review is the TDAS under the CDAP studies.…”

“…One constraint set which is missing from the model is the scheduling constraint for vehicle arrivals and departure. For forklift utilisation and minimisation of the number of forklifts inside the terminal, we need to assume a truck schedule (Wisittipanich et al, 2019;Paul and Paul, 2020). Without a constraint to enforce this condition, the model's solution can lack a realistic approach.…”

“…An optimum inbound-outbound truck-door assignment and scheduling (TDAS) (Ladier and Alpan, 2016;Wisittipanich et al, 2019;Paul and Paul, 2020) can maximise the throughput or products turnover at CD systems, and reduce the likelihood of late shipments, total processing time or makespan, and inventory level. However, among all performance factors, forklift congestion is the only unfavourable and unavoidable factor that scholars devoted very little attention to, even though most agree that floor congestion in the centre of terminal causes extra movements that impacts the efficiency (Bartholdi and Gue, 2000).…”

An integrated operations model for supply of relief items under path disruptions

“…They considered the objective of minimizing total weighted completion time and proposed a Particle Swarm Optimization algorithm for solving large-sized problems. There are also newer solution approaches available in literature for NP-hard problems, including the usage of auction based mechanism for the optimum allocation of limited resources [ 26 ]. The optimization of relief supply chains is complex and computationally tedious and most of the works in this area consider relevant assumptions to reduce problem complexity.…”