The single machine weighted mean squared deviation problem

Jordi Pereira, Óscar C. Vásquez

Resultado de la investigación: Contribución a una revistaArtículorevisión exhaustiva

9 Citas (Scopus)

Resumen

This paper studies a single machine problem related to the Just-In-Time (JIT) production objective in which the goal is to minimize the sum of weighted mean squared deviation of the completion times with respect to a common due date. In order to solve the problem, several structural and dominance properties of the optimal solution are investigated. These properties are then integrated within a branch-and-cut approach to solve a time-indexed formulation of the problem. The results of a computational experiment with the proposed algorithm show that the method is able to optimally solve instances with up to 300 jobs within reduced running times, improving other integer programming approaches.

Idioma originalInglés
Páginas (desde-hasta)515-529
Número de páginas15
PublicaciónEuropean Journal of Operational Research
Volumen261
N.º2
DOI
EstadoPublicada - 1 sept. 2017
Publicado de forma externa

Huella

Profundice en los temas de investigación de 'The single machine weighted mean squared deviation problem'. En conjunto forman una huella única.

Citar esto