An approximation scheme for the bi-scenario sum of completion times trade-off problem
Year of publication: |
2019
|
---|---|
Authors: | Gilenson, Miri ; Naseraldin, Hussein ; Yedidsion, Liron |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 22.2019, 3, p. 289-304
|
Subject: | Approximation | Sum of completion times | Bi-scenario | PTAS | Pareto-optimal |
-
Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines
Alhadi, Gais, (2020)
-
Scheduling a multi-agent flow shop with two scenarios and release dates
Wang, Xinyue, (2024)
-
Sotomayor, Marilda, (2008)
- More ...
-
Setting defect charts control limits to balance cycle time and yield for a tandem production line
Gilenson, Miri, (2015)
-
Operations scheduling under electricity time-varying prices
Mikhaylidi, Yevgenia, (2015)
-
A state-of-the-art survey on multi-scenario scheduling
Shabtay, Dvir, (2023)
- More ...