𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the optimality of Feautrier's scheduling algorithm

✍ Scribed by Frédéric Vivien

Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
290 KB
Volume
15
Category
Article
ISSN
1532-0626

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Complexity of Exclusion Algorithm
On the Complexity of Exclusion Algorithms for Optimization
✍ Eugene Allgower; Melissa Erdmann; Kurt Georg 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 133 KB

Exclusion algorithms are a well-known tool in the area of interval analysis for finding all solutions of a system of nonlinear equations or for finding the global minimum of a function over a compact domain. The present paper discusses a new class of tests for such algorithms in the context of globa

On the optimality of A∗
On the optimality of A∗
✍ David Gelperin 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 438 KB

After discussing difficulties with previous proofs of A\*'s ootimality, new proofs are presented. In addition, examples are used to show: (1) that the value of (~n) may be a function of the state of the search as well as the al~ailable heuristic information and ( 2) that there exist admissible searc

The role of algorithm and result compreh
The role of algorithm and result comprehensibility of automated scheduling on complacency
✍ Julien Cegarra; Jean-Michel Hoc 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 256 KB

## Abstract Several studies have stressed that even expert operators who are aware of a machine's limits could adopt its proposals without questioning them (i.e., the complacency phenomenon). In production scheduling for manufacturing, this is a significant problem, as it is often suggested that th