Cross Docking is one of the modern distribution systems with products from various types of suppliers accepted in one warehouse facility which is then combined for the same shipping destination, then departed at the soonest possible time. Cross Docking has operational problems, one of which is scheduling trucks that enter and exit the cross-dock terminal. Good truck scheduling results in a minimum total processing time and production costs. Truck scheduling has many alternative final results making it difficult to solve with exact calculations. Simple Iteration Algorithm Mutations are developed from a Cross Entropy hybridization algorithm and Genetic Algorithm with regard to the advantages and disadvantages of each algorithm. Using the Simple Iteration Algorithm Mutations for truck scheduling with maximum daily data produce a sequence of trucks with a faster total processing time of 6.156 hours compared to the actual situation. This calculation requires a computation time of 349 seconds which is a fairly short time considering truck scheduling is an operational problem.

Keywords : Cross Docking, Iteration Mutation.