
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 \textit{H. M. Wagner} [Nav. Res. Logist. Q. 6, 131-140 (1959)], 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 suggestion for future research projects are offered.
Numerical mathematical programming methods, N-job, M-machine flowshop sequencing, Deterministic scheduling theory in operations research, Mixed integer programming, mixed-integer linear programming, performance measures
Numerical mathematical programming methods, N-job, M-machine flowshop sequencing, Deterministic scheduling theory in operations research, Mixed integer programming, mixed-integer linear programming, performance measures
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 71 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
