摘要:

ABSTRACTOne hundred and seventy‐seven cases profiling organizational decisions were analyzed to determine how managers carry out formulation as they initiate a decision‐making process. Analysis revealed that formulation was carried out by applying problem, idea, target, and reframing tactics. Decision adoption rates, decision value, and time to carry out the decision‐making process were used to determine the success of these tactics, controlling for situational effects of importance, urgency, resources, and management level. Reframing was found to be the most successful tactic under all conditions, but was the least frequently used by decision makers. Problem and idea tactics were the least successful and success did not improve with additional resources, but these tactics were used more often than the other tactics. Problem tactics were even less successful when applied to urgent and important decisions. Target tactics were surprisingly effective for crises and important decisions. Decision makers seem prone to use ineffective formulation tactics and give little consideration to the opportunities or constraints imposed by the situation as a tactic is sel

ISSN:0011-7315    

DOI:10.1111/j.1540-5915.1992.tb00404.x

出版商:Blackwell Publishing Ltd    

年代:1992

数据来源: WILEY

摘要:

ABSTRACTIn this paper, five alternative advertising policies that belong to the advertising pulsation class are compared analytically for linear and concave response functions using a modified version of the Vidale‐Wolfe model. The results of the research show that (1) For both linear and concave response functions, advertising pulsing/maintenance policy dominates advertising pulsing policy but is dominated by the Uniform Advertising Policy. For convex response functions, the order of dominance is reversed. (2) For linear response functions, uniform advertising policy dominates the impulse advertising policy but is dominated by the chattering advertising policy. (3) For concave response functions, uniform advertising policy dominates both the impulse advertising policy and the chattering advertising policy. (4) For convex response functions, chattering advertising policy dominates both the advertising pulsing policy and the impulse advertising policy.The Vidale‐Wolfe model is estimated using the well‐known Lydia Pinkham data. Optimality analysis shows that the company was overadvertising about half of the time studied. Overadvertising seems to have produced appreciable gain in sales and created significant barriers to competitive entry at a little cost in terms of foregone pr

ISSN:0011-7315    

DOI:10.1111/j.1540-5915.1992.tb00405.x

出版商:Blackwell Publishing Ltd    

年代:1992

数据来源: WILEY

摘要:

ABSTRACTA simulation study was conducted to investigate the behavior of family scheduling procedures in a dynamic dispatching environment. Two scheduling rules that incorporate setup avoidance mechanisms (FCFS‐F and SPT‐F) and two that do not (FCFS and SPT) were applied to a single machine. The scheduling environment was varied by controlling several important factors: the machine utilization, the number of setup configurations (families), the size of the family setup times relative to the job run times, the frequency by which members of the part families were released for processing, and the distribution of job interarrival and job run times.The major results from the study are the following: (1) The degree of stability in the system is the most influential factor with respect to mean flow time and flow time variance. Under low variance service and interarrival time distributions, the impact of scheduling rule selection is minor. (2) Conversely, under unstable scheduling situations, family scheduling procedures can have a substantial impact. (3) Clear interaction effects are noticed between all factors. The environment most conducive to family scheduling is characterized by high resource utilization, low setup‐to‐run time ratio, few part families, and erratic job arrivals. (4) Under conditions favorable to family scheduling, setup avoiding procedures can be used to increase output while at the same time reduce the mean and variance of flow time. (5) The shortest processing time rule (SPT) performs well with respect to mean flow time when relative setup times are small. Overall, however, SPT‐F generates the lowest mean flow time while FCFS‐F produces the lowest flow time variance.This study shows that scheduling procedures that consider setups in their structure can outperform rules that do not under many different operating conditions. However, the magnitude of this advantage very much depends on the scheduling environment. The results also highlight the fact that it may be better to try to reshape the manufacturing environment than worry about selecting the correct scheduling rule. If the environment cannot be stabilized, then the choice of a setup avoiding procedure, allocation of families to machines, and setup reduction become impor

ISSN:0011-7315    

DOI:10.1111/j.1540-5915.1992.tb00406.x

出版商:Blackwell Publishing Ltd    

年代:1992

数据来源: WILEY

摘要:

ABSTRACTWe examine a single‐machine scheduling problem where the objective is to minimize the mean and the variance of the job completion times simultaneously. We seek to identify the efficient frontier which is obtained by parametrically solving a weighted combination of the two criteria. The identification of the true efficient frontier for this problem is notoriously difficult. To estimate the frontier, we propose a heuristic procedure which is quite general and can be applied to other bi‐criteria problems as well. It involves repeated applications of a relatively new technique called beam search in an adaptive manner. To evaluate the proposed procedure, we introduce two measures of performance and conduct a computational study. The results of the study indicate that the procedure is highly effect

ISSN:0011-7315    

DOI:10.1111/j.1540-5915.1992.tb00407.x

出版商:Blackwell Publishing Ltd    

年代:1992

数据来源: WILEY

摘要:

ABSTRACTCoordinated replenishment strategies may be implemented by jointly ordering multiple items from a common supplier. A major benefit of coordinated replenishment is that it increases the size of shipments, permitting the buyer to enjoy transportation economies without a major increase in average inventory levels. The coordinated replenishment problem is complex because side constraints govern the attainment of transportation rate breaks. The problem is further complicated by the presence of purchase quantity discount opportunities. Thus, the buyer must decide which items to order independently, which items to include in a group order, and the order quantities of each item, governed by the frequency of independent or group orders.We present a mathematical model and a heuristic solution procedure that provide analytical support to the buyer seeking to minimize total costs of replenishing multiple items from a common supplier. The relevant costs are purchase prices, ordering costs, holding costs, and transportation costs. Coordinated replenishment provides nearly a 30 percent reduction in controllable costs relative to independent control. Experimentation with the heuristic has yielded optimal solutions over 88 percent of the time. When optimality was not obtained, the mean penalty was much less than one percent. The average heuristic search was more than two orders of magnitude faster than branch and bound, even for small problems, and possessed a much tighter distribution around the mean search time.

ISSN:0011-7315    

DOI:10.1111/j.1540-5915.1992.tb00408.x

出版商:Blackwell Publishing Ltd    

年代:1992

数据来源: WILEY

摘要:

ABSTRACTDepending on the techniques employed, the due date assignment, release, and sequencing procedures in job shop scheduling may depend on one another. This research investigates the effects of these interactions with a simulation model of a dynamic five‐machine job shop in which early shipments are prohibited. Performance of the system is measured primarily in terms of the total cost (work‐in‐process cost, finished goods holding cost, and late penalty) incurred by the shop, but a number of non‐cost performance measures are also reported. The results support existence of a three‐way interaction between the due date, release, and sequencing procedures as well as interaction between shop utilization and procedure combination. Statistical tests are used to identify those rules that perform best both overall and in combination with ot

ISSN:0011-7315    

DOI:10.1111/j.1540-5915.1992.tb00409.x

出版商:Blackwell Publishing Ltd    

年代:1992

数据来源: WILEY

摘要:

ABSTRACTDespite the growing number of investigations examining decision support systems (DSS), relatively few empirical studies have evaluated the effects of DSS on problem‐solving processes. This study uses protocol analysis to investigate the impact of a specific decision aid on problem‐solving processes in a semi‐structured problem. Results indicate that decision aids influence the problem‐solving processes of decision makers. The effect of a decision aid is found to be contingent on familiarity with the decision aid, task familiarity, and the interaction of these two factors. Suggestions for incorporating interaction effects and problem‐solving processes into future examinations are

ISSN:0011-7315    

DOI:10.1111/j.1540-5915.1992.tb00410.x

出版商:Blackwell Publishing Ltd    

年代:1992

数据来源: WILEY

摘要:

ABSTRACTThe local telecommunication pricing decision on residential, business, and private lines is modeled. This study demonstrates that when regulators use a weighted sum linear goal programming model to determine prices, adjustments can be made to Ramsey prices that reflect the regulators’ concerns about the trade‐off of fairness with efficiency. An actual example shows that when regulators’ preferences were taken into account, residential prices were 14 percent lower than efficient optimal Ramsey p

ISSN:0011-7315    

DOI:10.1111/j.1540-5915.1992.tb00411.x

出版商:Blackwell Publishing Ltd    

年代:1992

数据来源: WILEY

摘要:

ABSTRACTBuilding models of expert decision‐making behavior from examples of experts’ decisions continues to receive considerable research attention. In the 1960's and 70's, linear models derived by statistical methods were studied extensively. More recently, rule‐based expert systems derived by induction algorithms have been the focus of attention. Few studies compare the two approaches. This paper reports on a study that compared linear models derived by logistic regression with rule‐based systems produced by two induction algorithms—ID3 and the genetic algorithm. The techniques performed comparably in modeling the experts at one task, graduate admissions, but differed significantly at a second task, bidder

ISSN:0011-7315    

DOI:10.1111/j.1540-5915.1992.tb00412.x

出版商:Blackwell Publishing Ltd    

年代:1992

数据来源: WILEY

摘要:

ABSTRACTMachine learning methods are currently the object of considerable study by the artificial intelligence community. Research on machine learning carries implications for decision making in that it seeks computational methods that mimic input‐output behaviors found in classes of decision‐making examples. At the same time, research in statistics and econometrics has resulted in the development of qualitative‐response models that can be applied to the same kind of problems addressed by machine‐learning models—particularly those that involve a classification decision. This paper presents the theoretical structure of a generalized qualitative‐response model and compares its performance to two seminal machine‐learning models in two problem domains associated with audit decision making. The results suggest that the generalized qualitative‐response model may be a useful alternative for certain

ISSN:0011-7315    

DOI:10.1111/j.1540-5915.1992.tb00413.x

出版商:Blackwell Publishing Ltd    

年代:1992

数据来源: WILEY