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

No Thumbnail Available

Date

2017

Journal Title

Journal ISSN

Volume Title

Publisher

Sumy State University
Theses

Date of Defense

Scientific Director

Speciality

Date of Presentation

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.

Keywords

job shop scheduling, розклад роботи магазину, расписание работы магазина, optimizing, оптимізація, оптимизация, initial acceptable solution, algorithm, алгоритм, theory of schedule, теорія розкладу, теория расписания

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.

Endorsement

Review

Supplemented By

Referenced By