We are given M machines, J jobs, processing time for each job on each machine and a time limit T.
We have to decide if it is possible to sequence the jobs on the machines according to the following constraints:
- Each job has to processed on every machine in the shop.
- The sequence of jobs on every machine must be the same.
- Different machines can work parallely but each machine can only process one job at a time.
- We have to decide if it is possible to sequence the jobs such that they don't take more than T time units in total for completion.
- The workflow is the following: the first job of the sequence goes to the first machine to be processed; meanwhile, other jobs wait; when the first machine has processed the first job, the first job goes to the second machine and the second job of the sequence starts to be processed by the first machine; and so on. 
- If a job has been processed by a machine but the next machine is still busy, it waits until the next machine is empty, but it leaves its last machine empty.