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

Table 5

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

Jobs	𝑀3	𝑀4
	𝐴𝑖,3	𝐴𝑖,4
1	0–2	2–14
2	2–6	14–22
3	6–12	22–25
4	12–20	25–27
5	20-21	27–29