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: | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Biogeography-based optimisation for flexible manufacturing system scheduling problem
Shahla Paslar, (2015)
-
A review of methods and algorithms for optimizing construction scheduling
Zhou, J., (2013)
-
Robust MILP formulations for the two-stage weighted vertex p-center problem
Duran-Mateluna, Cristian, (2023)
- More ...
-
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
Kasperski, Adam, (2012)
-
Kasperski, Adam, (2008)
-
Kasperski, Adam, (2007)
- More ...