Search
Now showing items 1-10 of 18
New insights on the single machine total tardiness problem
(Palgrave Macmillan, 1997)
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 ...
A neural network model for scheduling problems
(Elsevier, 1996)
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 ...
Non-identical parallel CNC machine scheduling
(Taylor & Francis, 2003)
In this study, we solve the non-identical parallel CNC machine scheduling problem. We have two objectives: minimizing the manufacturing cost (comprising machining, non-machining and tooling costs) and minimizing the total ...
Generating short-term observation schedules for space mission projects
(Kluwer Academic Publishers, 1999)
In this paper, we propose a new dispatching rule and a set of local search algorithms based on the filtered beam search, GRASP and simulated annealing methodologies to construct short-term observation schedules of space ...
Joint lot sizing and tool management in a CNC environment
(Elsevier, 1999)
We propose a new algorithm to solve lot sizing, tool allocation and machining conditions optimization problems simultaneously to minimize total production cost in a CNC environment. Most of the existing lot sizing and tool ...
A new dominance rule to minimize total weighted tardiness with unequal release dates
(Elsevier, 2001)
We present a new dominance rule by considering the time-dependent orderings between each pair of jobs for the single machine total weighted tardiness problem with release dates. The proposed dominance rule provides a ...
Integrated scheduling and tool management in flexible manufacturing systems
(Taylor & Francis, 2001)
A multistage algorithm is proposed that will solve the scheduling problem in a flexible manufacturing system by considering the interrelated subproblems of processing time control, tool allocation and machining conditions ...
An efficient algorithm for the single machine total tardiness problem
(Taylor & Francis, 2001)
This paper presents an exact algorithm for the single machine total tardiness problem (1// L T;). We present a new synthesis of various results from the literature which leads to a compact and concise representation of job ...
Job shop scheduling with beam search
(Elsevier Science B.V., Amsterdam, Netherlands, 1999)
Beam Search is a heuristic method for solving optimization problems. It is an adaptation of the branch and bound method in which only some nodes are evaluated in the search tree. At any level, only the promising nodes are ...
A new dominance rule for the total weighted tardiness problem
(Taylor & Francis, 1999)
We present a new dominance rule for the single machine total weighted tardiness problem with job dependent penalties. The proposed dominance rule provides a sufficient condition for local optimality. We show that if any ...