Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approaches are problem-specific and research into the development of a general scheduling algorithm is still in its infancy....

Technology adoption theories assume that users' acceptance of an innovative technology is on a voluntary basis. However, sometimes users are force to accept an innovation. In this case users have to learn what it is useful for and how to use it. This learning process will enable users to transit...

How do technology users effectively transit from having zero knowledge about a technology to making the best use of it after an authoritative technology adoption? This post-adoption user learning has received little research attention in technology management literature. In this paper we...