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.
An uncertain version of the task scheduling problem on unrelated machines to minimize the total flow time is considered. It is assumed that processing times are not known a priori, but they belong to intervals of known bounds. The absolute regret is applied to evaluate the uncertainty, and minmax regret task scheduling problem is solved. A simple 2-approximate middle intervals time efficient algorithm...
Uncertain versions of three classical optimization problems are examined: the resource allocation in a complex of independent operations and two task scheduling problems Q∥ΣCi, P∥Cmax. It is assumed that some parameters of the problems are uncertain and they belong to intervals of the known bounds. The complexity of the uncertain problems is determined. The worst-case absolute regret approach is used...
We consider P| |Cmax scheduling problem where it is assumed that processing times of tasks are not known apriori, but they belong to the intervals of known bounds. The worst-case absolute regret is used to evaluate the resulting uncertain NP-hard problem. We prove that no approximation algorithm exists for solving that version of the problem and present two heuristic algorithms. We report the results...
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.