Now showing items 1-6 of 6
Composite regions of feasibility for certain classes of distance constrained network location problems
Distance constrained network location involves locating m new facilities on a transport network G so as to satisfy upper bounds on distances between pairs of new facilities and pairs of new and existing facilities. 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 ...
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 ...
On connected Boolean functions
A Boolean function is called (co-)connected if the subgraph of the Boolean hypercube induced by its (false) true points is connected; it is called strongly connected if it is both connected and co-connected. The concept ...
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 ...
Single machine earliness-tardiness scheduling problems using the equal-slack rule
(Palgrave Macmillan Ltd., 1994)
The purpose of this paper is to analyze a special case of the non-pre-emptive single machine scheduling problem where the distinct due dates for each job are related to processing times according to the Equal-Slack rule. ...