Search results

The purpose of this paper is to critique and extend contemporary scholarship on information and communication technologies (ICTs). This paper argues that the focus on the selection and use of a single communication medium limits the understanding of current ICT use in organizations. A combinatorial perspective is needed to capture the complexities of multiple ICTs use for achieving communication goals and completing tasks.

This paper addresses the trending phenomenon of combinatorial use of ICTs by offering a critical review of the theoretical studies and empirical research in scholarly books and journals and deriving novel theoretical research questions that set the stage for future studies.

This paper identifies how combinatorial ICT use as a perspective that uniquely elucidates ICT use in organizations, clarifies key terms used in previous research and proposes theoretical and operational recommendations for researchers and corporate practitioners who are interested in studying the combinatorial use of ICTs.

This paper highlights that understanding the combinatorial use ICTs in complex work environments could have significant implications for productivity and efficiency of individuals and corporations. This paper serves as a catalyst for on-going research conversations regarding combinatorial ICT use, while assisting organizational communication researchers and practitioners in describing, theorizing and advancing ICT implementation, use and outcomes.

Combinatorial procurement auctions are increasingly being employed in the private and public sector as an alternative to simultaneous single contract auctions. This mechanism has the advantage that it enables suppliers to express synergies across bundles of public contracts. This mitigates the exposure problem and also has the potential to both lower the price paid by the procuring authority and to enhance efficiency. This paper provides stylized facts of recently performed combinatorial public procurements in various markets in Sweden.

This paper is an empirical analysis of first-price sealed-bid procurement auctions in Sweden, with and without combinatorial bidding. The data comprises procurement auctions of identical contracts (road resurfacing) with identical bidders conducted under the same time period (2009-2011) in two different regions in Sweden. Given the comparison of the suppliersʼ offered price per tons of asphalt, we cannot reject the hypothesis of identical distribution of standalone bids generated in both types of auction. The distribution of package bids within the combinatorial format is significantly lower than the distribution of standalone bids within the non-combinatorial format, suggesting substantial cost reduction of allowing package bidding. Also, within the combinatorial format, our analysis of data indicates higher costs when packages are predetermined by the purchaser rather than chosen freely by the suppliers.

Over the past decade, the cost of product development has increased drastically, and this is due to the inability of most enterprises to locate suitable and optimal collaborators for knowledge sharing. Nevertheless, knowledge sharing is a mechanism that helps people find the best collaborators with relevant knowledge. Hence, a new approach for locating optimal collaborators with relevant knowledge is needed, which could help enterprise in reducing cost and time in a knowledge-sharing environment. The paper aims to discuss these issues.

One unique challenge in the domain of knowledge sharing is that collaborators do not possess the same number of events resident in the knowledge available for sharing. In this paper, the authors present a new approach for locating optimal collaborators in knowledge-sharing environment using the combinatorial algorithm (CA-KSE).

The proposed pattern-matching approach implemented in Java is considered efficient for solving the issue peculiar to collaboration in knowledge-sharing domain. The authors benchmarked the proposed approach with its semi-global pairwise alignment and global alignment counterparts through scores comparison and the receiver operating characteristic curve. The results obtained from the comparisons showed that CA-KSE is a perfect test having an area under curve of 0.9659, compared to the other approaches.

The paper has proposed an efficient algorithm, which is considered better than related methods, for matching several collaborators (more than two) in KS environment. The method could be deployed in medical field for gene analysis, software organizations for distributed development and academics for knowledge sharing.

One sign of strength of this approach, compared to most sequence alignment approaches that can only match two collaborators at a time, is that it can match several collaborators at a faster rate.

Continuous process improvement is a hard problem, especially in high variety/low volume environments due to the complex interrelationships between processes. The purpose of this paper is to address the process improvement issues by simultaneously investigating the job sequencing and buffer size optimization problems.

This paper proposes a continuous process improvement implementation framework using a modified genetic algorithm (GA) and discrete event simulation to achieve multi-objective optimization. The proposed combinatorial optimization module combines the problem of job sequencing and buffer size optimization under a generic process improvement framework, where lead time and total inventory holding cost are used as two combinatorial optimization objectives. The proposed approach uses the discrete event simulation to mimic the manufacturing environment, the constraints imposed by the real environment and the different levels of variability associated with the resources.

Compared to existing evolutionary algorithm-based methods, the proposed framework considers the interrelationship between succeeding and preceding processes and the variability induced by both job sequence and buffer size problems on each other. A computational analysis shows significant improvement by applying the proposed framework.

Significant body of work exists in the area of continuous process improvement, discrete event simulation and GAs, a little work has been found where GAs and discrete event simulation are used together to implement continuous process improvement as an iterative approach. Also, a modified GA simultaneously addresses the job sequencing and buffer size optimization problems by considering the interrelationships and the effect of variability due to both on each other.

The purpose of this paper is to improve the relief procurement process as one of the most important elements of humanitarian logistics. For doing so, a novel two-round decision model is developed to capture the dynamic nature of the relief procurement process by allowing demand updating. The model accounts for the supply priority of items at response phase as well.

A mixed procurement/supply policy is developed through a mathematical model, which includes spot market procurement and a novel procurement auction mechanism combining the concepts of multi-attribute and combinatorial reverse auctions. The model is of bi-objective mixed-integer non-linear programming type, which is solved through the weighted augmented e-constraint method. A case study is also provided to illustrate the applicability of the model.

This study demonstrates the ability of proposed approach to model post-disaster procurement which considers the dynamic environment of the relief logistics. The sensitivity analyses provide useful managerial insights for decision makers by studying the impacts of critical parameters on the solutions.

This paper proposes a novel reverse auction framework for relief procurement in the form of a multi-attribute combinatorial auction. Also, to deal with dynamic environment in the post-disaster procurement, a novel two-period programming model with demand updating is proposed. Finally, by considering the priority of relief items and model’s applicability in the setting of relief logistics, post-disaster horizon is divided into three periods and a mixed procurement strategy is developed to determine an appropriate supply policy for each period.

Malicious attacks extremely traumatize knowledge networks due to increasing interdependence among knowledge elements. Therefore, exposing the damage of malicious attacks to knowledge networks has important theoretical and practical significance. Despite the insights being offered by the growing research stream, few studies discuss the diverse responses of knowledge networks’ robustness to different target-attacks, and the authors lack sufficient knowledge of which forms of malicious attacks constitute greater disaster when knowledge networks evolve to different stages. Given the irreversible consequences of malicious attacks on knowledge networks, this paper aims to examine the impacts of different malicious attacks on the robustness of knowledge networks.

On the basic of dividing malicious attacks into six forms, the authors incorporate two important aspects of robustness of knowledge networks – structure and function – in a research framework, and use maximal connected sub-graphs and network efficiency, respectively, to measure structural and functional robustness. Furthermore, the authors conceptualize knowledge as a multi-dimensional structure to reflect the heterogeneous nature of knowledge elements, and design the fundamental rules of simulation. NetLogo is used to simulate the features of knowledge networks and their changes of robustness as they face different malicious attacks.

First, knowledge networks gradually form more associative integrated structures with evolutionary progress. Second, various properties of knowledge elements play diverse roles in mitigating damage from malicious attacks. Recalculated-degree-based attacks cause greater damage than degree-based attacks, and structure of knowledge networks has higher resilience against ability than function. Third, structural robustness is mainly affected by the potential combinatorial value of high-degree knowledge elements, and the combinatorial potential of high-out-degree knowledge elements. Forth, the number of high in-degree knowledge elements with heterogeneous contents, and the inverted U-sharp effect contributed by high out-degree knowledge elements are the main influencers of functional robustness.

The authors use the frontier method to expose the detriments of malicious attacks both to structural and functional robustness in each evolutionary stage, and the authors reveal the relationship and effects of knowledge-based connections and knowledge combinatorial opportunities that contribute to maintaining them. Furthermore, the authors identify latent critical factors that may improve the structural and functional robustness of knowledge networks.

First, from the dynamic evolutionary perspective, the authors systematically examine structural and functional robustness to reveal the roles of the properties of knowledge element, and knowledge associations to maintain the robustness of knowledge networks. Second, the authors compare the damage of six forms of malicious attacks to identify the reasons for increased robustness vulnerability. Third, the authors construct the stock, power, expertise knowledge structure to overcome the difficulty of knowledge conceptualization. The results respond to multiple calls from different studies and extend the literature in multiple research domains.

Supplier selection is a complex and strategic activity needed in every organization, involving many stakeholders and different attributes as price, delivery performance, and product quality. Globalization, in the last decades, increased the competitiveness between vendors, enhancing the use of decision models to support the best choice based on optimizations and bidding variations due to specific needs. This chapter presents three models of multi-dimensional auctions to improve an international humanitarian NGO process procurement efficiency by reducing procurement costs and the decision-making process time. These models have the advantage to be easily implementable in typically complex environments where there is a large number of categories, suppliers, and other features.

The first proposed model uses combinatorial auctions and is suited for procurement, where suppliers can benefit from cost complementarity. The second one uses volume discount auctions and is suited for volumetric purchases, where discounts for large quantities are common. The third one is a multi-attribute model, which computes the best possible solution considering several criteria and can be used in case of complex purchases that involve various categories and trade-offs and are subject to spot prices.

Several design considerations for this type of auctions are reviewed, as well as the mathematical formulation to determine the best alternative (i.e., winner) that can be solved using simple tools like Microsoft Excel. The models are optimized by a mixed-integer programming, and the multi-attribute one is developed using multi-criteria decision analysis (MCDA). All three models developed in this research showed superior results compared to the baseline, being between 9% and 20% more efficient than a regular supplier selection (singly choosing the lowest price) and improving the bidding compliance.

A theory of knowledge shows that all four systems of nature are recursive combinatorial‐hamiltonian self‐programmed flow‐wave systems that can be deduced from the usual Conservation Law promoted to the Axiom of Science.

Disassembly takes place in remanufacturing, recycling, and disposal, with a line being the best choice for automation. The disassembly line balancing problem seeks a sequence that is feasible, minimizes the number of workstations, and ensures similar idle times, as well as other end-of-life specific concerns. Finding the optimal balance is computationally intensive due to exponential growth. Combinatorial optimization methods hold promise for providing solutions to the problem, which is proven here to be NP-hard. Stochastic (genetic algorithm) and deterministic (greedy/hill-climbing hybrid heuristic) methods are presented and compared. Numerical results are obtained using a recent electronic product case study.