The task of schedule optimizing for partially ordered jobs on machines with different productivity in the presence of idle time

Please use this identifier to cite or link to this item: http://essuir.sumdu.edu.ua/handle/123456789/55651

Or use following links to share this resource in social networks: Recommend this item

Title	The task of schedule optimizing for partially ordered jobs on machines with different productivity in the presence of idle time
Authors	Keller, R. Ilchuk, O.
ORCID
Keywords	job shop scheduling розклад роботи магазину расписание работы магазина optimizing оптимізація оптимизация initial acceptable solution algorithm алгоритм theory of schedule теорія розкладу теория расписания
Type	Conference Papers
Date of Issue	2017
URI	http://essuir.sumdu.edu.ua/handle/123456789/55651
Publisher	Sumy State University
License	Copyright not evaluated
Citation	Keller, R. The task of schedule optimizing for partially ordered jobs on machines with different productivity in the presence of idle time [Текст] / R. Keller, O. Ilchuk // Advanced Information Systems and Technologies : proceedings of the V international scientific conference, Sumy, May 17-19 2017/ Edited by S.І. Protsenko, V.V. Shendryk. - Sumy : Sumy State University, 2017. - P. 83-85.
Abstract	The subject of this article is the job shop scheduling problem and methods for solving this problem. It contains model for the task of schedule optimizing for partially ordered jobs on machines with different productivity in the presence of idle time and algorithm for getting initial permissible solution.
Appears in Collections:	Наукові видання (ЕлІТ)