On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty
Year of publication: |
2020
|
---|---|
Authors: | Shafransky, Yakov ; Shinkarevich, Viktor |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 23.2020, 6, p. 745-749
|
Subject: | Minmax regret | Interval uncertainty | Two-machine flow shop | NP-hardness | Theorie | Theory | Entscheidung unter Unsicherheit | Decision under uncertainty | Scheduling-Verfahren | Scheduling problem | Produktionssteuerung | Production control | Heuristik | Heuristics |
-
Bad-scenario-set robust scheduling for a job shop to hedge against processing time uncertainty
Wang, Bing, (2019)
-
Xu, Xiaoqing, (2014)
-
Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence
Lin, Bertrand M. T., (2017)
- More ...
-
Lawler's minmax cost algorithm : optimality conditions and uncertainty
Brauner, Nadia, (2016)
-
Scheduling jobs with uncertain parameters: analysis of research directions
Shafransky, Yakov, (2006)
-
Minimizing maximum cost for a single machine under uncertainty of processing times
Fridman, Ilia, (2020)
- More ...