Now showing items 1-3 of 3
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 ...
Match-up scheduling under a machine breakdown
When a machine breakdown forces a modified flow shop (MFS) out of the prescribed state, the proposed strategy reschedules part of the initial schedule to match up with the preschedule at some point. The objective is to ...