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

Table 6

In-out table.

Jobs	𝑀1	𝑀2	𝑀3	𝑀4
	𝐴𝑖,1	𝐴𝑖,2	𝐴𝑖,3	𝐴𝑖,4
1	0–4	15–20	29–31	31–43
2	4–6	20–24	31–35	43–51
3	6–9	24–33	35–41	51–54
4	9–18	33–41	41–49	54–56
5	18–24	41–49	49-50	56–58