An Optimization Model for Assembly Line Balancing Problem with Uncertain Cycle Time

Algorithm 1

Pseudocode of topological sorting.

	Procedure: Topological Sorting
	Input: Precedence graph; Let be the number of vertices; Let be the TO of the precedence graph.
	Output: A nonempty TO ().
	For to do
	Begin
	If every vertex has a predecessor
	Then the precedence graph is infeasible stop;
	Else pick a vertex which has no predecessors;
	;
	Delete and all edges leading out of from precedence graph
	End
	End