Virtually all algorithmic studies on the single machine total tardiness problem use Emmons' theorems that establish precedence relations between job pairs. In this paper, we investigate these theorems with a geometric ...

Artificial neural networks (ANNs) have been successfully applied to solve a variety of problems. This paper proposes a new neural network approach to solve the single machine mean tardiness scheduling problem and the minimum ...

In this paper, we study the reactive scheduling problems in a dynamic and stochastic manufacturing environment. Specifically, we develop a simulationbased scheduling system for flexible manufacturing systems. We also propose ...

In the scheduling literature, estimation of job owtimes has been an important issue since the late 1960s. The previous studies focus on the problem in the context of due date assignment and develop methods using aggregate ...

In this paper, we study the reactive scheduling problems in a stochastic manufacturing environment. Specifically, we test the several scheduling policies under machine breakdowns in a classical job shop system. In addition, ...

In real manufacturing environments, variations in production factors (i.e. pro- cessing time, demand, due-dates) are inevitable facts. All these dynamic changes, together with random disturbances (e.g. machine breakdowns) ...

Artificial neural networks ( ANNs) attempt to emulate the massively parallel and distributed processing of the human brain. They are being examined for a variety of problems that have been di cult to solve with current ...

This paper studies the scheduling/rescheduling problem in a multi-resource FMS environment. Several reactive scheduling policies are proposed to address the effects of machine breakdowns and processing time variations. ...