A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
Year of publication: |
2008
|
---|---|
Authors: | Kasperski, Adam ; Zieliński, Paweł |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 36.2008, 3, p. 343-344
|
Subject: | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm |
-
A review of methods and algorithms for optimizing construction scheduling
Zhou, J., (2013)
-
Madraki, Golshan, (2018)
-
On the query complexity of Black-Peg AB-mastermind
Ouali, Mourad el, (2018)
- More ...
-
Kasperski, Adam, (2009)
-
A randomized algorithm for the min-max selecting items problem with uncertain weights
Kasperski, Adam, (2009)
-
A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data
Kasperski, Adam, (2012)
- More ...