A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
In this paper, we present a variant of classical scheduling problems which deal with restricted resources. Unlike other models studied in the literature, the proposed model has no upper bound for the amount of available resources. The objective of this variant is to find a solution that maximises this amount at the end of the planning horizon. A hybrid evolutionary algorithm is proposed for this problem presenting very promising computational results.doi:10.1504/ijdmmm.2013.057685 fatcat:q6cm5u76vvgorjpbfpnmkyra6u