A quadratic model for production-inventory planning was made famous by Holt, Modigliani, Muth, and Simon in 1960 in [3], especially for its application to a paint factory. A discrete control version of a related quadratic production-inventory model was studied by Kleindorfer, Kriebel, Thompson,...

A single-machine multiproduct manufacturing system with random breakdowns and random repair times is considered. Under a weak capacity condition on the system it is shown that the total work-in-progress (WIP) is a recurrent stochastic process. By replacing the stochastic model by a deterministic...

In this paper, we consider a production planning problem in a two-machine flowshop subject to breakdown and repair of machines and subject to non-negativity constraints on work-in-process. The machine capacities and demand processes are assumed to be finite state Markov chains. The problem is to...

This paper considers an infinite horizon stochastic production planning problem with the constraint that production rate must be nonnegative. It is shown that an optimal feedback solution exists for the problem. Moreover, this solution is characterized and is then compared with the solution of...

This paper is concernced with hierarchical decisions regarding production and investment in capacity in manufacturing systems with production subject to breakdown and repair. The production capacity can be increased by investing continuously in new capacity which is available upon completion....

This paper establishes a link between the concepts of optimality used in economic theory for infinite horizon planning models, and the concepts of decision and forecast horizons used in several areas of Management Science. It is shown that decision and forecast horizons induce an alternate...

This note formulates an assignment problem for obtaining optimal level schedules for mixed-model assembly lines in JIT production systems. The problem was formulated as a quadratic integer programming problem in a recent paper by Miltenburg (1989) where, however, only enumerative algorithms and...

A heuristic procedure is developed for minimizing makespan in flow-shop scheduling problems. In comparison with current algorithms, our algorithm seems to result in an improved makespan with a small additional computational effort. An algorithm is also developed to minimize the required number...

A companion paper (Part I) considers the problem of minimizing the weighted earliness and tardiness of jobs scheduled on a single machine around a common due date, d, which is unrestrictively late. This paper (Part II) considers the problem of minimizing the unweighted earliness and tardiness of...

The ultimate purpose of our analysis is to show that for any class of linear combinatorial problems assumed to be NP-hard, the class of their strictly nonlinear counterparts is also NP-hard. In this paper, we set the framework, and prove the result for a class of linear integer programming...