|
1. |
The Development of a Measure for End‐User Computing Support |
|
Decision Sciences,
Volume 25,
Issue 4,
1994,
Page 481-498
Rajesh Mirani,
William R. King,
Preview
|
PDF (972KB)
|
|
摘要:
AbstractVarious studies have argued and concluded that the most effective method of promotingend‐user computing (EUC) in an organization consists of providing extensive end‐user support. This paper describes the development of an instrument to measure EUC support A search of the EUC literature was conducted to identify items to include in the instrument. Theinstrument was validated by administering it in the form of a questionnaire to end‐users in more man a hundred information centers across the United States. A factor analysis conducted on the data obtained from this survey yielded 12 factors of EUC support. Three factors were subsequently dropped from the instrument. The remaining factors were successfully tested for internal consistency. The instrument was tested for, and found to possess, convergent and discriminant validity. The instrument exhibited nomological validity. The resulting instrument, consisting of 42 items and 9 factors, is presented as a reliable, valid, and useful device for assessing the level of EUC su
ISSN:0011-7315
DOI:10.1111/j.1540-5915.1994.tb00817.x
出版商:Blackwell Publishing Ltd
年代:1994
数据来源: WILEY
|
2. |
An Application of Expectancy Theory to Explain a Manager's Intention to Use a Decision Support System |
|
Decision Sciences,
Volume 25,
Issue 4,
1994,
Page 499-510
Ken C. Snead,
Adrian M. Harrell,
Preview
|
PDF (946KB)
|
|
摘要:
AbstractA continuing gap exists between the capabilities of sophisticated computer‐based information systems and the extent to which these systems are used by individuals. Studies which have examined the relationship between system utilization and various user, system, implementation, and organizational variables have provided few consistent findings. A new approach to this topic is suggested by a recent study by Davis, Bagozzi, and Warshaw [11], which indicates that individuals' intentions to use a system determine subsequent use. A large body of psychology‐based research also supports this relationship between behavioral intentions and subsequent behavior. This study employs expectancy theory, which has often been used to examine behavioral intentions, to explain managers' intentions to use a decision support system (DSS). The results imply that the variables of the expectancy force model are determinants of a manager's behavioral intentions to use a DSS, and the variables of the expectancy valence model are determinants of the attractiveness of using a DSS to a mana
ISSN:0011-7315
DOI:10.1111/j.1540-5915.1994.tb00818.x
出版商:Blackwell Publishing Ltd
年代:1994
数据来源: WILEY
|
3. |
Performance of Selected Part‐Machine Grouping Techniques for Data Sets of Wide Ranging Sizes and Imperfection |
|
Decision Sciences,
Volume 25,
Issue 4,
1994,
Page 515-539
Shashidhar Kaparthi,
Nallan C. Suresh,
Preview
|
PDF (1559KB)
|
|
摘要:
AbstractThis study addresses the part‐machine grouping problem in group technology, and evaluates die performance of several cell formation methods for a wide range of data set sizes. Algorithms belonging to four classes are evaluated: (1) array‐based methods: bond energy algorithm (BEA), direct clustering analysis (DCA) and improved rank order clustering algorithm (ROC2); (2) non‐hierarchical clustering method: ZODIAC; (3) augmented machine matrix methods: augmented p‐median method (APM) and augmented linear clustering algorithm (ALC); and (4) neural network algorithms: ART1 and variants: ART1/KS, ART1/KSC, and Fuzzy ART. The experimental design is based on a mixture‐model approach, utilizing replicated clustering. The performance measures include Rand Index and bond energy recovery ratio, as well as computational requirements for various algorithms. Experimental factors include problem size, degree of data imperfection, and algorithm tested. The results show that, among the algorithms applicable for large, industry‐size data sets, ALC and neural networks are superior to ZODIAC, which in turn is generally superior to array‐based methods of
ISSN:0011-7315
DOI:10.1111/j.1540-5915.1994.tb00819.x
出版商:Blackwell Publishing Ltd
年代:1994
数据来源: WILEY
|
4. |
Planning Service Capacity When Demand Is Sensitive to Delay |
|
Decision Sciences,
Volume 25,
Issue 4,
1994,
Page 541-553
Peter T. Ittig,
Preview
|
PDF (1003KB)
|
|
摘要:
AbstractThis paper presents a model designed to help determine the number of clerks or servers in a retail queuing situation. The model demonstrates a realistic treatment of the effect of waiting time on customer demand and revenues by treating the average waiting time as a form of price. Thus, the demand rate and service level are interrelated. The number of servers is obtained by balancing the cost of additional servers against the revenues and profits arising from greater demand. An example is shown, using data obtained from a supermarket, to demonstrate the insight gained from applying the model. Some extensions and research possibilities are considered, including a treatment of ancillary activities. An appendix examines a continuous version of the model which provides additional insight into the character of the model.
ISSN:0011-7315
DOI:10.1111/j.1540-5915.1994.tb00820.x
出版商:Blackwell Publishing Ltd
年代:1994
数据来源: WILEY
|
5. |
A Model for Resource Constrained Production and Inventory Management |
|
Decision Sciences,
Volume 25,
Issue 4,
1994,
Page 561-577
Kurt Bretthauer,
Bala Shetty,
Siddhartha Syam,
Susan White,
Preview
|
PDF (1074KB)
|
|
摘要:
AbstractWe present a general model for multi‐item production and inventory management problems that include a resource restriction. The decision variables in the model can take on a variety of interpretations, but will typically represent cycle times, production batch sizes, number of production runs, or order quantities for each item. We consider environments where item demand rates are approximately constant and performing an activity such as producing a batch of a product or placing an order results in the consumption of a scarceresource that is shared among the items. Some examples of shared resources include limited machine capacity, a restriction on the amount of money that can be tied up in stock, orlimited storage capacity. We focus on the case where the decision variables must be integer valued or selected from a discrete set of choices, such as when an integer number of production runs is desired for each item, or in order quantity problems where the items come in pack sizes containing more than one unit and, therefore, the order quantities must be an integer multiple of the pack sizes. We develop a heuristic and a branch and bound algorithm for solving the problem. The branch and bound algorithm includes reoptimization procedures and the heuristic to improve its performance. Computational testing indicates that the algorithms are effective for solving the general mode
ISSN:0011-7315
DOI:10.1111/j.1540-5915.1994.tb00821.x
出版商:Blackwell Publishing Ltd
年代:1994
数据来源: WILEY
|
6. |
Assembly Line Balancing Using Genetic Algorithms with Heuristic‐Generated Initial Populations and Multiple Evaluation Criteria* |
|
Decision Sciences,
Volume 25,
Issue 4,
1994,
Page 581-605
Yow‐Yuh Leu,
Lance A. Matheson,
Loren Paul Rees,
Preview
|
PDF (1594KB)
|
|
摘要:
AbstractWe use genetic algorithms (GA) to solve the assembly line balancing (ALB) problem. Inparticular, we show how this technique can be used to generate feasible line balances, improve upon solutions obtained by other heuristics reported in the literature, and utilizeany one or more evaluation criteria that can be expressed in functional form. The procedure is demonstrated with two examples: (1) intimating the improvement of heuristic‐generated ALB solutions by including them in the GA initial population, and (2) the possibility of balancing assembly lines with multiple criteria and side constraints. These examples suggest that GA can be a powerful tool in ALB. To investigate the utility of GA on single‐criterion problems, an experiment is conducted that compares both the GA approach and conventional heuristics. Results indicate that the GA solutions are significantly improved over the heuristic solutions under the conditions studied. It is also found that the presence of heuristic‐generated conventional solutions in the GA initial population leads to statistically preferred re
ISSN:0011-7315
DOI:10.1111/j.1540-5915.1994.tb00822.x
出版商:Blackwell Publishing Ltd
年代:1994
数据来源: WILEY
|
7. |
PAHAP: A Pairwise Aggregated Hierarchical Analysis of Ratio‐Scale Preferences |
|
Decision Sciences,
Volume 25,
Issue 4,
1994,
Page 607-624
Moonsig Kang,
Antonie Stam,
Preview
|
PDF (1051KB)
|
|
摘要:
AbstractIn this paper, we present a Pairwise Aggregated Hierarchical Analysis of Ratio‐Scale Preferences (PAHAP), a new method for solving discrete alternative multicriteria decision problems. Following the Analytic Hierarchy Process (AHP), PAHAP uses pairwise preference judgments to assess the relative attractiveness of the alternatives. By first aggregating the pairwise judgment ratios of the alternatives across all criteria, and then synthesizing based on these aggregate measures, PAHAP determines overall ratio scale priorities and rankings of the alternatives which are not subject to rank reversal, provided that certain weak consistency requirements are satisfied. Hence, PAHAP can serve as a useful alternative to the original AHP if rank reversal is undesirable, for instance when the system is open and criterion scarcity does not affect the relative attractiveness of the alternatives. Moreover, the single matrix of pairwise aggregated ratings constructed in PAHAP provides useful insights into the decision maker's preference structure. PAHAP requires the same preference information as the original AHP (or, altematively, the same information as the Referenced AHP, if the criteria are compared based on average (total) value of the alternatives). As it is easier to implement and interpret than previously proposed variants of the conventional AHP which prevent rank reversal, PAHAP also appears attractive from a practitioner's viewpoin
ISSN:0011-7315
DOI:10.1111/j.1540-5915.1994.tb00823.x
出版商:Blackwell Publishing Ltd
年代:1994
数据来源: WILEY
|
8. |
Economic Models for Single Sample Acceptance Sampling Plans, No Inspection, and 100 Percent Inspection |
|
Decision Sciences,
Volume 25,
Issue 4,
1994,
Page 625-645
Ross L. Fink,
Thomas M. Margavio,
Preview
|
PDF (1384KB)
|
|
摘要:
AbstractOnce a process is stabilized using control charts, it is necessary to determine whether this process is capable of producing die desired quality, as determined by the specifications, without the use of some additional inspection procedure such as 100 percent inspection or acceptance sampling. One common method of making this determination is the use of process capability ratios. However, this approach may lead to erroneous decisions due to the omission of economic information. This paper attempts to remedy this situation by developing economic models to examine the profitability of different inspection policies. These models employ the quadratic loss function to represent the economic cost of quality from external failures, which is commonly omitted or overlooked. Moreover, assuming a normal distribution for the quality characteristic allows the use of simplified formulas that are provided. Thus the calculations can be made using standard normal tables and a calculator. Additionally, these economic models may be used to determine if additional inspection procedures should be reinstated if the quality of the process was to decline, to make capital budgeting decisions involving new equipment that produces parts of a higher quality, and to determine the preferred 100 percent inspection plan or acceptance sampling plan.
ISSN:0011-7315
DOI:10.1111/j.1540-5915.1994.tb00824.x
出版商:Blackwell Publishing Ltd
年代:1994
数据来源: WILEY
|
9. |
On the Repeated Test‐Retest Reliability of the End‐User Computing Satisfaction Instrument: A Comment* |
|
Decision Sciences,
Volume 25,
Issue 4,
1994,
Page 655-665
Anthony R. Hendrickson,
Kristy Glorfeld,
Timothy Paul Cronan,
Preview
|
PDF (875KB)
|
|
摘要:
AbstractThis comment extends the test‐retest reliability of the end‐user computing satisfaction (EUCS) instrument by Torkzadeh and Doll [10]. Whereas Torkzadeh and Doll [10]reportedstability for two hour and two week EUCS test‐retest reliability, we investigate the test‐retest reliability of the EUCS instrument at two points in time, separated by a two yearinterval. We assess the end user computing satisfaction of personal computer, as well as mainframe, administrative end users in a large public organization. The results of the repeated test‐retest using differing application platforms add further support for the reliability of the EUCS measure and highlight some areas of concern for managers of informatio
ISSN:0011-7315
DOI:10.1111/j.1540-5915.1994.tb00825.x
出版商:Blackwell Publishing Ltd
年代:1994
数据来源: WILEY
|
|