✦ LIBER ✦

A note on worst-case performance of heuristics for maintenance scheduling problems

✍ Scribed by Xiangtong Qi

Book ID: 108112610
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 159 KB
Volume: 155
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2006.06.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on worst-case analysis of approxi

A note on worst-case analysis of approximation algorithms for a scheduling problem

✍ Eugeniusz Nowicki; Czesław Smutnicki 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 370 KB

On the worst-case performance of some he

On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints

✍ Marius M. Solomon 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 607 KB

A Note on "An On-Line Scheduling Heurist

A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling"

✍ Chandrasekaran, R.; Chen, Bo; Galambos, Gábor; Narayanan, P. R.; Van Vliet, Andr 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 162 KB

Worst-case performance of some heuristic

Worst-case performance of some heuristics for Steiner's problem in directed graphs

✍ Stefan Voss 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 576 KB

Worst-case and numerical analysis of heu

Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect

✍ Wen-Hung Kuo; Chou-Jung Hsu; Dar-Li Yang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 607 KB

A tight worst case bound for the perform

A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear steiner tree problem

✍ C. C. De Souza; C. C. Ribeiro 📂 Article 📅 1990 🏛 Springer 🌐 German ⚖ 234 KB