Fast neighborhood search for the single machine earliness-tardiness scheduling problem
Year of publication: |
2010
|
---|---|
Authors: | Kedad-Sidhoum, Safia ; Sourd, Francis |
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. 37.2010, 8, p. 1464-1471
|
Subject: | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | USA | United States | Algorithmus | Algorithm |
-
Computation of approximate α-points for large scale single machine scheduling problem
Gu, Han Yu, (2008)
-
Performance of an ant colony optimisation algorithm in dynamic job shop scheduling problems
Zhou, R., (2009)
-
Adaptive Tabu Search for course timetabling
Lü, Zhipeng, (2010)
- More ...
-
A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
Sourd, Francis, (2008)
-
Kedad-Sidhoum, Safia, (2008)
-
Kedad-Sidhoum, Safia, (2008)
- More ...