We study the problem of using information about the type of machine failures to control production. When each station in a two stage flowline has a single machine, the processing time distributions are Erlang, and the time to fail as well repair a machine are exponentially distributed; we show...

We study the problem of using information about the type of machine failures to control production. When each station in a two stage flowline has a single machine, the processing time distributions are Erlang, and the time to fail as well repair a machine are exponentially distributed; we show...

Machine sequencing formulations typically assume that the characteristics of the job set to be processed are given. However, in many applications, jobs can be batched in different ways. Two types of minimum flow-time sequencing problems with lot sizing are formulated. The "item-flow" formulation...

We examine the problem of scheduling a given set of jobs on a single machine to minimize total early and tardy costs. Two dispatch priority rules are proposed and tested for this NP-complete problem. These were found to perform far better than known heuristics that ignored early costs. For...

Planning the allocation of scarce resources to competing activities over multiple time periods is one of the most important problems facing decision makers in modern organizations. Much of the previous research in this area has concentrated on the use of linear programming procedures and has...

This paper gives optimality conditions to obtain a priori precedence relationships among some of the jobs in a single machine scheduling problem so as to curtail the enumeration while using branch-and-bound technique. The objective is to minimize a quadratic (or generalized quadratic) penalty...