๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Heuristics with guaranteed performance bounds for a manufacturing system with product recovery

โœ Scribed by Feng, Yan; Viswanathan, S.

Book ID
125456806
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
503 KB
Volume
232
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A production model with delivery time gu
A production model with delivery time guarantees for manufacturing systems with early set-up
โœ Wai Ki Ching ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 317 KB

We consider optimal (s, S) policies with delivery time guarantees for production planning in manufacturing systems with early set-up. The machine produces one type of product with delivery time guarantees on the products offered to the customers. The inter-arrival time of the demand and the processi

A polynomial time heuristic for certain
A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
โœ Svatopluk Poljak; Daniel Turzรญk ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 340 KB

We introduce a notion of ).-extendible property of graphs and prove: If P is a ).-extendible property (0<).<1), then for a connected graph G = (V, E) and an objective function c: E---\*R + one can construct a spanning subgraph H= (V, F) which has the property P and satisfies c(F) = ~. c(E) + ยฝ