- -

Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

  • Estadisticas de Uso

Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times

Show simple item record

Files in this item

dc.contributor.author Fanjul-Peyro, Luis es_ES
dc.contributor.author Ruiz García, Rubén es_ES
dc.contributor.author Perea Rojas Marcos, Federico es_ES
dc.date.accessioned 2020-12-11T04:33:32Z
dc.date.available 2020-12-11T04:33:32Z
dc.date.issued 2019-01 es_ES
dc.identifier.issn 0305-0548 es_ES
dc.identifier.uri http://hdl.handle.net/10251/156847
dc.description.abstract [EN] Parallel machine scheduling problems have many practical and industrial applications. In this paper we study a generalization which is the unrelated parallel machine scheduling problem with machine and job sequence setup times (UPMS) with makespan minimization criterion. We propose new mixed integer linear programs and a mathematical programming based algorithm. These new models and algorithms are tested and compared with the existing ones in an extensive and comprehensive computational campaign. The performance of two popular commercial solvers (CPLEX and Gurobi) is also compared in the experiments. Results show that the proposed methods significantly improve on existing methods and are able to obtain solutions for extremely large instances of up to 1000 jobs and eight machines with relative deviations from lower bounds below 0.8%. es_ES
dc.description.sponsorship The authors are partially supported by the Spanish Ministry of Economy and Competitiveness, under the project SCHEYARD Optimization of Scheduling Problems in Container Yards (No.DPI2015-65895-R) financed by FEDER funds. Special thanks are due to our colleague Alfredo Marín, for fruitful discussions that helped improve this paper and to Tran and coauthors for all the help received during the reimplementation of their efficient methods. Thanks are also due to three anonymous referees for their helpful reports. es_ES
dc.language Inglés es_ES
dc.publisher Elsevier es_ES
dc.relation.ispartof Computers & Operations Research es_ES
dc.rights Reconocimiento - No comercial - Sin obra derivada (by-nc-nd) es_ES
dc.subject Parallel machine es_ES
dc.subject Scheduling es_ES
dc.subject Sequence dependent setup times es_ES
dc.subject Makespan es_ES
dc.subject.classification ESTADISTICA E INVESTIGACION OPERATIVA es_ES
dc.title Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1016/j.cor.2018.07.007 es_ES
dc.relation.projectID info:eu-repo/grantAgreement/MINECO//DPI2015-65895-R/ES/OPTIMIZATION OF SCHEDULING PROBLEMS IN CONTAINER YARDS/ es_ES
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.description.bibliographicCitation Fanjul-Peyro, L.; Ruiz García, R.; Perea Rojas Marcos, F. (2019). Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times. Computers & Operations Research. 101:173-182. https://doi.org/10.1016/j.cor.2018.07.007 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion https://doi.org/10.1016/j.cor.2018.07.007 es_ES
dc.description.upvformatpinicio 173 es_ES
dc.description.upvformatpfin 182 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 101 es_ES
dc.relation.pasarela S\368596 es_ES
dc.contributor.funder Ministerio de Economía y Competitividad es_ES


This item appears in the following Collection(s)

Show simple item record