کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
5082807 1477654 2006 18 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Time-bounds for production networks
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی مهندسی صنعتی و تولید
پیش نمایش صفحه اول مقاله
Time-bounds for production networks
چکیده انگلیسی

Lower and upper time bounds are established for completing a task using a system that can be structurally represented by a digraph in which the nodes are production components. Each component is assumed to execute a known number of operations and each operation is assumed to require a known delay. The algorithms presented provide a rapid means for computing an objective function when optimizing a system using a method that requires the objective function to be evaluated an extremely large number of times, such as a simulated annealing or genetic algorithm.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: International Journal of Production Economics - Volume 102, Issue 1, July 2006, Pages 149-166
نویسندگان
, ,