This paper aims to model a consumer goods cross-docking problem, which is solved using metaheuristics minimize makespan and determine the capacity in terms of inbound outbound docks. The consumer-goods problem represented through docks, customer orders (products be delivered customers), as solution method. Simulated annealing (SA) particle swarm optimization (PSO) are implemented solve problem....

The issue of supply chain in today's world is a major competitive advantage reducing costs. Supply includes procurement, logistics and transportation, marketing, organizational behavior, networking, strategic management, information systems management operations management. One the most important practices cross-docking which sets its goals as inventory reduction customer satisfaction increase....

Autodock and its various variants are widely utilized docking approaches, which adopt optimization methods as search algorithms for flexible ligand virtual screening. However, many of them have their limitations, such poor accuracy dockings with highly ligands low efficiency. In this paper, a multi-swarm algorithm integrated environment is proposed to design high-performance high-efficiency pro...

One important factor in supply chain management is to efficiently control the supply chain flows. Due to its importance, many companies are trying to develop efficient methods to increase customer satisfaction and reduce costs. Cross-docking is considered a good method to reduce inventory and improve responsiveness. The Vehicle Routing Problem with Cross-Docking and Time Windows (VRP-CD-TW) con...

In this work, we validate and analyze the results of previously published cross docking experiments and classify failed dockings based on the conformational changes observed in the receptors. We show that a majority of failed experiments (i.e. 25 out of 33, involving four different receptors: cAPK, CDK2, Ricin and HIVp) are due to conformational changes in side chains near the active site. For ...

in this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. this study seems utterly new and it is applicable to any performance measure based on the completion time. the in...