Sloan Working Papers
http://hdl.handle.net/1721.1/1792
2018-09-07T11:20:34ZThe Dynamics of Competition and of the Diffusion of Innovations
http://hdl.handle.net/1721.1/117544
The Dynamics of Competition and of the Diffusion of Innovations
Utterback, James M.; Pistorius, Calie; Yilmaz, Erdem
The purpose of this paper is to briefly review our understanding of the emergence and diffusion of innovation and to provide a new and more nuanced model of diffusion. The point of departure is to abandon the idea that innovation results only in pure competition, or a zero-sum game, between new and established practices. Given evidence from many cases, the authors believe it more likely that at least at the beginning of races between
new and older products, processes and services, growth of one will often stimulate growth of the others. We will term this symbiotic competition. Later the interacting technologies may fall into a cyclic state termed predator-prey competition, and finally a zero-sum game of pure competition may ensue.
A main contribution is formulation is a general solution for multi-technology, multi-mode competition. The equations derived can be used to model the interaction of any finite number of technologies where the interaction among any pair can either be pure competition, predator-prey or symbiosis. The model allows determination of the mode and strength of the interactions of competing technologies as they evolve.
2018-08-27T00:00:00ZPull for Knowledge Work
http://hdl.handle.net/1721.1/115364
Pull for Knowledge Work
Dogde, Sheila; De Smet, Timothy; Meldrim, James; Lennon, Niall; Perrin, Danielle; Ferriera, Steve; Leber, Zachary; Friedrich, Dennis; Gabriel, Stacey; Lander, Eric S.; Kieffer, Don; Repenning, Nelson
2018-05-14T00:00:00ZAgile for Everyone Else: Using Triggers and Checks to Create Agility Outside of Software Development
http://hdl.handle.net/1721.1/110325
Agile for Everyone Else: Using Triggers and Checks to Create Agility Outside of Software Development
Repenning, James; Kieffer, Donald; Repenning, Nelson
2017-06-27T00:00:00ZA new 0-1 formulation of the restricted container relocation problem based on a binary encoding of congurations
http://hdl.handle.net/1721.1/109978
A new 0-1 formulation of the restricted container relocation problem based on a binary encoding of congurations
Galle, Virgile; Barnhart, Cynthia; Jaillet, Patrick
The Container Relocation Problem (CRP), also called Block Relocation Problem (BRP), is concerned with finding a sequence of moves of containers that minimizes the number of relocations needed to retrieve all containers, while respecting a given order of retrieval. The restricted CRP enforces that only containers blocking the target container can be relocated. We improve upon and enhance an existing binary encoding and using it, formulate the restricted CRP as a binary integer programming problem in which we exploit structural properties of the optimal solution. This integer programming formulation reduces significantly the number of variables and constraints compared to existing formulations. Its efficiency is shown through computational results on small and medium sized instances taken from the literature.
Submitted to EJOR June 2017
2017-06-16T00:00:00Z