Articles scientifiques

A Knowledge Based DSS for Financial Planning

T. Villedieu, M. KLEIN

Engineering Costs and Production Economics

1987, vol. 12, pp.219-227

Départements : Informations Systems and Operations Management


Process Tracing Methods in DSS Research: Exploring the Black Box

P. A. TODD, I. BENBASAT

MIS Quarterly

décembre 1987, vol. 11, n°4, pp.493-512

Départements : Informations Systems and Operations Management

Mots clés : Protocol analysis, data collection, data analysis, research methods, decision support systems

http://www.jstor.org/stable/248979


An overview is provided of the applicability to DSS research of process tracing methodologies in general, and verbal protocol analysis in particular. Rationale is developed for why process tracing methods are an important addition to the inventory of methodologies available to researchers, stressing the need to explore the "black box" of decision processes. A variety of process tracing methods are presented, along with their relative strengths and weaknesses. Verbal protocol analysis is discussed as a particularly promising method for use in DSS research. The nature of verbal protocols is outlined and methods for analysis are reviewed. The criticisms of this method andthe controversy surrounding its use are discussed, and an assessment of the validity ofthese criticisms is provided. Finally, areas of DSS research in which protocols may provevaluable are identified and relevant studies are examined

The Generalized Expansion Method for Open Finite Queuing Networks

L. KERBACHE, J. Smith

European Journal of Operational Research

1987, vol. 32, pp.448-461

Départements : Informations Systems and Operations Management, GREGHEC (CNRS)


Blocking makes the exact analytical analysis of open queueing networks with finite capacities intractable except for very small networks, therefore, approximation approaches are needed to analyze these types of networks. For exponential open finite queueing networks, some methods have been proposed but little has been done so far on nonexponential open finite queueing networks. This paper introduces a new approximation technique for the analysis of general open finite queueing networks. Extensive numerical examples are performed for different network topologies and the results are compared with simulation

Contacts  


Informations Systems and Operations Management


Campus HEC Paris
1, rue de la Libération
78351 Jouy-en-Josas cedex
France

Faculté  

Laoucine KERBACHE

Informations Systems and Operations Management

Voir le CV

JavaScriptSettings