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

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