On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
基于Wagner的全整数模型，开发了混合整数线性规划模型，可最优求解多达25个工件、10台机器的流水车间排序问题，并讨论了多种性能指标变体及175个问题的计算经验。
This paper describes the development of a mixed-integer linear programming (MILP) model for the standard N-job, M-machine flowshop sequencing problem. Based on an earlier all-integer model developed by Wagner, this MILP model has been used to solve optimally problems with as many as 25 jobs and as many as 10 machines. Variants of the standard flowshop model, including a variety of performance measures, are also presented. Computational experience involving the successful solution of over 175 flowshop problems is discussed, and suggestions for future research projects are offered.