The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, a new algorithm is designed to solve time-cost tradeoff problem. Conventional algorithm is to reduce length of longer paths in activity network first, and then reduce shorter ones step by step. The contrary idea is adopted in the paper, firstly, the activity network is simplified equivalently by using theory of network planning technology and float, and paths which should be considered...
This paper addresses a dynamic inventory slab allocation problem (DISAP), which takes both production and inventory into consideration in a real dynamic processing environment. The particularity is that the holding level of inventory slabs that are generated over a tau-period planning horizon must be zero at the end of period tau. The goal is to schedule the inventory slabs so that the total cost...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.