Skip to content

Latest commit

 

History

History
14 lines (9 loc) · 496 Bytes

README.md

File metadata and controls

14 lines (9 loc) · 496 Bytes

This tool is used to solve the harvest planning problem.

The problem including: N farms (1,...N) Each farm has quantity of d(i) and has to be harvested between s(i) to e(i) The factory is able to handle from m products to M products

Output: The tool will return the day that each farm should be gathered to maximize the quantity of products

How to use ?

Line 1: enter N,m,M respectively

From line 2 to N+1: enter d,s,e (quantity,start day,end day) respectively of field (1,..N)