This paper proposes a production scheduling procedure for the production lines of a printed circuit board company. Linearity features of the manufacturing process of this company are characterized and exploited for developing an efficient three-phase scheduling procedure. The production line is formulated as a linear job shop that resembles a flow shop. First, the N-gram modelling approach is adopted to analyse the data sets to detect the machines that would be candidates of the bottleneck in the production lines. Second, according to the candidates, the bottleneck data are extracted from the original data sets and solved as flow shops by a mixed integer programming model. The optimal solutions of the bottleneck flow shop is next extended by incorporating upstream and down stream operations to form approximate solutions of the original problems. We propose three different strategies for forming the approximate solutions and the best one is designated as the final solution. The performance of the proposed heuristic algorithm is tested and compared with the well-known NEH algorithm through numerical instances from real production lines. Statistics indicate that for most instances including up to 80 jobs the proposed method delivers competitive solutions within a much shorter time than the NEH algorithm.

本文提出了印刷电路板公司生产线的生产调度程序。该公司制造过程的线性特征经过特征化和开发，可用于开发有效的三相调度程序。生产线被公式化为类似于流水车间的线性车间。一，N采用gram-gram建模方法分析数据集，以检测可能成为生产线瓶颈的机器。其次，根据候选者，从原始数据集中提取瓶颈数据，并通过混合整数规划模型解决流水车间问题。接下来，通过合并上游和下游操作来扩展瓶颈流水车间的最佳解决方案，以形成原始问题的近似解决方案。我们提出三种不同的策略来形成近似解决方案，而最好的一种被指定为最终解决方案。通过实际生产线上的数值实例，对提出的启发式算法的性能进行了测试，并与著名的NEH算法进行了比较。