Understanding the theory behind the Last Planner System using the Language-Action Perspective: two case studies

Since the Last Planner System® (LPS) was devised in the early 90s, a number of studies have pointed out the need to understand the underlying theory in which it is based on. The Language-Action Perspective (LAP) has been suggested as a suitable approach to understand the management of commitments in the LPS. This paper aims to assess the contribution of LAP to understand construction planning and control systems based on LPS. Two case studies were carried out in different construction companies, both highly experienced on the use of LPS. The results reveal the role of LAP for creating explicit representations of commitment flows that can be used to explain the sources of complexity and failures in planning systems, as well as for describing the profile of planning and control meetings.     

The Alliance Experience Transfer Effect: The Case of Industry Convergence in the Telecommunications Equipment Industry

A central premise of the industry change literature is that firms change their strategic actions when an industry changes. Industry convergence (IC), the blending of boundaries between industries creating competition among firms that previously did not compete, is increasingly impacting many industries and is a salient case of industry change. Acquisitions are an important action shaping the course of IC because they trigger imitation and bandwagon effects further accelerating IC. This paper focuses on why and when learning from alliances reduces uncertainty resulting in acquisitions during IC: an ‘alliance experience transfer effect’. We demonstrate the utility of this mechanism for the substitution‐based form of IC that occurred between the telecommunications equipment and computer networking industries. Our key insight is that when the extent of IC is low there are significant transfer effects but, as the extent of IC increases, firms have access to an expanding volume and diversity of information sources that reduce uncertainty, thus weakening the transfer effect mechanism. We contribute to the alliance–acquisition relationship and learning literatures by demonstrating that the alliance experience transfer effect mechanism explains changes in firm strategic action (alliancing and acquiring) as the extent of IC changes. We also introduce a semi‐convergence perspective by directly measuring the extent of IC.     

Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement

In several areas like global optimization using branch-and-bound methods for mixture design, the unit n-simplex is refined by longest edge bisection (LEB). This process provides a binary search tree. For \(n>2\), simplices appearing during the refinement process can have more than one longest edge (LE). The size of the resulting binary tree depends on the specific sequence of bisected longest edges. The questions are how to calculate the size of one of the smallest binary trees generated by LEB and how to find the corresponding sequence of LEs to bisect, which can be represented by a set of LE indices. Algorithms answering these questions are presented here. We focus on sets of LE indices that are repeated at a level of the binary tree. A set of LEs was presented in Aparicio et al. (Informatica 26(1):17–32, 2015), for \(n=3\). An additional question is whether this set is the best one under the so-called \(m_k\)-valid condition.     

Minimizing the number of tardy jobs in two-machine settings with common due date

We consider two-machine scheduling problems with job selection. We analyze first the two-machine open shop problem and provide a best possible linear time algorithm. Then, a best possible linear time algorithm is derived for the job selection problem on two unrelated parallel machines. We also show that an exact approach can be derived for both problems with complexity \(O(p(n) \times \sqrt{2}^n)\), p being a polynomial function of n.     

Flood Catastrophe Model for Designing Optimal Flood Insurance Program: Estimating Location‐Specific Premiums in the Netherlands

As flood risks grow worldwide, a well‐designed insurance program engaging various stakeholders becomes a vital instrument in flood risk management. The main challenge concerns the applicability of standard approaches for calculating insurance premiums of rare catastrophic losses. This article focuses on the design of a flood‐loss‐sharing program involving private insurance based on location‐specific exposures. The analysis is guided by a developed integrated catastrophe risk management (ICRM) model consisting of a GIS‐based flood model and a stochastic optimization procedure with respect to location‐specific risk exposures. To achieve the stability and robustness of the program towards floods with various recurrences, the ICRM uses stochastic optimization procedure, which relies on quantile‐related risk functions of a systemic insolvency involving overpayments and underpayments of the stakeholders. Two alternative ways of calculating insurance premiums are compared: the robust derived with the ICRM and the traditional average annual loss approach. The applicability of the proposed model is illustrated in a case study of a Rotterdam area outside the main flood protection system in the Netherlands. Our numerical experiments demonstrate essential advantages of the robust premiums, namely, that they: (1) guarantee the program's solvency under all relevant flood scenarios rather than one average event; (2) establish a tradeoff between the security of the program and the welfare of locations; and (3) decrease the need for other risk transfer and risk reduction measures.     

Two Variations of the Minimum Steiner Problem

Given a set S of starting vertices and a set T of terminating vertices in a graph G = (V,E) with non-negative weights on edges, the minimum Steiner network problem is to find a subgraph of G with the minimum total edge weight. In such a subgraph, we require that for each vertex s S and t T, there is a path from s to a terminating vertex as well as a path from a starting vertex to t. This problem can easily be proven NP-hard. For solving the minimum Steiner network problem, we first present an algorithm that runs in time and space that both are polynomial in n with constant degrees, but exponential in |S|+|T|, where n is the number of vertices in G. Then we present an algorithm that uses space that is quadratic in n and runs in time that is polynomial in n with a degree O(max {max {|S|,|T|}–2,min {|S|,|T|}–1}). In spite of this degree, we prove that the number of Steiner vertices in our solution can be as large as |S|+|T|–2. Our algorithm can enumerate all possible optimal solutions. The input graph G can either be undirected or directed acyclic. We also give a linear time algorithm for the special case when min {|S|,|T|} = 1 and max {|S|,|T|} = 2.The minimum union paths problem is similar to the minimum Steiner network problem except that we are given a set H of hitting vertices in G in addition to the sets of starting and terminating vertices. We want to find a subgraph of G with the minimum total edge weight such that the conditions required by the minimum Steiner network problem are satisfied as well as the condition that every hitting vertex is on a path from a starting vertex to a terminating vertex. Furthermore, G must be directed acyclic. For solving the minimum union paths problem, we also present algorithms that have a time and space tradeoff similar to algorithms for the minimum Steiner network problem. We also give a linear time algorithm for the special case when |S| = 1, |T| = 1 and |H| = 2.An extended abstract of part of this paper appears in Hsu et al. (1996).Supported in part by the National Science Foundation under Grants CCR-9309743 and INT-9207212, and by the Office of Naval Research under Grant No. N00014-93-1-0272.Supported in part by the National Science Council, Taiwan, ROC, under Grant No. NSC-83-0408-E-001-021.     

TRADE QUOTAS AND BUYER POWER,WITH AN APPLICATION TO THE E.U. NATURAL GAS MARKET

We consider a market in which domestic buyers negotiate contracts with foreign sellers, and explore how trade quotas can help to increase the buyers' countervailing power. We use the Shapley value to describe bargaining power and the distribution of the trade surplus in such a bilateral oligopoly. By exploiting strategic externalities among the buyers, bilateral trade quotas can improve the buyers' bargaining positions. In contrast, aggregate trade restrictions on all buyers' trade never improve buyer surplus. Minimum quotas on imports from fringe suppliers can benefit nonaffected buyers, as these enjoy positive externalities. We apply these insights to the E.U. market for natural gas and show that the effects of trade quotas on E.U. gas importers' power can be significant.     

Beyond Technical Competence: The Loyalty Factor

This study discusses an attribute of leadership that is beyond technicalcompetence. Defines `Loyalty' as an unwavering commitment to colleagues,organizations, and to oneself. Clarifies the development of a loyalty and theformation of operational principles are synergetic for ethical behavior.Explains `Loyalty' and the manner in which it differs from unethical, illegal,or immoral behavior. Depicts `loyalty' as an essential behavior that promotesand supports quality leadership. Provides guidance, techniques, and examplesthat can be used to enhance leadership skills. Establishes a sound philosophyto increase the probability for long-term success and professionalfulfillment. Includes quotes from contemporary as well as historical leaders.     

Risk analysis of PCB exposure via the soil-food crop pathway, and alternatives for remediation at Serpukhov, Russian Federation.

A risk assessment was conducted to determine the likelihood of certain health risks resulting from exposure to soils and food crops contaminated with polychlorinated biphenyl (PCBs). PCBs have contaminated soils, river sediments, and air in the past as a result of industrial activities at a capacitor plant located in the City of Serpukhov, Russian Federation. This risk assessment and suggestions for remediation are designed to aid in decision-making efforts by a joint Russian-American research team developing a community, national, and international response to industrial contamination. Bobovnikova et al. (The Science of the Total Environment 139/140, 357-364, [1993]) have reported that PCBs are elevated in soils and sediments, breast milk, and locally grown foods in the Serpukhov area. Data from these and other investigators have been used in this risk assessment to calculate a potential cancer risk resulting from exposure to PCBs. Our assessment indicates that members of the local population may be at increased risk of cancer, and possibly other adverse health effects, as a result of PCB contamination of their environment. Because previously unassessed environmental contamination is a common problem in the former Soviet Republics, as well as many other areas of the world, we believe this type of evaluation, using known methods, can serve as a model for assessment efforts in other parts of the globe and result in remediative efforts in regions constrained by faltering economies.     

TWO‐ AND THREE‐STAGE FLOWSHOP SCHEDULING WITH NO‐WAIT IN PROCESS

In this paper we study the time complexities of some two‐ and three‐stage no‐wait flowshop makespan scheduling problems where, in some stage, all the jobs require a constant processing time and the stage may consist of parallel identical machines. Polynomial time algorithms are presented for certain problems, while several others are proved to be strongly NP‐complete.