The proportionate two-machine no-wait job shop scheduling problem.

•We consider the two-machine no-wait proportionate job shop scheduling problem.•We present an O(nlog n) algorithm for the problem without missing operations.•We show that the problem with missing operations is strongly NP-hard.•The O(nlog n) algorithm applies when all missing operations are on the same machine.