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...

Descripción completa

Guardado en:
Detalles Bibliográficos
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!