On scheduling of step-improving jobs to minimize the total weighted completion time
Year of publication: |
2024
|
---|---|
Authors: | Cheng, T. C. E. ; KravĨenko, Svetlana A. ; Lin, Bertrand M. T. |
Published in: |
Journal of the Operational Research Society. - London : Taylor and Francis, ISSN 1476-9360, ZDB-ID 2007775-0. - Vol. 75.2024, 4, p. 720-730
|
Subject: | dynamic programming | Single-machine scheduling | step-improving jobs | weighted completion time | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Dynamische Optimierung | Dynamic programming |
-
Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
Rostami, Salim, (2017)
-
Truong, Van-Anh, (2015)
-
Lan, Shaowen, (2022)
- More ...
-
Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences
Cheng, T. C. E., (2021)
-
On the complexity of two machine job-shop scheduling with regular objective functions
Brucker, Peter, (1997)
-
Preemptive job-shop scheduling problems with a fixed number of jobs
Brucker, Peter, (1999)
- More ...