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

Table 2

Expected processing times.

Jobs; 𝑖	𝑀1	𝑀2	𝑀3	𝑀4
	𝐴𝑖,1	𝐴𝑖,2	𝐴𝑖,3	𝐴𝑖,4
1	4	5	2	12
2	2	4	4	8
3	3	9	6	3
4	9	8	8	2
5	6	8	1	2