Lower bounds for the earliness–tardiness scheduling problem on parallel machines with distinct due dates
Year of publication: |
2008
|
---|---|
Authors: | Kedad-Sidhoum, Safia ; Solis, Yasmin Rios ; Sourd, Francis |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 2430034. - Vol. 189.2008, 3, p. 1305-1316
|
Saved in:
Saved in favorites
Similar items by person
-
Kedad-Sidhoum, Safia, (2008)
-
A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
Sourd, Francis, (2008)
-
Fast neighborhood search for the single machine earliness-tardiness scheduling problem
Kedad-Sidhoum, Safia, (2010)
- More ...