In this paper,we consider a multi-crane scheduling problem in rail stations because their operations directly influence the throughput of the rail stations.In particular,the job is not only assigned to cranes but also...In this paper,we consider a multi-crane scheduling problem in rail stations because their operations directly influence the throughput of the rail stations.In particular,the job is not only assigned to cranes but also the job sequencing is implemented for each crane to minimize the makespan of cranes.A dual cycle of cranes is used to minimize the number of working cycles of cranes.The rail crane scheduling problems in this study are based on the movement of containers.We consider not only the gantry moves,but also the trolley moves as well as the rehandle cases are also included.A mathematical model of multi-crane scheduling is developed.The traditional and parallel simulated annealing(SA)are adapted to determine the optimal scheduling solutions.Numerical examples are conducted to evaluate the applicability of the proposed algorithms.Verification of the proposed parallel SA is done by comparing it to existing previous works.Results of numerical computation highlighted that the parallel SA algorithm outperformed the SA and gave better solutions than other considered algorithms.展开更多
文摘In this paper,we consider a multi-crane scheduling problem in rail stations because their operations directly influence the throughput of the rail stations.In particular,the job is not only assigned to cranes but also the job sequencing is implemented for each crane to minimize the makespan of cranes.A dual cycle of cranes is used to minimize the number of working cycles of cranes.The rail crane scheduling problems in this study are based on the movement of containers.We consider not only the gantry moves,but also the trolley moves as well as the rehandle cases are also included.A mathematical model of multi-crane scheduling is developed.The traditional and parallel simulated annealing(SA)are adapted to determine the optimal scheduling solutions.Numerical examples are conducted to evaluate the applicability of the proposed algorithms.Verification of the proposed parallel SA is done by comparing it to existing previous works.Results of numerical computation highlighted that the parallel SA algorithm outperformed the SA and gave better solutions than other considered algorithms.
