Les Inscriptions à la Bibliothèque sont ouvertes en
ligne via le site: https://biblio.enp.edu.dz
Les Réinscriptions se font à :
• La Bibliothèque Annexe pour les étudiants en
2ème Année CPST
• La Bibliothèque Centrale pour les étudiants en Spécialités
A partir de cette page vous pouvez :
Retourner au premier écran avec les recherches... |
Détail de l'auteur
Auteur Liao, C.-J.
Documents disponibles écrits par cet auteur
Affiner la rechercheAn application of variable neighbourhood search to hospital call scheduling of infant formula promotion / Lin, H.-Y. in Journal of the operational research society (JORS), Vol. 62 N° 6 (Juin 2011)
[article]
in Journal of the operational research society (JORS) > Vol. 62 N° 6 (Juin 2011) . - pp. 949–959
Titre : An application of variable neighbourhood search to hospital call scheduling of infant formula promotion Type de document : texte imprimé Auteurs : Lin, H.-Y., Auteur ; Liao, C.-J., Auteur ; Tseng, C.-T., Auteur Année de publication : 2011 Article en page(s) : pp. 949–959 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling Hospitals Variable neighbourhood search Travelling salesman Index. décimale : 001.424 Résumé : In the infant formula industry, products must rely on the prescription or recommendation from healthcare physicians (HCPs). Therefore, it is the most important activity in sales promotion to call on the identified HCPs in the prospected hospitals by the territory promotional sales representatives (PSRs). The PSRs have to establish their monthly hospital call schedule according to several constraints. In this paper, we investigate the hospital call scheduling of PSRs, a real-world case provided by an international infant formula company operating in Taiwan. The objective is minimising the total travel time. First, we present a four-phase heuristic to quickly generate a feasible schedule. We then apply a variable neighbourhood search incorporated with memory and revolver schemes to improve the solution quality. Through extensive computational experiments, it is shown that the proposed solution approaches are quite effective in terms of solution quality and computation time. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n6/abs/jors201042a.html [article] An application of variable neighbourhood search to hospital call scheduling of infant formula promotion [texte imprimé] / Lin, H.-Y., Auteur ; Liao, C.-J., Auteur ; Tseng, C.-T., Auteur . - 2011 . - pp. 949–959.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 62 N° 6 (Juin 2011) . - pp. 949–959
Mots-clés : Scheduling Hospitals Variable neighbourhood search Travelling salesman Index. décimale : 001.424 Résumé : In the infant formula industry, products must rely on the prescription or recommendation from healthcare physicians (HCPs). Therefore, it is the most important activity in sales promotion to call on the identified HCPs in the prospected hospitals by the territory promotional sales representatives (PSRs). The PSRs have to establish their monthly hospital call schedule according to several constraints. In this paper, we investigate the hospital call scheduling of PSRs, a real-world case provided by an international infant formula company operating in Taiwan. The objective is minimising the total travel time. First, we present a four-phase heuristic to quickly generate a feasible schedule. We then apply a variable neighbourhood search incorporated with memory and revolver schemes to improve the solution quality. Through extensive computational experiments, it is shown that the proposed solution approaches are quite effective in terms of solution quality and computation time. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n6/abs/jors201042a.html