Documents disponibles écrits par cet auteur

Capacity planning with working time accounts in services / A. Corominas in Journal of the operational research society (JORS), Vol. 61 N° 2 (Fevrier 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 2 (Fevrier 2010) . - pp. 321–331 Titre : Capacity planning with working time accounts in services Type de document : texte imprimé Auteurs : A. Corominas, Auteur ; J. Olivella, Auteur ; R. Pastor, Auteur Année de publication : 2011 Article en page(s) : pp. 321–331 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Manpower  planning  Personnel  management  Working  time  Working  time  accounts  Capacity  planning Index. décimale : 001.424 Résumé : This paper presents, formalizes and classifies working time accounts (WTAs), a means of achieving flexible production capacity through the flexible organization of working time. We propose linear programming models to plan working time, using WTA, at companies in the service industry. A computational experiment shows that the models can be solved for any capacity planning problems of reasonable size. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n2/abs/jors2008166a.html [article] Capacity planning with working time accounts in services [texte imprimé] / A. Corominas, Auteur ; J. Olivella, Auteur ; R. Pastor, Auteur . - 2011 . - pp. 321–331. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 2 (Fevrier 2010) . - pp. 321–331 Mots-clés : Manpower  planning  Personnel  management  Working  time  Working  time  accounts  Capacity  planning Index. décimale : 001.424 Résumé : This paper presents, formalizes and classifies working time accounts (WTAs), a means of achieving flexible production capacity through the flexible organization of working time. We propose linear programming models to plan working time, using WTA, at companies in the service industry. A computational experiment shows that the models can be solved for any capacity planning problems of reasonable size. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n2/abs/jors2008166a.html

Designing greedy algorithms for the flow-shop problem by means of Empirically Adjusted Greedy Heuristics (EAGH) / A. Corominas in Journal of the operational research society (JORS), Vol. 62 N° 9 (Septembre 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 9 (Septembre 2011) . - pp. 1704–1710 Titre : Designing greedy algorithms for the flow-shop problem by means of Empirically Adjusted Greedy Heuristics (EAGH) Type de document : texte imprimé Auteurs : A. Corominas, Auteur ; R. Pastor, Auteur Année de publication : 2011 Article en page(s) : pp. 1704–1710 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Heuristics  Greedy  algorithms  Flow-shop  Combinatorial  optimization Index. décimale : 001.424 Résumé : This paper introduces Empirically Adjusted Greedy Heuristics (EAGH), a procedure for designing greedy algorithms for a given combinatorial optimization problem and illustrates the way in which EAGH works with an application to minimize the makespan in the permutation flow-shop problem. The basic idea behind EAGH is that a greedy heuristic can be seen as a member of an infinite set of heuristics, this set being defined by a function that depends on several parameters. Each set of values of the parameters corresponds to a specific greedy heuristic. Then, the best element of the set, for a training set of instances of the problem, is found by applying a non-linear optimization algorithm to a function that measures the quality of the obtained solutions to the instances of the training set, and which depends on the parameters that characterize each specific algorithm. EAGH allows improving known heuristics or finding good new ones. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n9/abs/jors2010131a.html [article] Designing greedy algorithms for the flow-shop problem by means of Empirically Adjusted Greedy Heuristics (EAGH) [texte imprimé] / A. Corominas, Auteur ; R. Pastor, Auteur . - 2011 . - pp. 1704–1710. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 9 (Septembre 2011) . - pp. 1704–1710 Mots-clés : Heuristics  Greedy  algorithms  Flow-shop  Combinatorial  optimization Index. décimale : 001.424 Résumé : This paper introduces Empirically Adjusted Greedy Heuristics (EAGH), a procedure for designing greedy algorithms for a given combinatorial optimization problem and illustrates the way in which EAGH works with an application to minimize the makespan in the permutation flow-shop problem. The basic idea behind EAGH is that a greedy heuristic can be seen as a member of an infinite set of heuristics, this set being defined by a function that depends on several parameters. Each set of values of the parameters corresponds to a specific greedy heuristic. Then, the best element of the set, for a training set of instances of the problem, is found by applying a non-linear optimization algorithm to a function that measures the quality of the obtained solutions to the instances of the training set, and which depends on the parameters that characterize each specific algorithm. EAGH allows improving known heuristics or finding good new ones. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n9/abs/jors2010131a.html

Fine-tuning a parametric Clarke and Wright heuristic by means of EAGH (empirically adjusted greedy heuristics) / A. Corominas in Journal of the operational research society (JORS), Vol. 61 N° 8 (Août 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 8 (Août 2010) . - pp. 1309–131 Titre : Fine-tuning a parametric Clarke and Wright heuristic by means of EAGH (empirically adjusted greedy heuristics) Type de document : texte imprimé Auteurs : A. Corominas, Auteur ; A. García-Villoria, Auteur ; R. Pastor, Auteur Année de publication : 2011 Article en page(s) : pp. 1309–131 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Fine-tuning  EAGH  Greedy  heuristics  Clarke  and  Wright  savings  heuristic  CVRP Index. décimale : 001.424 Résumé : Altınel and Öncan (2005) (A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem) proposed a parametric Clarke and Wright heuristic to solve the capacitated vehicle routing problem (CVRP). The performance of this parametric heuristic is sensitive to fine-tuning. Antinel and Öncan used an enumerative parameter-setting approach and improved on the results obtained with the original Clarke and Wright heuristic, but their approach requires much more computation time to solve an instance. Battarra et al (2008) (Tuning a parametric Clarke–Wright heuristic through a genetic algorithm) proposed a genetic algorithm to set the parameter values. They succeeded in reducing the time needed to solve an instance, but the quality of the solution was slightly worse. In this paper, we propose to use the EAGH (empirically adjusted greedy heuristics) procedure to set the parameter values. A computational experiment shows the efficiency of EAGH; in an even shorter time, we improve on the best results obtained with any parametric Clarke and Wright heuristic method proposed in the literature. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n8/abs/jors200989a.html [article] Fine-tuning a parametric Clarke and Wright heuristic by means of EAGH (empirically adjusted greedy heuristics) [texte imprimé] / A. Corominas, Auteur ; A. García-Villoria, Auteur ; R. Pastor, Auteur . - 2011 . - pp. 1309–131. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 8 (Août 2010) . - pp. 1309–131 Mots-clés : Fine-tuning  EAGH  Greedy  heuristics  Clarke  and  Wright  savings  heuristic  CVRP Index. décimale : 001.424 Résumé : Altınel and Öncan (2005) (A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem) proposed a parametric Clarke and Wright heuristic to solve the capacitated vehicle routing problem (CVRP). The performance of this parametric heuristic is sensitive to fine-tuning. Antinel and Öncan used an enumerative parameter-setting approach and improved on the results obtained with the original Clarke and Wright heuristic, but their approach requires much more computation time to solve an instance. Battarra et al (2008) (Tuning a parametric Clarke–Wright heuristic through a genetic algorithm) proposed a genetic algorithm to set the parameter values. They succeeded in reducing the time needed to solve an instance, but the quality of the solution was slightly worse. In this paper, we propose to use the EAGH (empirically adjusted greedy heuristics) procedure to set the parameter values. A computational experiment shows the efficiency of EAGH; in an even shorter time, we improve on the best results obtained with any parametric Clarke and Wright heuristic method proposed in the literature. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n8/abs/jors200989a.html