Now showing items 1-5 of 5
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 ...
A comparative study of computational procedures for the resource constrained project scheduling problem
Performance of two new integer programming based heuristics together with some special purpose algorithms for project scheduling are tested from a computational point of view. The objective of the study is to compare the ...
A beam search-based algorithm and evaluation of scheduling approaches for fexible manufacturing systems
(Taylor & Francis, 1998)
This paper presents a new algorithm for the flexible manufacturing system (FMS) scheduling problem. The proposed algorithm is a heuristic based on filtered beam search. It considers finite buffer capacity, routing and ...
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 ...
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 ...