Mostra el registre d'ítem simple
A branch-and-price algorithm for the Aperiodic Multi-Period Service Scheduling Problem
dc.contributor.author | Fernández Aréizaga, Elena |
dc.contributor.author | Kalcsics, Jörg |
dc.contributor.author | Núñez del Toro, Alma Cristina |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa |
dc.date.accessioned | 2018-03-01T12:01:40Z |
dc.date.available | 2019-12-17T01:26:59Z |
dc.date.issued | 2017-12-16 |
dc.identifier.citation | Fernandez, 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.issn | 0377-2217 |
dc.identifier.uri | http://hdl.handle.net/2117/114681 |
dc.description.abstract | This 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.extent | 10 p. |
dc.language.iso | eng |
dc.publisher | Elsevier |
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.lcsh | Combinatorial analysis |
dc.subject.lcsh | Combinatorial probabilities |
dc.subject.other | Combinatorial optimization |
dc.subject.other | Multi-period problems |
dc.subject.other | Service scheduling |
dc.subject.other | Column generation |
dc.subject.other | Branch-and-price |
dc.title | A branch-and-price algorithm for the Aperiodic Multi-Period Service Scheduling Problem |
dc.type | Article |
dc.subject.lemac | Combinacions (Matemàtica) |
dc.subject.lemac | Probabilitats |
dc.contributor.group | Universitat Politècnica de Catalunya. GNOM - Grup d'Optimització Numèrica i Modelització |
dc.identifier.doi | 10.1016/j.ejor.2017.06.008 |
dc.description.peerreviewed | Peer Reviewed |
dc.subject.ams | Classificació AMS::05 Combinatorics::05E Algebraic combinatorics |
dc.subject.ams | Classificació AMS::60 Probability theory and stochastic processes::60C05 Combinatorial probability |
dc.relation.publisherversion | http://www.sciencedirect.com/science/article/pii/S037722171730526X?via%3Dihub |
dc.rights.access | Open Access |
local.identifier.drac | 21544563 |
dc.description.version | Postprint (author's final draft) |
local.citation.author | Fernandez, E.; Kalcsics, J.; Nuñez-del-Toro, Cristina |
local.citation.publicationName | European journal of operational research |
local.citation.volume | 263 |
local.citation.number | 3 |
local.citation.startingPage | 805 |
local.citation.endingPage | 814 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [104]
-
Articles de revista [719]