Job-shop scheduling is an important but difficult problem arising in low-volume high-variety manufacturing. It is usually solved at the beginning of each shift with strict computational time ...

The framework developed for this approach uses a mixed-integer linear programming formulation, balancing imprecision from linearization with benefits of global optima and rapid resolution time when ...

This paper is devoted to a study of a discrete time infinite horizon optimal control problem with time discounting criterion. We introduce an infinite-dimensional linear programming (IDLP) problem ...

The linear programming formulation with random variation in the coefficient matrix is considered. A new model is proposed in which the random variation in the constraints is removed and terms ...

We develop a linear programming formulation to address this global inference problem and evaluate it in the context of simultaneously learning named entities and relations.

F. Polimeno, T. Rehman, H. Neal, C. M. Yates, Integrating the use of Linear and Dynamic Programming Methods for Diary Cow Diet Formulation, The Journal of the ...