Evaluation of leading heuristics for the single machine tardiness problem

Article Abstract:

Two heuristic procedures for scheduling jobs on a single machine with the objective function of minimizing total tardiness were compared. Specifically, computational experiments were performed to show that the Net Benefit of Relocation heuristic proposed by the authors is superior to the heuristic procedure developed by S.S. Panwalkar, M.L. Smith and C.P. Koulamas (PSK) because of the sizable penalties generated by the PSK algorithm.

Production Planning & Control, Production control

---

A comparison of stochastic scheduling rules for maximizing project net present value

Article Abstract:

Stochastic scheduling rules can be used as an alternative to single-pass rules to maximize a project's net present value. The performance of nine stochastic scheduling rates is assessed. A data set consisting of 1440 problems is used. The study showed that, in certain conditions, the Rank Positional Weight and a Discounted Cumulative Cash Flow Weight rule performed well in maximizing project net present value.

---

Similar abstracts:

• Abstracts: A fast and effective heuristic for the orienteering problem. A computational study of smoothing heuristics for the traveling salesman problem
• Abstracts: A dominant subset of V-shaped sequences for a class of single machine sequencing problems. Comparing the efficacy of ranking methods for multiple round-robin tournaments
• Abstracts: Consumer evaluations of brand extensions: further empirical results. Building models for marketing decisions: improving empirical procedures
• Abstracts: On not-first/not-last conditions in disjunctive scheduling. Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
• Abstracts: A multiobjective optimization approach to thermal generating units maintenance scheduling. A new LP-based lower bound for the cumulative scheduling problem

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.