Hybrid TSSA algorithm-based approach to solve warehouse-scheduling problems

Managing a supply chain efficiently is one of the most promising tasks for enterprises these days. Therefore, all the major factors that contribute to the success of the supply chain have to be handled carefully. Warehousing being the vital component of the supply chain contributes towards the storage and timely and efficient delivery of products. The role of warehouses in the overall success of the supply chain has shifted the inclination of researchers towards finding ways that can ease the complexities prevailing under such a scenario. Motivated by these facts, the present paper deals with the issues pertaining to the modelling of the warehouse management system. The paper emphasizes various matters related to warehouse scheduling and aims for an overall minimization of tardiness. It also proposes a Tabu sample-sort simulated annealing (TSSA) algorithm to solve the complex warehouse-scheduling problems. The comparative result with simulated annealing (SA), Tabu search (TS), and hybrid Tabu-SA algorithms at the end of the proposed work reveals the efficacy and robustness of the TSSA algorithm.