This work aims to solve a scheduling problem on parallel machines subject to non-interference constraints. This kind of problem is common in several logistics
This paper considers the Quay Crane Scheduling Problem (QCSP) with non-crossing and safety clearance constraints for a single vessel. The problem determines
This paper considers the Quay Crane Scheduling Problem (QCSP) with non-crossing and safety clearance constraints for a single vessel. The problem determines
In this paper, we study the crane scheduling problem for a vessel after the vessel is moored on a terminal and develop both exact and heuristic solution
[24] studied the QCSP with non-interference constraints in the port of Tripoli-Lebanon, they proposed a genetic algorithm to solve the problem, and finally they