In this paper we consider a scheduling problem for a two-machine robotic cell of jobshop type. The problem is an extension of the classical two-machine jobshop scheduling addressed by Jackson 6), but is NP-hard. We propose a greedy heuristic algorithm and test for its performance with numerical experiments.
