Scheduling a two-machine robotic cell: A solvable case

The paper deals with the scheduling of a robotic cell in which jobs are processed on two tandem machines. The job transportation between the machines is done by a transportation robot. The robotic cell has limitations on the intermediate space between the machines for storing the work-in-process. What complicates the scheduling problem is that the loading/unloading operation times are non-negligible. Given the total number of operations n, an optimal O(nlogn)-time algorithm is proposed together with the proof of optimality.