Algorithms for Flow Shop with Job–Dependent Buffer Requirements | Sciact - Система учета научной деятельности ИМ СО РАН

Algorithms for Flow Shop with Job–Dependent Buffer Requirements Научная публикация

Журнал

Lecture Notes in Networks and Systems
ISSN: 2367-3370 , E-ISSN: 2367-3389

Вых. Данные

Год: 2022, Том: 363 LNNS, Страницы: 63-74 Страниц : 12 DOI: 10.1007/978-3-030-92666-3_6

Ключевые слова

Buffer; Flow shop; Heuristics; Makespan

Авторы

Kononov A. ¹ , Memar J. ² , Zinder Y. ²

Организации

1	Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russian Federation
2	University of Technology Sydney, PO Box 123, Broadway, NSW 2007, Australia

Информация о финансировании (2)

1	Российский фонд фундаментальных исследований	20-07-00458
2	Институт математики им. С.Л. Соболева СО РАН	0314-2019-0014

The paper is concerned with algorithms for the two-machine flow shop, where each job needs storage space (a buffer) during the entire time of its processing. The buffer requirement is determined by the duration of job’s first operation. The goal is to minimise the time needed for the completion of all jobs. This scheduling problem is NP-hard in the strong sense. Recently, the polynomial-time algorithms were developed for particular cases of this problem. In this paper, we discuss two heuristics based on these polynomial-time algorithms and compare them with other efficient heuristics.

Kononov A. , Memar J. , Zinder Y.
Algorithms for Flow Shop with Job–Dependent Buffer Requirements
Lecture Notes in Networks and Systems. 2022. V.363 LNNS. P.63-74. DOI: 10.1007/978-3-030-92666-3_6 Scopus РИНЦ OpenAlex

Scopus:	2-s2.0-85121928891
РИНЦ:	47546999
OpenAlex:	W4200145621

Пока нет цитирований