Continuous time scheduling for sugarcane harvest logistics in Louisiana
针对美国路易斯安那州甘蔗收获与物流中的调度问题，建立整数规划模型协调收割与运输，通过最大化车辆到达糖厂的最小间隔来减少等待时间，并引入有效不等式和最优性割提高求解效率。
Despite a growing global appetite for sugar as both a foodstuff and a fuel source, there exists limited literature that explores sugarcane operations. In this paper, we look at the scheduling harvest and logistics operations in the state of Louisiana in the United States. These operations account for significant portions of the total sugarcane production costs. We develop an integer programming model for coordinating harvest and transport of sugarcane. The model seeks to reduce vehicle waiting time at the mill by maximising the minimum gap between two successive arrivals at the mill. To help improve tractability, we introduce valid inequalities and optimality cuts. We also demonstrate how to adapt solutions from a previous discrete-time model. Our results show that arrivals can easily be coordinated to reduce truck waiting time at the mill.