𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Eugeniusz Nowicki; Czesław Smutnicki

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
370 KB
Volume
74
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Worst-case performance of approximation
Worst-case performance of approximation algorithms for tool management problems
✍ Yves Crama; Joris van de Klundert 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB 👁 2 views

Since the introduction of flexible manufacturing systems, researchers have investigated various planning and scheduling problems faced by the users of such systems. Several of these problems are not encountered in more classical production settings, and so-called tool management problems appear to b

Approximate solutions to a dynamic worst
Approximate solutions to a dynamic worst-case tolerance analysis problem
✍ L. V. Kolev 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 658 KB

## Abstract A dynamic tolerance problem for linear circuits is considered. More specifically, the worst‐case analysis of the scalar step response under interval variations of the circuit parameters is treated. Approximate solutions to the dynamic tolerance analysis problem considered are suggested,