Show simple item record

dc.contributor.authorFernández Aréizaga, Elena
dc.contributor.authorKalcsics, Jörg
dc.contributor.authorNúñez del Toro, Alma Cristina
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa
dc.date.accessioned2018-03-01T12:01:40Z
dc.date.available2019-12-17T01:26:59Z
dc.date.issued2017-12-16
dc.identifier.citationFernandez, E., Kalcsics, J., Nuñez-del-Toro, C. A branch-and-price algorithm for the Aperiodic Multi-Period Service Scheduling Problem. "European journal of operational research", 16 Desembre 2017, vol. 263, núm. 3, p. 805-814.
dc.identifier.issn0377-2217
dc.identifier.urihttp://hdl.handle.net/2117/114681
dc.description.abstractThis paper considers the multi-period service scheduling problem with an aperiodic service policy. In this problem, a set of customers who periodically require service over a finite time horizon is given. To satisfy the service demands, a set of operators is given, each with a fixed capacity in terms of the number of customers that can be served per period. With an aperiodic policy, customers may be served before the period were the service would be due. Two criteria are jointly considered in this problem: the total number of operators, and the total number of ahead-of-time periods. The task is to determine the service periods for each customer in such a way that the service requests of the customers are fulfilled and both criteria are minimized. A new integer programming formulation is proposed, which outperforms an existing formulation. Since the computational effort required to obtain solutions considerably increases with the size of the instances, we also present a reformulation suitable for column generation, which is then integrated within a branch-and-price algorithm. Computational experiments highlight the efficiency of this algorithm for the larger instances.
dc.format.extent10 p.
dc.language.isoeng
dc.publisherElsevier
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Combinatòria
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Optimització
dc.subject.lcshCombinatorial analysis
dc.subject.lcshCombinatorial probabilities
dc.subject.otherCombinatorial optimization
dc.subject.otherMulti-period problems
dc.subject.otherService scheduling
dc.subject.otherColumn generation
dc.subject.otherBranch-and-price
dc.titleA branch-and-price algorithm for the Aperiodic Multi-Period Service Scheduling Problem
dc.typeArticle
dc.subject.lemacCombinacions (Matemàtica)
dc.subject.lemacProbabilitats
dc.contributor.groupUniversitat Politècnica de Catalunya. GNOM - Grup d'Optimització Numèrica i Modelització
dc.identifier.doi10.1016/j.ejor.2017.06.008
dc.description.peerreviewedPeer Reviewed
dc.subject.amsClassificació AMS::05 Combinatorics::05E Algebraic combinatorics
dc.subject.amsClassificació AMS::60 Probability theory and stochastic processes::60C05 Combinatorial probability
dc.relation.publisherversionhttp://www.sciencedirect.com/science/article/pii/S037722171730526X?via%3Dihub
dc.rights.accessOpen Access
local.identifier.drac21544563
dc.description.versionPostprint (author's final draft)
local.citation.authorFernandez, E.; Kalcsics, J.; Nuñez-del-Toro, Cristina
local.citation.publicationNameEuropean journal of operational research
local.citation.volume263
local.citation.number3
local.citation.startingPage805
local.citation.endingPage814


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder