p.1009
p.1013
p.1017
p.1021
p.1026
p.1030
p.1034
p.1038
p.1042
Optimizing Online Assignment of Harvesting Jobs to Trans-Regional Combines
Abstract:
This study investigated a two-round linear programming method for optimizing online assignment of harvesting jobs to trans-regional combines. A two-round biding process was constructed to provide the competitive quotations for the two-round linear programming method. There was a 25 percent limitation of price difference in the second bid versus the first one. It was found that using the two-round linear programming method significantly decreased the cost to hire the trans-regional combines for harvesting jobs by 4% compared with one-round biding process. This indicates that there is a possibility of developing a better online optimal algorithm based on a multi-round biding process and suggests that it is possible to determine the optimal change limitation and round number.
Info:
Periodical:
Pages:
1026-1029
Citation:
Online since:
February 2014
Authors:
Price:
Сopyright:
© 2014 Trans Tech Publications Ltd. All Rights Reserved
Share:
Citation: