A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
Year of publication: |
2012
|
---|---|
Authors: | Kianfar, K. ; Moslehi, G. |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 39.2012, 12, p. 2978-2990
|
Subject: | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Branch-and-Bound | Branch and Bound | Algorithmus | Algorithm | Durchlaufzeit | Lead time |
-
An exact algorithm for the preemptive single machine scheduling of equal-length jobs
Fomin, Artem, (2022)
-
Liu, Guo-Sheng, (2019)
-
Joo, B.-J., (2009)
- More ...
-
Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness
Moslehi, G., (2009)
-
Nekoiemehr, N., (2011)
-
Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness
Moslehi, G., (2009)
- More ...