Please use this identifier to cite or link to this item:
https://libr.msu.by/handle/123456789/14419| Title: | Упорядочение конфликтных требований в процессе реализации оптимального расписания |
| Authors: | Лещенко, Н. М. Сотсков, Ю. Н. |
| Keywords: | процесс решения задачи этапы решения задачи |
| Issue Date: | 2005 |
| Publisher: | Магілёўскі дзяржаўны ўніверсітэт імя А. А. Куляшова |
| Citation: | Лещенко, Н. М. Упорядочение конфликтных требований в процессе реализации оптимального расписания / Н. М. Лещенко, Ю. Н. Сотсков // Веснік Магілёўскага дзяржаўнага ўніверсітэта імя А. А. Куляшова. – 2005. – № 2–3 (21). – С. 127–138. |
| Abstract: | Two-machine flow-shop scheduling problem minimizing makespan is considered for the case when only lower and upper bounds of job processing times are known before scheduling. Case when minimal set of schedules consists of only two permutations is considered. We propose a new approach for finding an optimal permutation in the realization process of optimal schedule. Sufficient conditions for permutation optimality are proven. |
| URI: | http://libr.msu.by/handle/123456789/14419 |
| Appears in Collections: | № 2–3 (21) |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.