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.

Standardization as Institutional Work: The Regulatory Power of a Responsible Investment Standard

Abstract: This paper conceptualizes standardization as institutional work to study the emergence of a standard and the deployment of its regulatory power. We rely on unique access to longitudinal archival data for exploring how the FTSE4Good index, a responsible investment index, emerged as a standard for socially responsible corporate behavior. Our results show how three types of standardization work – calculative framing, engaging and valorizing – support the design, legitimation and monitoring processes whereby a standard acquires its regulatory power. Our findings reveal new facets in the dynamics of standardization by approaching standardization as a product of institutional work and in showing how unintended consequences of that work can be recaptured to strengthen the regulatory power of the standard.

A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal

Abstract: The quay crane scheduling problem consists of determining a sequence of unloading and loading movements for cranes assigned to a vessel in order to minimize the vessel completion time as well as the crane idle times. Idle times originate from interferences between cranes since these roll on the same rails and a minimum safety distance must be maintained between them. The productivity of container terminals is often measured in terms of the time necessary to load and unload vessels by quay cranes, which are the most important and expensive equipment used in ports. We formulate the quay crane scheduling problem as a vehicle routing problem with side constraints, including precedence relationships between vertices. For small size instances our formulation can be solved by CPLEX. For larger ones we have developed a branch-and-cut algorithm incorporating several families of valid inequalities, which exploit the precedence constraints between vertices. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006