Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion

Marcin Siepak () and Jerzy Józefczyk ()

Annals of Operations Research, 2014, vol. 222, issue 1, 517-533

Abstract: 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 is proposed. More time consuming but better in terms of the quality of solutions scatter search based heuristic algorithm is described. Its usefulness is justified via computational experiments. Copyright The Author(s) 2014

Keywords: Task scheduling; Interval uncertainty; Minmax regret; Approximation algorithms; Scatter search (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-014-1538-1 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:222:y:2014:i:1:p:517-533:10.1007/s10479-014-1538-1

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-014-1538-1

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().