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

Table 3

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

Jobs	𝑀1	𝑀2
	𝐴𝑖,1	𝐴𝑖,2
1	0–4	4–9
2	4–6	9–13
3	6–9	13–22
4	9–18	33–41
5	18–24	41–49