A local search algorithm : minimizing makespan of deteriorating jobs with relaxed agreeable weights
Year of publication: |
March 2018
|
---|---|
Authors: | Gupta, Anjulika ; Sharma, Prabha ; Salwan, Hemant |
Published in: |
EURO journal on computational optimization. - Heidelberg : Springer, ISSN 2192-4406, ZDB-ID 2772752-X. - Vol. 6.2018, 1, p. 29-54
|
Subject: | Permutation polyhedra | Adjacency | Dominance | Local search | Deteriorating jobs | Relaxed agreeable weights | Mathematische Optimierung | Mathematical programming | Durchlaufzeit | Lead time | Theorie | Theory | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm |
-
Li, Xiangtao, (2017)
-
Scheduling blocking flowshops with setup times via constraint guided and accelerated local search
Newton, M. A. Hakim, (2019)
-
Ozturk, Onur, (2017)
- More ...
-
An efficient local search scheme for minimizing mean absolute deviation of completion times
Gupta, Anjulika, (2011)
-
A network simplex algorithm with O(n) consecutive degenerate pivots
Ahuja, Ravindra K., (2002)
-
Permutation Polyhedra and Minimisation of the Variance of Completion Times on a Single Machine
Sharma, Prabha, (2002)
- More ...