A Lagrangian relaxation algorithm for stochastic fixed interval scheduling problem with non-identical machines and job classes
Year of publication: |
2024
|
---|---|
Authors: | Branda, Martin ; Matoušková, Monika |
Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 164.2024, Art.-No. 106542, p. 1-22
|
Subject: | Fixed interval scheduling | Job classes | Lagrangian relaxation | Non-identical machines | Uncertain delays | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
Barketau, M., (2013)
-
Two exact algorithms for the traveling umpire problem
Xue, Li, (2015)
-
Silva, Yuri Laio T. V., (2018)
- More ...
-
Diversification-consistent data envelopment analysis based on directional-distance measures
Branda, Martin, (2015)
-
On relations between chance constrained and penalty function problems under discrete distributions
Branda, Martin, (2013)
-
Optimization Approaches to Multiplicative Tariff of Rates Estimation in Non-Life Insurance
Branda, Martin, (2014)
- More ...