We consider the problem of scheduling n jobs in a pallet-constrained two-machine flowshop so as to minimize the makespan. In such a flowshop environment, each job needs a pallet the entire time, from the start of its first operation until the completion of the last operation, and the number of...

We consider a production planning problem for a general jobshop subject to breakdown and repair of machines and subject to lower and upper bound constraints on work-in-process. The machine capacities and demand processes are assumed to be finite state Markov chains. The problem is to choose the...

This paper studies multiproduct inventory models with stochastic demands and a warehousing constraint. Finite horizon as well as stationary and nonstationary discounted-cost infinite-horizon problems are addressed. Existence of optimal feedback policies is established under fairly general...

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 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...

A single machine processing different types of parts is considered. Switching from one type to another involves a setup time. The part types may have different processing times. The resulting scheduling problem is treated as a dynamical system for which several feedback policies that are...