Scheduling jobs to minimize a convex function of resource usage
Year of publication: |
2024
|
---|---|
Authors: | Kis, Tamás ; Szögi, Evelin |
Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 169.2024, Art.-No. 10748, p. 1-14
|
Subject: | Scheduling | Load balancing | Convex optimization | Network flows | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Theorie | Theory |
-
Disaggregated benders decomposition for solving a network maintenance scheduling problem
Pearce, Robin H., (2019)
-
Gkiotsalitis, Konstantinos, (2023)
-
A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
Moradi, Siamak, (2015)
- More ...
-
A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
Kis, Tamás, (2004)
-
Exact solution approaches for bilevel lot-sizing
Kis, Tamás, (2013)
-
An inverse economic lot-sizing approach to eliciting supplier cost parameters
Egri, Péter, (2014)
- More ...