Show simple item record

Article

dc.creatorPérez González, Paz
dc.creatorFramiñán Torres, José Manuel
dc.date.accessioned2015-03-12T11:39:28Z
dc.date.available2015-03-12T11:39:28Z
dc.date.issued2010
dc.identifier.citationPé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.es
dc.identifier.issn0305-0548es
dc.identifier.urihttp://hdl.handle.net/11441/23449
dc.description.abstractIn 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 computational results show that our proposed heuristic outperforms two existing heuristic methods for similar problems in the literature.es
dc.description.sponsorshipCICYT Project DPI2007-61345es
dc.formatapplication/pdfes
dc.language.isoenges
dc.relation.ispartofComputers and Operations Research, 37(10), 1740-1748es
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectCommon due datees
dc.subjectDue date settingen
dc.subjectFlowshopen
dc.subjectMetaheuristicsen
dc.subjectSchedulingen
dc.titleSetting a common due date in a constrained flowshop: A variable neighbourhood search approaches
dc.typeinfo:eu-repo/semantics/articlees
dc.rights.accessrightsinfo:eu-repo/semantics/openAccesses
dc.contributor.affiliationUniversidad de Sevilla. Departamento de Organización Industrial y Gestión de Empresas Ies
dc.relation.publisherversionhttp://dx.doi.org/10.1016/j.cor.2010.01.002es
dc.relation.publisherversionhttp://dx.doi.org/10.1016/j.cor.2010.01.002
dc.identifier.doi10.1016/j.cor.2010.01.002
dc.journaltitleComputers and Operations Researches
dc.publication.volumen37es
dc.publication.issue10es
dc.publication.initialPage1740es
dc.publication.endPage1748es
dc.identifier.idushttps://idus.us.es/xmlui/handle/11441/23449
dc.contributor.funderComisión Interministerial de Ciencia y Tecnología (CICYT). España

FilesSizeFormatViewDescription
COR2010_Vopen.pdf148.4KbIcon   [PDF] View/Open  

This item appears in the following collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Except where otherwise noted, this item's license is described as: Attribution-NonCommercial-NoDerivatives 4.0 Internacional