Sciact
  • EN
  • RU

Algorithms for Flow Shop with Job–Dependent Buffer Requirements Full article

Journal Lecture Notes in Networks and Systems
ISSN: 2367-3370 , E-ISSN: 2367-3389
Output data Year: 2022, Volume: 363 LNNS, Pages: 63-74 Pages count : 12 DOI: 10.1007/978-3-030-92666-3_6
Tags Buffer; Flow shop; Heuristics; Makespan
Authors Kononov A. 1 , Memar J. 2 , Zinder Y. 2
Affiliations
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

Funding (2)

1 Russian Foundation for Basic Research 20-07-00458
2 Sobolev Institute of Mathematics 0314-2019-0014

Abstract: 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.
Cite: 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
Identifiers:
Scopus: 2-s2.0-85121928891
Elibrary: 47546999
OpenAlex: W4200145621
Citing: Пока нет цитирований
Altmetrics: