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

Table 1

The machines with processing time and corresponding probabilities.

Jobs; 𝑖	𝑀1		𝑀2		𝑀3		𝑀4
	𝑎𝑖,1	𝑝𝑖,1	𝑎𝑖,2	𝑝𝑖,2	𝑎𝑖,3	𝑝𝑖,3	𝑎𝑖,4	𝑝𝑖,4
1	20	0.2	50	0.1	10	0.2	30	0.4
2	10	0.2	40	0.1	20	0.2	80	0.1
3	30	0.1	30	0.3	30	0.2	10	0.3
4	30	0.3	20	0.4	40	0.2	20	0.1
5	30	0.2	80	0.1	5	0.2	20	0.1