- -

Scheduling unrelated parallel machines with optional machines and jobs selection

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Scheduling unrelated parallel machines with optional machines and jobs selection

Show simple item record

Files in this item

dc.contributor.author Fanjul Peyró, Luis es_ES
dc.contributor.author Ruiz García, Rubén es_ES
dc.date.accessioned 2014-02-04T08:51:14Z
dc.date.issued 2012-07
dc.identifier.issn 0305-0548
dc.identifier.uri http://hdl.handle.net/10251/35335
dc.description.abstract [EN] In this paper we study two generalizations of the well known unrelated parallel machines scheduling problem under makespan (Cmax) minimization. First, a situation in which not every available parallel machine should be used and it is desirable to employ only a subset of the parallel machines. This is referred to as Not All Machines or NAM in short. This environment applies frequently in production shops where capacity exceeds demand or when production capacity can be lent to third companies. Also, NAM can be used to increase production capacity and it is not clear how many additional machines should be acquired. The second studied generalization has been referred to as Not All Jobs or NAJ. Here, there is no obligation to process all available jobs. We propose Mixed Integer Programming mathematical formulations for both NAM and NAJ, and it is shown that the latter can be effectively solved with modern commercial solvers. We also present three algorithms to solve the NAM problem. These algorithms are compared with the proposed MIP formulation when solved with IBM ILOG CPLEX 12.1. Comprehensive computational and statistical experiments prove that our proposed algorithms significantly improve the results given by the solver. © 2011 Elsevier Ltd. All rights reserved. es_ES
dc.description.sponsorship The authors would like to thank the anonymous referees for their careful and detailed comments which have helped to improve this manuscript considerably. This work is partially funded by the Spanish Ministry of Science and Innovation, under the project ‘‘SMPA—Advanced Parallel Multiobjective Sequencing: Practical and Theoretical Advances’’ with reference DPI2008-03511/DPI. The authors should also thank the IMPIVA—Institute for the Small and Medium Valencian Enterprise, under the project ‘‘OSC’’ with references IMIDIC/2008/137, IMIDIC/2009/198 and IMIDIC/2010/175 and the Polytechnic University of Valencia, under the project ‘‘PPAR— Production Programming in Highly Constrained Environments: New Algorithms and Computational Advances’’ with reference 3147.
dc.format.extent 9 es_ES
dc.language Inglés es_ES
dc.publisher Elsevier es_ES
dc.relation MICINN/DPI2008-03511/DPI es_ES
dc.relation IMPIVA/IMIDIC/2008/137 es_ES
dc.relation UPV/PPAR-3147 es_ES
dc.relation IMPIVA/IMIDIC/2009/198
dc.relation IMPIVA/IMIDIC/2010/175
dc.relation.ispartof Computers and Operations Research es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Job selection es_ES
dc.subject Makespan es_ES
dc.subject Not All Jobs es_ES
dc.subject Not All Machines es_ES
dc.subject Optional machines es_ES
dc.subject Unrelated parallel machines es_ES
dc.subject Scheduling algorithms es_ES
dc.subject Integer programming es_ES
dc.subject.classification ESTADISTICA E INVESTIGACION OPERATIVA es_ES
dc.title Scheduling unrelated parallel machines with optional machines and jobs selection es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1016/j.cor.2011.10.012
dc.rights.accessRights Abierto es_ES
dc.contributor.affiliation Universitat Politècnica de València. Departamento de Estadística e Investigación Operativa Aplicadas y Calidad - Departament d'Estadística i Investigació Operativa Aplicades i Qualitat es_ES
dc.contributor.affiliation Universitat Politècnica de València. Instituto Universitario Mixto Tecnológico de Informática - Institut Universitari Mixt Tecnològic d'Informàtica es_ES
dc.description.bibliographicCitation Fanjul Peyró, L.; Ruiz García, R. (2012). Scheduling unrelated parallel machines with optional machines and jobs selection. Computers and Operations Research. 39(7):1745-1753. doi:10.1016/j.cor.2011.10.012 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion http://dx.doi.org/10.1016/j.cor.2011.10.012 es_ES
dc.description.upvformatpinicio 1745 es_ES
dc.description.upvformatpfin 1753 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 39 es_ES
dc.description.issue 7 es_ES
dc.relation.senia 217955
dc.contributor.funder Ministerio de Ciencia e Innovación
dc.contributor.funder Instituto de la Pequeña y Mediana Industria de la Generalitat Valenciana
dc.contributor.funder Universitat Politècnica de València


This item appears in the following Collection(s)

Show simple item record