A Heuristic Approach to 𝑛×𝑚 Flow Shop Scheduling Problem in Which Processing Times Are Associated with Their Respective Probabilities with No-Idle Constraint

Table 4

The in-out table for machines 𝑀₂ and 𝑀₃.

Jobs; 𝑖	𝑀2	𝑀3
	𝐴𝑖,2	𝐴𝑖,3
1	0–5	5–7
2	5–9	9–13
3	9–18	18–24
4	18–26	26–34
5	26–34	34-35