A job-shop scheduling approach for optimising sugarcane rail operations

作者：Masoud Mahmoud; Kozan Erhan^*; Kent Geoff

来源：Flexible Services and Manufacturing Journal, 2011, 23(2): 181-206.

DOI：10.1007/s10696-011-9092-5

• Integer programming
• Constraint programming
• Sugarcane rail
• Job shop

The sugarcane transport system is very complex and uses a daily schedule, consisting of a set of locomotives runs, to satisfy the requirements of the mill and harvesters. The total cost of sugarcane transport operations is very high; over 35% of the total cost of sugarcane production in Australia is incurred in cane transport. Producing efficient schedules for sugarcane transport can reduce the cost and limit the negative effects that this system can have on the raw sugar production system. In this paper, the sugarcane rail operations are formulated as a blocking job shop scheduling problem. A mixed integer programming approach is used to formulate the shop job scheduling problem. Mixed integer programming and constraint programming search techniques are integrated for solving the problem. A case study is solved to test the approach.

• 出版日期2011-6