APPLYING A MODIFIED COEFFICIENT REDUCTION METHOD TO A DYNAMIC PRODUCTION SCHEDULING MODEL

doi:10.1016/0377-2217(92)90297-M

APPLYING A MODIFIED COEFFICIENT REDUCTION METHOD TO A DYNAMIC PRODUCTION SCHEDULING MODEL

1992-01-01

4

OA

AI

M

Monique Guignard *

M

Matthew J. Liberatore

DOI：10.1016/0377-2217(92)90297-M

原文链接

查看原文

摘要

En 中文

This paper develops and tests a short-run production scheduling model for process industry application. We consider a multi-product, multi-period environment, where a subset of the products can be produced on each of the production lines at a fixed rate per period. The resulting 0-1 mixed integer programming problem is difficult to solve using commercial optimization software. A preprocessing method based on coefficient reduction was modified to exploit the problem structure. This preprocessing tightens the problem prior to solution by a commercial branch-and-bound code. The remaining duality gap is defined as the percentage difference between the best feasible value and the tightest bound found, i.e. it is the maximum improvement in objective function value that can still be expected. Gaps of less than 4% were found in all test problems when production losses were zero. With the inclusion of production losses, preprocessing led to about a 50% reduction in the remaining gaps. Additional computational studies found that this approach can process constraints having up to 80-110 variables. Further research is suggested to investigate the computational effectiveness of other solution approaches.

Keyword:

INTEGER PROGRAMMING

PRODUCTION SCHEDULING

COEFFICIENT REDUCTION

PREPROCESSING

APPLYING A MODIFIED COEFFICIENT REDUCTION METHOD TO A DYNAMIC PRODUCTION SCHEDULING MODEL

摘要

AI总结

期刊

机构

引用论文