This problem is an extension of the job-shop problem where n jobs have to be performed using m machines. Each job consists of m successive activities such that each machine is required exactly once by the job. A maintenance operation must take place before each task and between each set of tasks. All maintenance operations have a duration and an energy that depend upon two successive operations. The maintenance duration is the transition time between two operations. The maintenance energy is the transition cost between two operations. The objective is to minimize the total transition cost.

Machines are unary resources.