MétaCan
Menu
Retour à la cohorte
Enregistrement W4254803445 · doi:10.1287/opre.1110.1021

Contributors

2011· article· en· W4254803445 sur OpenAlexaboutno aff

Notice bibliographique

RevueOperations Research · 2011
Typearticle
Langueen
DomaineBusiness, Management and Accounting
ThématiqueSupply Chain and Inventory Management
Établissements canadiensnon disponible
Organismes subventionnairesnon disponible
Mots-clésComputer science

Résumé

récupéré en direct d'OpenAlex

Gad Allon (“ ‘We Will Be Right with You’: Managing Customer Expectations with Vague Promises and Cheap Talk ”) is an associate professor of managerial economics and decision science at the Kellogg School of Management at Northwestern University. Recently he has been studying models of information sharing among firms and customers both in service and retail settings. He is also conducting empirical studies to investigate time-based competition in the fast-food industry as well as the factors contributing to emergency department overcrowding. Ravi Anupindi (“ Integrated Optimization of Procurement, Processing, and Trade of Commodities ”) is Michael R. and Mary Kay Hallman Fellow and Professor of Operations Management at the Stephen M. Ross School of Business at the University of Michigan, Ann Arbor. His main research areas include supply chain management, strategic sourcing, lean operations, and marketing-operations interfaces. His more recent interest is in supply chain issues as well as health-care delivery models in the emerging economies. Achal Bassamboo (“ ‘We Will Be Right with You’: Managing Customer Expectations with Vague Promises and Cheap Talk ”) is an associate professor of managerial economics and decision science at the Kellogg School of Management at Northwestern University. His research interests lie in the areas of service systems, revenue management, and information sharing. His current research involves designing flexible service systems with a focus on capacity planning and effects of parameter uncertainty. He is also studying credibility of information provided by a service provider or a retailer to its customers. Dimitris Bertsimas (“ Optimal Selection of Airport Runway Configurations ”) is the Boeing Leaders for Global Operations Professor of Management at Massachusetts Institute of Technology (MIT), the codirector of the Operations Research Center at MIT, and a member of the National Academy of Engineering. His research interests include discrete, robust, and stochastic optimization and their applications. E. Borgonovo (“ A Study of Interactions in the Risk Assessment of Complex Engineering Systems: An Application to Space PSA ”) is the director of the ELEUSI research center and associate professor at the Department of Decision Sciences, Bocconi University, Milan, Italy. He received his Ph.D. at Massachusetts Institute of Technology. He is a recipient of several national and international awards, including the McCormack Fellowship of the Westinghouse Corporation. He is a member of the editorial boards of several journals including European Journal of Operational Research, Reliability Engineering and System Safety, International Journal of Mathematics in Operational Research, International Journal of Risk Management, and International Journal of Service and Computing-Oriented Manufacturing. He is the author of more than 90 publications. Ivan Contreras (“ Benders Decomposition for Large-Scale Uncapacitated Hub Location ”) is a post-doctoral fellow at HEC Montréal and at the Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT). In 2009 he received his Ph.D. degree from the Department of Statistics and Operations Research at the Technical University of Catalonia. His research interests include location analysis, network design, combinatorial optimization, and decomposition methods for large-scale optimization. His main papers have appeared in Transportation Science, INFORMS Journal on Computing, European Journal of Operational Research, Computers & Operations Research, Operations Research Spectrum, and Annals of Operations Research. Jean-François Cordeau (“ Benders Decomposition for Large-Scale Uncapacitated Hub Location ”) is a professor of logistics and operations management at HEC Montréal, where he holds the Canada Research Chair in Logistics and Transportation. He is also an assistant director of the Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT) and member of the Groupe d'études et de recherche en analyse des décisions (GERAD). He is associate editor of Asia-Pacific Journal of Operational Research, INFOR, OR Insight, and a member of the editorial board of Computers & Operations Research. He has authored or coauthored more than 80 articles in the areas of transportation, logistics, combinatorial optimization, and decomposition methods for large-scale optimization. Sripad K. Devalkar (“ Integrated Optimization of Procurement, Processing, and Trade of Commodities ”) is an assistant professor of operations management at the Indian School of Business. His interests lie in exploring problems at the interface of operations management, finance, and risk management. The research published here was conducted when he was a Ph.D. student in the Operations and Management Science Department at the Stephen M. Ross School of Business at the University of Michigan, Ann Arbor. Francis de Véricourt (“ Nurse Staffing in Medical Units: A Queueing Perspective ”) is an associate professor of technology and operations management at INSEAD and adjunct professor at Duke University. His academic interests are in operations excellence. His recent research focuses on health care and sustainability. Andreas Ehrenmann (“ Generation Capacity Expansion in a Risky Environment: A Stochastic Equilibrium Analysis ”) is chief analyst in the Center of Expertise in Economic Modeling and Studies in GDF Suez. He obtained his Diploma in mathematics from the University of Karlsruhe and his Ph.D. from the Judge Business School of the University of Cambridge (Management Science Group). Jiejian Feng (“ An Optimal Policy for Joint Dynamic Price and Lead-Time Quotation ”) is a visiting faculty member in the Business School of St. Mary's University in Halifax, Nova Scotia, Canada. He received his Ph.D. in operations management, his M.Phil. in human factors from the Hong Kong University of Science and Technology, and his B.A. in applied mathematics from the South China University of Technology. His research interests include operations management, financial engineering, and footwear design and development. Michael Frankovich (“ Optimal Selection of Airport Runway Configurations ”) is a doctoral candidate at the Operations Research Center at Massachusetts Institute of Technology. He is broadly interested in optimization and its applications, notably in transportation. Cheng-Der Fuh (“ Efficient Simulation of Value at Risk with Heavy-Tailed Risk Factors ”) is Chair Professor in the Graduate Institute of Statistics, National Central University, and research fellow in the Institute of Statistical Science, Academia Sinica, both in Taiwan. His research interests are in hidden Markov models, Markov chain Monte Carlo, change point detection, and quantitative finance. This paper reflects part of his continuing interest and effort in constructing efficient simulation schemes. Itai Gurvich (“ ‘We Will Be Right with You’: Managing Customer Expectations with Vague Promises and Cheap Talk ”) is an assistant professor of managerial economics and decision science at the Kellogg School of Management at Northwestern University. He studies queueing aspects of large-scale service systems with a focus on network design, staffing, and routing decisions. Arie Harel (“ Convexity Results for the Erlang Delay and Loss Formulae When the Server Utilization Is Held Constant ”) is an associate professor at the Zicklin School of Business, Baruch College, City University of New York. This paper continues his long-standing interest in the convexity properties of queueing systems. Tobias Harks (“ The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games ”) is a postdoctoral researcher at the Combinatorial Optimization and Graph Algorithms Group of the Institute of Mathematics at Technical University Berlin. His research covers algorithmic game theory, approximation algorithms, and online algorithms. He is particularly interested in formulating and analyzing game-theoretic models related to traffic and computer networks. Ya-Hui Hsu (“ Efficient Simulation of Value at Risk with Heavy-Tailed Risk Factors ”) completed her Ph.D. in statistics at the University of Illinois at Urbana–Champaign. She works as a statistician at Abbott Laboratories, a health-care company based in Abbott Park, Illinois. Her research interests include quantile regression, risk management, Bayesian inference, stochastic calculus, and importance sampling. This paper reflects part of her continuing interest and effort in constructing efficient simulation schemes. Inchi Hu (“ Efficient Simulation of Value at Risk with Heavy-Tailed Risk Factors ”) is a professor at the School of Business and Management, Hong Kong University of Science and Technology. This paper reflects part of his continuing interest and effort in constructing efficient simulation schemes. A. J. E. M. Janssen (“ Refining Square-Root Safety Staffing by Expanding Erlang C ”) received his engineering degree and Ph.D. degree in mathematics from the Eindhoven University of Technology (TU/e), the Netherlands, in 1976 and 1979, respectively. From 1979 to 1981 he was a Bateman Research Instructor at the Mathematics Department of California Institute of Technology. From 1981 until 2010 he worked with Philips Research Laboratories, Eindhoven, where he was a research fellow since 1999 and recipient of the Gilles Holst Award in 2003. His principal responsibility at Philips Research was to provide high-level mathematical service and consultancy in mathematical analysis. He continues his research and consu

Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.

Comment cette classification a été obtenuedéplier

Prédiction distillée sur la base complète

Imitation des enseignants

Ni prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.

score de la tête « metaresearch » (Codex)0,001
score de la tête « metaresearch » (Gemma)0,000
Version: codex-gemma-dda1882f352aStatut de validation: machine_predicted_unvalidated
Catégories candidatesCharge utile insuffisante (le modèle a refusé de juger)
Catégories consensuellesCharge utile insuffisante (le modèle a refusé de juger)
DomaineSignal candidat: aucune · Signal consensuel: aucune
Devis d'étudeSignal candidat: Sans objet · Signal consensuel: aucune
GenreSignal candidat: Empirique · Signal consensuel: aucune
Score de désaccord entre enseignants0,897
Score d'incertitude au seuil0,995

Scores Codex et Gemma par catégorie

CatégorieCodexGemma
Métarecherche0,0010,000
Méta-épidémiologie (sens strict)0,0000,000
Méta-épidémiologie (sens large)0,0000,000
Bibliométrie0,0000,001
Études des sciences et des technologies0,0000,000
Communication savante0,0000,001
Science ouverte0,0000,000
Intégrité de la recherche0,0000,000
Charge utile insuffisante (le modèle a refusé de juger)0,0080,005

Scores machine (provisoires)

Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.

Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.

Tête enseignante Opus0,244
Tête enseignante GPT0,339
Écart entre enseignants0,095 · la distance entre les deux têtes enseignantes sur ce seul travail
Statut de validationscore_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle

Classification

machine, non validée

Prédiction automatique; les deux têtes enseignantes s’accordent sur ce qui est montré ici.

Devis d'étudeSans objet
Domainenon disponible
GenreEmpirique

Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».

En bref

Citations0
Publié2011
Routes d'admission1
Résumé présentoui

Explorer davantage

Même revueOperations ResearchMême sujetSupply Chain and Inventory ManagementTravaux en français237 207