dc.creator | Pérez González, Paz | es |
dc.creator | Framiñán Torres, José Manuel | es |
dc.date.accessioned | 2017-10-05T08:46:30Z | |
dc.date.available | 2017-10-05T08:46:30Z | |
dc.date.issued | 2015 | |
dc.identifier.citation | Pérez González, P. y Framiñán Torres, J.M. (2015). Single machine interfering jobs problem with flowtime objective. Journal of Intelligent Manufacturing | |
dc.identifier.issn | 0956-5515 | es |
dc.identifier.issn | 1572-8145 | es |
dc.identifier.uri | http://hdl.handle.net/11441/65025 | |
dc.description.abstract | Interfering jobs problems (or multi agents
scheduling problems) are an emergent topic in the scheduling
literature.In these decisión problems,two or more sets of jobs
have to be scheduled, each one with its own criteria. More
specifically, we focus on a problem in which jobs belonging
to two sets have to be scheduled in a single machine in order
to minimize the total flowtime of the jobs in one set, while the
total flowtime of the jobs in the other set should not exceed
a given constant €. This problem is known to be weakly NP-
hard, and, in the literature, a dynamic programming (DP)
algorithm has been proposed to find optimal solutions. In
this paper, we first analyse the distribution of solutions of the
problem in order to establish its empirical hardness. Next,
a novel encoding scheme and a set of properties associated
to the neighbourhood of this scheme are presented. These
properties are used to develop both exact and approximate
methods, i.e. a branch and bound (B&B) method, several
constructive heuristics, and different versions of a genetic
algorithm (GA). The computational experience carried out
shows that the proposed B&B is more efficient than the exist-
ing DP algorithm. The results also show the advantages of
the proposed encoding scheme, as the approximate methods
yield close-to-optimum solutions for big-sized instances
where exact methods are not feasible. | es |
dc.description.sponsorship | Ministerio de Economía y Competitividad DPI2013-44461-P/DPI | es |
dc.description.sponsorship | Ministerio de Economía y Competitividad DPI2010-15573/DPI | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.publisher | Springer | es |
dc.relation.ispartof | Journal of Intelligent Manufacturing | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Scheduling | es |
dc.subject | Interfering jobs | es |
dc.subject | Two-agent scheduling problem | es |
dc.subject | Total flowtime | es |
dc.subject | Single machine | es |
dc.title | Single machine interfering jobs problem with flowtime objective | es |
dc.type | info:eu-repo/semantics/article | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.type.version | info:eu-repo/semantics/acceptedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Organización Industrial y Gestión de Empresas I | es |
dc.relation.projectID | info:eu-repo/grantAgreement/MINECO/DPI2013-44461-P/DPI | es |
dc.relation.projectID | info:eu-repo/grantAgreement/MINECO/DPI2010-15573/DPI | es |
dc.relation.publisherversion | https://link.springer.com/article/10.1007/s10845-015-1141-6 | es |
dc.identifier.doi | 10.1007/s10845-015-1141-6 | es |
idus.format.extent | 20 p. | es |
dc.journaltitle | Journal of intelligent manufacturing | es |
dc.contributor.funder | Ministerio de Economía y Competitividad (MINECO). España | |