We study the recently identified class of generalized due date scheduling problems. These are machine scheduling problems for which due dates are specified according to the position in which a job is completed, rather than the identity of that job. Flexible manufacturing environments and public...

We study the problem of minimizing makespan in a two-machine job shop with unit processing time operations. An efficient algorithm with respect to a succinct encoding of the problem instances is proposed. The algorithm is an improvement of earlier algorithms proposed for the problem by Brucker [...

The mean flow time problem and the mean absolute deviation problem for multiple uniform parallel machines are shown to be equivalent. For multiple unrelated parallel machines, a reduction of the mean absolute deviation problem into a transportation problem is presented

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

This paper considers an infinite horizon stochastic production planning problem with demand assumed to be a continuous-time Markov chain. The problems with control (production) and state (inventory) constraints are treated. It is shown that a unique optimal feedback solution exists, after first...

This paper presents an asymptotic analysis of hierarchical marketing-production systems with stochastic demand and stochastic production capacity modelled as finite state Markov processes. The decision variables used are advertising and production rates which influence capacity, demand, and...

This paper presents an asymptotic analysis of a hierarchical manufacturing system with machines subject to breakdown and repair. The rate of change in machine states is much larger than the rate of fluctuation in demand and the rate of discounting of costs, and this gives rise to a limiting...

We consider the scheduling problem of cyclic production in a bufferless dual-gripper robot cell processing a family of identical parts. The objective is to find an optimal sequence of robot moves so as to maximize the long-run average throughput rate of the cell. While there has been a...

This paper considers optimal infinite horizon stochastic production planning problems with capacity and demand to be finite state Markov chains. The existence of the optimal feedback control is shown with the aid of viscosity solutions to the dynamic programming equations. Turnpike set concepts...

Focuses on a study which developed a framework for forecast and decision horizons. Definition of finite and infinite horizon stochastic optimization problems for a given forecast; Description of the general framework; Conditions for the existence of a solution horizon; Development of sufficient...