A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights
In this paper, we consider the problem of minimizing makespan of n deteriorating jobs on a single machine. Rates of deterioration are job-dependent and constant with respect to the starting times. Jobs begin to deteriorate after a common critical date ‘d.’ The concept of relaxed agreeable weights is...
Guardado en:
Autores principales: | Anjulika Gupta, Prabha Sharma, Hemant Salwan |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2018
|
Materias: | |
Acceso en línea: | https://doaj.org/article/550f34ab162141cf9c0fe29187f03a6f |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Restrict-and-relax search for 0-1 mixed-integer programs
por: Menal Guzelsoy, et al.
Publicado: (2013) -
A complete search method for the relaxed traveling tournament problem
por: Filipe Brandão, et al.
Publicado: (2014) -
Editorial Board
Publicado: (2021) -
Portfolio optimization with pw-robustness
por: Virginie Gabrel, et al.
Publicado: (2018) -
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
por: C. Gentile, et al.
Publicado: (2017)