Repositorio de producción científica de la Universidad de Sevilla

Setting a common due date in a constrained flowshop: A variable neighbourhood search approach

Opened Access Setting a common due date in a constrained flowshop: A variable neighbourhood search approach

Citas

buscar en

Estadísticas
Icon
Exportar a
Autor: Pérez González, Paz
Framiñán Torres, José Manuel
Departamento: Universidad de Sevilla. Departamento de Organización Industrial y Gestión de Empresas I
Fecha: 2010
Publicado en: Computers and Operations Research, 37(10), 1740-1748
Tipo de documento: Artículo
Resumen: In this paper we study a due date setting problem in a flowshop layout. The problem consists of scheduling a set of jobs arriving to the system together with jobs already present (denoted as old jobs), in order to set a common due date for the new jobs. Since the old jobs have a common due date that must not be violated, our problem is a rescheduling problem with the objective of minimising the makespan of the new jobs (thus obtaining the tightest possible due date for the new jobs) and a constraint since the maximum tardiness of the old jobs must be equal to zero. This approach leads to an interesting scheduling problem in which two different objectives are considered, each one for a subset of the jobs that must be scheduled. To the best of our knowledge, this type of problems have been scarcely considered in the literature, and only for very specific purposes. Since our problem is clearly NP-hard, a new heuristic based on variable neighbourhood search (VNS) has been designed. The co...
[Ver más]
Cita: Pérez González, P. y Framiñán Torres, J.M. (2010). Setting a common due date in a constrained flowshop: A variable neighbourhood search approach. Computers and Operations Research, 37 (10), 1740-1748.
Tamaño: 148.4Kb
Formato: PDF

URI: http://hdl.handle.net/11441/23449

DOI: 10.1016/j.cor.2010.01.002

Ver versión del editor
Ver versión del editor

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones