|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ПсковГУ |
||
On the Recursive Representation of the Permutation Flow and Job Shop Scheduling Problems and Some Extensionsстатья
Статья опубликована в высокорейтинговом журнале
Информация о цитировании статьи получена из
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 23 января 2026 г.
- Авторы: Kupriyanov Boris, Lazarev Alexander, Roschin Alexander, Werner Frank
- Журнал: Mathematics
- Том: 13
- Номер: 19
- Год издания: 2025
- Издательство: MDPI
- Местоположение издательства: Basel, Switzerland
- Первая страница: 1
- Последняя страница: 28
- Номер статьи: 3185
- DOI: 10.3390/math13193185
- Аннотация: In this paper, we propose a formulation of the permutation flow and job shop scheduling problems using special recursive functions and show its equivalence to the existing classical formulation. Equivalence is understood in the sense that both ways of defining the problem describe the same set of feasible schedules for each pair of jobs and machine numbers. In this paper, the apparatus of recursive functions is used to describe and solve three problems: permutation flow shop; permutation flow shop with the addition of the ’and’ predicate extending the machine chain to an acyclic graph; and permutation job shop. The predicate ’and’ allows the description of the flow shop with assembly operation tasks. Recursive functions have a common domain and range. To calculate an optimal schedule for each of these three problems, a branch and bound method is considered based on a recursive function that implements a job swapping algorithm. The complexity of the optimization algorithm does not increase compared to the non-recursive description of the PFSP. This article presents some results for the calculation of optimal schedules on several test instances. It is expected that the new method, based on the description of recursive functions and their superposition, will be productive for formulating and solving some extensions of scheduling problems that have practical significance.
- Добавил в систему: Лазарев Александр Алексеевич
Прикрепленные файлы
| № | Имя | Описание | Имя файла | Размер | Добавлен |
|---|