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 problem of scheduling preemptable, independent jobs requiring a continuous, renewable resource to minimize the makespan is considered. The available amount of the continuous resource varies over time. Processing speed of a job is an increasing and convex function of the amount of the resource allotted to the job at a time. An exact algorithm for finding an optimal schedule is proposed.
This paper presents an iterative bidding mechanism for scheduling non-commercial services provided by publicly funded scientific facilities, healthcare systems, government agencies, and many other not-for-profit organizations. In non-commercial service scheduling problems, service providers strive to maximize the common welfare of the community through effective scheduling of their services and, at...
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.