The invention provides a
production line scheduling method based on a constructive
heuristic algorithm. The method comprises the following steps: S1, setting p(i, j) as the
execution time of a jth workpiece on an ith
machine if n workpieces are processed on m machines, and constructing a matrix P, wherein i is a natural number from 1 to m, and j is a natural number from 1 to n; S2, randomly selecting two columns of elements in the matrix P, namely the
execution time Pa and Pb of workpieces (a, b) on the m machines, wherein a is less than or equal to 1, b is less than or equal to n, and a is not equal to b; S3, determining the
processing sequence of the workpieces (a, b); and S4, determining whether n columns of elements in the matrix P are compared pairwise, stopping determination if the n columns of elements are compared, adjusting the workpieces according to the determined
processing sequence, and sequentially
processing the workpieces on the m machines, otherwise, returning to the step S2. The
production line scheduling method provided by the invention can be used for scheduling the
production line of a flow shop to achieve the shortest total
completion time, and reducing the
waiting time of each workpiece before processing by adjusting the workpiece processing sequence. Compared with the prior art, the method provided by the invention has the advantages of low
computation complexity, short computation time and better scheduling performance.