Розбиття на підмножини і побудова допустимих та оптимальних послідовностей виконання множин завдань на декількох машинах

The properties of the problems of building the admissible and optimal schedules for implementation of N tasks on the m machines under the condition of a loss of time on changeovers are investigated. On the basis of the established properties the operators of the inclusions are constructed from a con...

Full description

Saved in:
Bibliographic Details
Date:2012
Main Author: Zak, Yu. А.
Format: Article
Language:Russian
Published: The National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute" 2012
Online Access:http://journal.iasa.kpi.ua/article/view/71976
Tags: Add Tag
No Tags, Be the first to tag this record!
Journal Title:System research and information technologies

Institution

System research and information technologies

Similar Items