376 resultados para Public relations management
Resumo:
Die Open Government Bewegung soll der Verwaltungsführung mehr Transparenz und Verständnis entgegenbringen. Durch Open Finance Apps werden Finanzangaben und dazugehörige Informationen verständlich zugänglich gemacht und Grössenverhältnisse veranschaulicht.
Resumo:
To enable buyers to be better informed before purchasing, products and services can be virtually experienced on the internet. Research into virtual experience (VE) and the related construct of telepresence (TP) as means of online marketing has made great progress in recent years. However, there is still disagreement in the literature concerning the exact understanding of these terms. In this study, the two terms are analyzed by means of a systematically executed literature review, differentiated from one another, and their understandings explained. This study is to our knowledge the first to compare the concepts of VE and TP in a systematic way. The analysis shows that TP is regarded as the feeling of presence conveyed by a communication medium. VE, on the other hand, is to be defined as an active state of a consumer through the use of computer-based presentation formats, and constituting a subtype of TP. These findings are intended to help VE and TP become more uniformly understood and make it easier to compare the results of future studies. Finally, from the literature review, it is possible to derive focal points for research in future studies.
Resumo:
Die Firma F. + H. Engel AG ist ein Bieler Familienunternehmen, das an fünf Standorten tätig ist und die Geschäftsbereiche Stahl, Haustechnik und Eisenwaren abdeckt. Seit über 15 Jahren setzt ENGEL für die Unterstützung ihrer Handelsprozesse die Standardsoftware OpaccOne ein. Dabei orientiert sich das Unternehmen an den durch die Software gegebenen Möglichkeiten, um eine möglichst sichere, stabile und langfristig tragfähige Lösung sicher zu stellen. Dank der Releasefähigkeit der gewählten Standard-Business-Software profitierte Engel ohne grössere Umstellungen von deren laufend erweiterten Fähigkeiten in Bezug auf Funktionalität, Technologie, Anpassungs- und Erweiterungsmöglichkeiten. Dadurch konnte sich ENGEL über die Jahre mit dieser Software stetig weiterentwickeln und auch neue Anforderungen abdecken. Problematisch erwies sich die durch die Einführung eines Webshops deutlich höhere Anforderung an Umfang und Qualität der Produktstammdaten für das umfangreiche Sortiment. Der Aufwand für deren Pflege konnte von ENGEL auf die Dauer nicht geleistet werden. Deshalb entschied man sich für eine zweigleisige Strategie, indem für einen Teil des Sortiments auf die Dienstleistungen eines externen Inhaltsanbieters zurückgegriffen wird
Resumo:
The central aim of our project is to explore the handling of e-mail request from customers by tourist organisations and to explain the perceived behaviour. For this purpose, we designed a qualitative empirical study which consists basically of two stages. The first stage consists of a black-box test where we employ the setting of a qualitative experiment to measure the behaviour of the organisation to an e-mail request. The second stage comprises a with-box test where we want to look into the tourist organizations and analyse the relevant information processes. This study should give as some insight in the internal processing of e-mail requests and thus should help to explain the reactions that we registered.
Resumo:
The present study demonstrates how consumers can suffer from sequential overchoice. Customizing a tailor-made suit from combined-attribute choices (e.g., deciding on color and fabric in combination) leads to less satisfaction and less additional consumption than customizing it from single-attribute choices (e.g., deciding on color, then on fabric). The effect is mediated by information overload and moderated by consideration set size.
Resumo:
In eWOM the relationship between the consumer and the reviewer is weak. Still, the present study argues that social information, for example the reviewer`s user picture, influences the product evaluation. By applying balance theory we predict that the evaluation of the recommended product is a function of the induced attitude towards the reviewer and the valence of the review. By utilizing either positive or negative user pictures and either positive or negative reviews, we confirmed the hypothesized interaction. Consumers rated a negatively reviewed product more favorable when the reviewer used a negative user picture, compared to a positive user picture.
Resumo:
When viewing web-consumer reviews consumers encounter the reviewers in an anonymous environment. Although their interactions are only virtual they still exchange social information, e.g. often reviewers refer to their proficiency or consumption motives within the review texts. Do these social information harm the viewers’ perception of the recommended products? The present study addresses this question by applying the paradigm of social comparison (Mussweiler, 2003) to web-consumer reviews. In a laboratory experiment with a student sample (n = 120) we manipulated the perceived similarity between reviewer and viewer and the perceived proficiency of the reviewer. A measurement of achievement goals (Elliott & McGregor, 2001) and average number of hours of study prior to the experiment allowed to introduce the reviewer as high [low] in proficiency and similar [dissimilar] in achievement goals. As predicted, the viewer’s evaluation of the recommended products differed as a function of this social information. Contrasting with the reviewer led to devaluing the products recommended by a proficient but dissimilar reviewer. However, against our prediction social comparison with the reviewer did not affect the viewer`s self-evaluation. Whether social information in web-product reviews affects the viewer`s self-evaluation and induces both social comparison processes remains an open question. Future studies aim to address this by manipulating the informational focus of the viewer, rather than the perceived similarity between viewer and reviewer. So far, the present study extends the application of social comparison to consumption environments and contributes to the understanding of the virtual social identity.
Resumo:
This paper deals with scheduling batch (i.e., discontinuous), continuous, and semicontinuous production in process industries (e.g., chemical, pharmaceutical, or metal casting industries) where intermediate storage facilities and renewable resources (processing units and manpower) of limited capacity have to be observed. First, different storage configurations typical of process industries are discussed. Second, a basic scheduling problem covering the three above production modes is presented. Third, (exact and truncated) branch-and-bound methods for the basic scheduling problem and the special case of batch scheduling are proposed and subjected to an experimental performance analysis. The solution approach presented is flexible and in principle simple, and it can (approximately) solve relatively large problem instances with sufficient accuracy.
Resumo:
Car manufacturers increasingly offer delivery programs for the factory pick-up of new cars. Such a program consists of a broad range of event-marketing activities. In this paper we investigate the problem of scheduling the delivery program activities of one day such that the sum of the customers’ waiting times is minimized. We show how to model this problem as a resource-constrained project scheduling problem with nonregular objective function, and we present a relaxation-based beam-search solution heuristic. The relaxations are solved by exploiting a duality relationship between temporal scheduling and min-cost network flow problems. This approach has been developed in cooperation with a German automaker. The performance of the heuristic has been evaluated based on practical and randomly generated test instances.
Resumo:
We study a real-world scheduling problem arising in the context of a rolling ingots production. First we review the production process and discuss peculiarities that have to be observed when scheduling a given set of production orders on the production facilities. We then show how to model this scheduling problem using prescribed time lags between operations, different kinds of resources, and sequence-dependent changeovers. A branch-and-bound solution procedure is presented in the second part. The basic principle is to relax the resource constraints by assuming infinite resource availability. Resulting resource conflicts are then stepwise resolved by introducing precedence relationships among operations competing for the same resources. The algorithm has been implemented as a beam search heuristic enumerating alternative sets of precedence relationships.
Resumo:
An Advanced Planning System (APS) offers support at all planning levels along the supply chain while observing limited resources. We consider an APS for process industries (e.g. chemical and pharmaceutical industries) consisting of the modules network design (for long–term decisions), supply network planning (for medium–term decisions), and detailed production scheduling (for short–term decisions). For each module, we outline the decision problem, discuss the specifi cs of process industries, and review state–of–the–art solution approaches. For the module detailed production scheduling, a new solution approach is proposed in the case of batch production, which can solve much larger practical problems than the methods known thus far. The new approach decomposes detailed production scheduling for batch production into batching and batch scheduling. The batching problem converts the primary requirements for products into individual batches, where the work load is to be minimized. We formulate the batching problem as a nonlinear mixed–integer program and transform it into a linear mixed–binary program of moderate size, which can be solved by standard software. The batch scheduling problem allocates the batches to scarce resources such as processing units, workers, and intermediate storage facilities, where some regular objective function like the makespan is to be minimized. The batch scheduling problem is modelled as a resource–constrained project scheduling problem, which can be solved by an efficient truncated branch–and–bound algorithm developed recently. The performance of the new solution procedures for batching and batch scheduling is demonstrated by solving several instances of a case study from process industries.
Resumo:
The paper deals with batch scheduling problems in process industries where final products arise from several successive chemical or physical transformations of raw materials using multi–purpose equipment. In batch production mode, the total requirements of intermediate and final products are partitioned into batches. The production start of a batch at a given level requires the availability of all input products. We consider the problem of scheduling the production of given batches such that the makespan is minimized. Constraints like minimum and maximum time lags between successive production levels, sequence–dependent facility setup times, finite intermediate storages, production breaks, and time–varying manpower contribute to the complexity of this problem. We propose a new solution approach using models and methods of resource–constrained project scheduling, which (approximately) solves problems of industrial size within a reasonable amount of time.