Cross-docking is an innovative logistical strategy which provides less inventory holding costs, less transportation costs and fast customer deliveries without storage in between or less than 24 hours. In this paper, we address the two-machine cross-docking scheduling problem within a Just-In-Time (JIT) context. This latter requires the punctuality and exactness of product deliveries. To satisfy this target, we aim to minimize the total earliness and tardiness, then early or tardy deliveries are discouraged. This study presents a great contribution in solving such NP-hard problem while applying different versions of the PSO (Particle Swarm Optimization) algorithm. One of them is hybridized with the Genetic Algorithm (GA). This latter is then shown to be the best one over computational experiments using different sized instances and by determining a percentage deviation from a developed lower bound.

交叉对接是一种创新的物流策略，可提供更少的库存持有成本、更少的运输成本和快速的客户交付，而无需在 24 小时内或不到 24 小时内进行存储。在本文中，我们解决了即时 (JIT) 上下文中的两机交叉对接调度问题。后者要求产品交付的准时和准确。为了实现这一目标，我们的目标是尽量减少总的提前和延迟交付，因此不鼓励提前或延迟交付。这项研究在应用不同版本的 PSO（粒子群优化）算法的同时，在解决此类 NP 难题方面做出了巨大贡献。其中之一与遗传算法（GA）杂交。