摘要：This article proposes a mixed integer model and a genetic algorithm to address a two cranes scheduling problem with non-interference constraints. The problem is about trucks’ loading scheduling with two cranes. Cranes must load trucks with a predefined amount of coils without preemption and the coils retrieval must be scheduled as well. The equipments are subject to non-interference constraints because they share the same rail inside the shed. The mathematical model and the heuristic are computationally tested among different instances.
