HEC Montréal

About: HEC Montréal is a education organization based out in Montreal, Quebec, Canada. It is known for research contribution in the topics: Vehicle routing problem & Corporate governance. The organization has 1221 authors who have published 5708 publications receiving 196862 citations. The organization is also known as: Ecole des Hautes Etudes Commerciales de Montreal & HEC Montreal.

Strategic Responses to Institutional Complexity

Abstract: A central and distinctive feature of the mission of Strategic Organization is to publish groundbreaking research at the intersection of the fields of strategic management and organization theory. It is therefore fitting that this, the journal’s first thematic special issue on the topic “Strategic responses to institutional complexity” reflects in microcosm the potential for convergence and mutual enrichment such an orientation implies (Durand, 2012; Oliver, 1991, 1997; Suddaby, Seidl, & Lê, 2013). Specifically, the special issue draws on recent insights in institutional theory that organizations are often confronted with incompatible prescriptions from constituents holding multiple institutional logics. The “institutional complexity” (Greenwood, Raynard, Kodeih, Micelotta, & Lounsbury, 2011) that emerges from a multiplicity of conflicting demands generates ambivalence in interpreting these demands. The idea that organizations face multiple institutional prescriptions is not new (see for example, D'Aunno, Sutton, & Price, 1991), but there has been a recent resurgence of interest in how organizations respond strategically to these demands (e.g., Pache & Santos, 2013; Raaijmakers, Vermeulen, Meeus, & Zietsma, 2015; Tracey, Phillips, & Jarvis, 2011). Our initial hope for this special issue was to advance our understanding of how organizations experience and respond to institutional complexity.

A tabu search heuristic for ship routing and scheduling

Abstract: The purpose of this paper is to solve a planning problem faced by many shipping companies dealing with the transport of bulk products. These shipping companies are committed to carrying some contract cargoes and will try to derive additional revenue from optional spot cargoes. An efficient tabu search algorithm has been developed to ensure quick decision support for the planners. The solutions generated by the tabu search heuristic are compared with those produced by a previously published multi-start local search heuristic. Computational results show that the tabu search heuristic yields optimal or near-optimal solutions to real-life instances within reasonable time. For large and tigthly constrained cases, the tabu search heuristic provides much better solutions than the multi-start local search heuristic. A version of the tabu search heuristic will be integrated as an improved solver in a prototype decision support system used by several shipping companies.

The impacts of leadership on workplace conflicts

Abstract: Purpose – The purpose of this paper is to evaluate the influence of managers' leadership styles (transformational, transactional and laissez‐faire) on both the level and the nature of workplace conflicts (cognitive and relational in nature).Design/methodology/approach – Data are collected from hospital employees in Canada. A total of 1,031 completed questionnaires are received, representing a response rate of 46 percent. The hypothesis is tested using confirmatory factor analyses and multiple regressions.Findings – The results indicate that the two conflict dimensions do not derive completely from the same mechanisms, since only two out of the eight leadership dimensions evaluated influence both cognitive and relational conflicts. On the one hand, inspirational motivation has a negative impact on cognitive conflicts while intellectual stimulation and passive management by exception seem to foster it. On the other hand, inspirational motivation and individualized consideration negatively influence relation...

Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling

Abstract: In many branch-and-price algorithms, the column generation pricing problem consists of computing feasible paths in a network. In this paper, we show how, in this context, path-reduced costs can be used to remove some arcs from the underlying network without compromising optimality, and we introduce a bidirectional search technique to compute these reduced costs. This arc elimination method can lead to a substantial speedup of the pricing process and the overall branch-and-price algorithm. Special attention is given to variants of shortest-path problems with resource constraints. Computational results obtained for the vehicle routing problem with time windows show the efficiency of the proposed method.