Now showing items 1-3 of 3
An analysis of heuristics in a dynamic job shop with weighted tardiness objectives
(Taylor & Francis, 1999)
Meeting due dates as a reflection of customer satisfaction is one of the scheduling criteria that is frequently encountered in today's manufacturing environments. The natural quantification of this qualitative goal involves ...
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 ...
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 ...