Mostra el registre d'ítem simple

dc.contributor.authorNúñez del Toro, Alma Cristina
dc.contributor.authorFernández Aréizaga, Elena
dc.contributor.authorKalcsics, Jörg
dc.contributor.authorNickel, Stefan
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa
dc.date.accessioned2016-03-17T15:09:08Z
dc.date.issued2015-02-12
dc.identifier.citationNuñez, A., Fernandez, E., Kalcsics, J., Nickel, S. Scheduling policies for multi-period services. "European journal of operational research", 12 Febrer 2015, vol. 251, núm. 3, p. 751-770.
dc.identifier.issn0377-2217
dc.identifier.urihttp://hdl.handle.net/2117/84649
dc.description.abstractThis paper discusses a multi-period service scheduling problem. In this problem, a set of customers is given who periodically require service over a finite time horizon. To satisfy the service demands, a set of operators is given, each with a fixed capacity in terms of the number of customers an operator can serve per period. The task is to determine for each customer the periods in which he will be visited by an operator such that the periodic service requests of the customers are adhered to and the total number of operators used over the time horizon is minimal. Two alternative policies for scheduling customer visits are considered. In the first one, a customer is visited just on time, i.e., in the period where he or she has a demand for service. The second policy allows service visits ahead of time. The rationale behind this policy is that allowing irregular visits may reduce the overall number of operators needed throughout the time horizon. To solve the problem, integer linear programming formulations are proposed for both policies and numerical experiments are presented that show the reduction in the number of operators used when visits ahead of time are allowed. As only small instances can be solved optimally, a heuristic algorithm is introduced in order to obtain good quality solutions and shorter computing times.
dc.format.extent20 p.
dc.language.isoeng
dc.publisherElsevier
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Optimització
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Combinatòria
dc.subject.lcshOperations research
dc.subject.lcshCombinatorial analysis
dc.subject.otherCombinatorial optimization
dc.subject.otherHeuristics
dc.subject.otherMulti-period problems
dc.subject.otherService scheduling
dc.titleScheduling policies for multi-period services
dc.typeArticle
dc.subject.lemacCombinatòria
dc.subject.lemacInvestigació operativa
dc.contributor.groupUniversitat Politècnica de Catalunya. GNOM - Grup d'Optimització Numèrica i Modelització
dc.identifier.doi10.1016/j.ejor.2015.12.002
dc.description.peerreviewedPeer Reviewed
dc.subject.amsClassificació AMS::05 Combinatorics
dc.subject.amsClassificació AMS::90 Operations research, mathematical programming::90B Operations research and management science
dc.rights.accessRestricted access - publisher's policy
drac.iddocument17567702
dc.description.versionPostprint (author's final draft)
dc.date.lift2019-06-30
upcommons.citation.authorNuñez, A., Fernandez, E., Kalcsics, J., Nickel, S.
upcommons.citation.publishedtrue
upcommons.citation.publicationNameEuropean journal of operational research
upcommons.citation.volume251
upcommons.citation.number3
upcommons.citation.startingPage751
upcommons.citation.endingPage770
 Find Full text

Fitxers d'aquest items

Imatge en miniatura

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple

Llevat que s'hi indiqui el contrari, els continguts d'aquesta obra estan subjectes a la llicència de Creative Commons: Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya