Search results

This paper is a rejoinder to Lusch and Vargo's defense of their service‐dominant logic paper against criticism.

The paper responds to Lusch and Vargo's defense and criticism of the initial article primarily through examining the logic of their case.

The paper finds that both the charges and the arguments against the criticism have no merit.

The paper offers guidance as to the approach needed to advance the study of service marketing. This rejects the notion that viewing all businesses as service entities is a progressive approach but recommends a disjunctive definition of service, which would throw up service‐categories that needed to be studied in their own right if progress is to be made.

The paper suggests that Lusch and Vargo's S‐D‐dominant logic is unlikely to be practically fruitful while remaining theoretically limited.

A new method of document retrieval is presented on the basis of fundamental fuzzy set theory operations and the notion of a semantic disjunctive normal form. Concepts of semantic normal forms are defined, i.e. the semantic disjunctive normal form and the semantic conjunctive normal form, and their elementary properties, are presented. The syntax and the semantics of the proposed document retrieval language are given and an algorithm for allocating documents to particular queries is described. The document retrieval strategy based on the concept of a semantic disjunctive normal form is exemplified. A basic advantage of the use of the fuzzy set theory for the document retrieval system description is that it takes, in a simple way, into consideration the differentiation of descriptor importance, document search patterns and the differentiation of formal relevance grades of individual documents to a given query. In an information system the documents of the highest grades of formal relevance to a given query are retrieved by means of the application of simple operations of the fuzzy set theory.

The disjunctive graph is a network representation of the job‐shop scheduling problem, while the longest path problem (LPP) is one of the most important subjects in this research field. This paper aims to study the special topological structure of the disjunctive graph, and proposes a suite of quick value‐setting algorithms for solving the LPPs commonly encountered in job‐shop scheduling.

The topological structure of the disjunctive graph is analyzed, and some properties and propositions regarding LPPs are presented. Subsequently, algorithms are proposed for solving LPPs encountered in job‐shop scheduling.

The proposed algorithms significantly improve the efficiency of the shifting‐bottleneck procedure, making it practicable to realise real‐time scheduling and hence effective operations of modern manufacturing systems.

The paper demonstrates that it is possible to develop very efficient algorithms by imposing a special topological structure on the network.

This article characterises the questioning behaviour in reference interviews preceding delegated online searches of bibliographic databases and relates it to questioning behaviour in other types of interviews/settings. With one exception, the unit of analysis is the question (N=610), not the interview. The author uses A.C. Graesser‘s typology of questions to analyse type of question and M.D. White’s typology of information categories to determine the question‘s content objective; this is the first application of Graesser’s typology to interview questions in any setting. Graesser‘s categories allow for a more subtle understanding of the kind of information need underlying a question. Comparisons are made between questions asked by the information specialist and those asked by the client. Findings show that the information specialist dominates the interview, about half the questions were verification questions and about 22% were judgemental questions or requests; all but four types of questions from Graesser’s categories appeared in the interviews, but no new question types were discovered. Clients often phrase questions as requests. In content, both clients and information specialists focus on the subject and service requested, but the clients ask also about search strategy and output features. Both parties ask predominantly short‐answer questions. Results are related to interface design for retrieval systems.

The purpose of this paper is to measure the financial risk and optimal capital structure of a corporation.

Irregular disjunctive programming problems arising in firm models and risk management can be solved by the techniques presented in the paper.

Parallel processing and mathematical modeling provide a fruitful basis for solving ultra-scale non-convex general disjunctive programming (GDP) problems, where the computational challenge in direct mixed-integer non-linear programming (MINLP) formulations or single processor algorithms would be insurmountable.

The test is limited to a single firm in an experimental setting. Repeating the test on large sample of firms in future research will indicate the general validity of Monte-Carlo-based VAR estimation.

The authors show that the risk surface of the firm can be approximated by integrated use of accounting logic, corporate finance, mathematical programming, stochastic simulation and parallel processing.

Parallel processing has potential to simplify large-scale MINLP and GDP problems with non-convex, multi-modal and discontinuous parameter generating functions and to solve them faster and more reliably than conventional approaches on single processors.

The aim of this paper is to explore the role of social socialization tactics on the relationship between task‐ and organization‐related information (socialization content) and newcomers' affective commitment to their work organization.

A total of 280 new hires in a Greek service company participated in a survey. Moderated regression analyses were conducted to test research hypotheses.

The results supported the role of investiture‐divestiture tactics as a moderator in the relationship between newcomers' task‐related information acquisition and organizational affective commitment. In addition, serial‐disjunctive tactics were found to moderate the relationship between organization‐related information acquisition and newcomers' affective commitment. The study also demonstrated that both task‐related and organization‐related information acquisition are important to the development of newcomers' affective commitment at the early stages of the socialization process.

Owing to the cross‐sectional design of the research, causality cannot be drawn.

The knowledge of whether, and the extent to which, particular socialization tactics and content areas contribute to newcomers' adjustment would provide organizations a competitive advantage by incorporating them into their socialization programs.

Provision of feedback affirming newcomers' personal characteristics as well as assignment of established role models were found to provide the framework within which the acquisition of task and organization‐related information respectively are related to new hires' affective commitment towards their work organization.

This chapter reviews models of decision-making and choice under conditions of certainty. It allows readers to position the contribution of the other chapters in this book in the historical development of the topic area.

Bounded rationality is defined in terms of a strategy to simplify the decision-making process. Based on this definition, different models are reviewed. These models have assumed that individuals simplify the decision-making process by considering a subset of attributes, and/or a subset of choice alternatives and/or by disregarding small differences between attribute differences.

A body of empirical evidence has accumulated showing that under some circumstances the principle of bounded rationality better explains observed choices than the principle of utility maximization. Differences in predictive performance with utility-maximizing models are however small.

The chapter provides a detailed account of the different models, based on the principle of bounded rationality, that have been suggested over the years in travel behaviour analysis. The potential relevance of these models is articulated, model specifications are discussed and a selection of empirical evidence is presented. Aspects of an agenda of future research are identified.

In previous work, the algebraical properties of this rule and its relationship with other generalized operator was studied. In this paper, the aim is to focus on one of the previous steps, which consists in certainty qualification, and it is investigated how this factor influences the behavior of the induced combination rule.

Dubois and Prade have proposed an adaptive combination rule that moves gradually from a conjunctive mode to a disjunctive mode as soon as the conflict between the sources increases. The proposal can be viewed as a result of some rational steps. This includes: conjunctive combination; re‐normalization of a subnormal result that may results from conjunctive operation where the lack of normalization is interpreted as a conflict; certainty qualification; restriction of the conflict influence; generalization to more than two sources.

Algebraical properties of the proposals have been investigated and illustrations of some special cases are highlighted and evaluated. Further studies continue in Part II.

New functional adaptive rules are put forward based on Residual implicators and t‐conorm operators.

This study empirically investigates consumers’ use of five heuristics (conjunctive, disjunctive, lexicographic, linear additive, and geometric compensatory) in the consideration set formation, a critical first phase before actual choice behavior. Data were collected on the selection of beer brands and fast food outlets by real consumers. Using a decomposition approach in determining the consumers’ choice heuristics, it was found that the conjunctive heuristic is the most often used decision model in the consideration set formation for the two product classes. Implications for brand managers and future research directions are developed.

The OTS/CafeOBJ method can be used to formally model, specify and verify distributed systems such as security protocols and railroad systems. A distributed system is modeled as an OTS, a kind of transition system, and the OTS is specified and verified with CafeOBJ, an algebraic specification language. Case analysis (or case splitting) is one of the most intellectual pieces of work in verification. Case analysis should be done entirely by hand in the OTS/CafeOBJ method, which is errorprone. It is indispensable to cover all cases and find necessary lemmas for some sub‐cases where desired results are not obtained in case analysis. We propose two methods of mechanically supporting case analysis, which concern these two issues. A case study that the proposed methods are effectively applied to a railroad signaling system is also reported.