Sciact
  • EN
  • RU

On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements Full article

Journal Journal of Global Optimization
ISSN: 0925-5001 , E-ISSN: 1573-2916
Output data Year: 2022, Volume: 83, Number: 3, Pages: 445-456 Pages count : 12 DOI: 10.1007/s10898-021-01097-w
Tags Computational complexity; Flow shop; Job-dependent storage requirements; 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 (1)

1 Sobolev Institute of Mathematics 0314-2019-0014

Abstract: The paper is concerned with the two-machine flow shop, where each job requires an additional resource (referred to as storage space) from the start of its first operation till the end of its second operation. The storage requirement of a job is determined by the processing time of its first operation. At any point in time, the total consumption of this additional resource cannot exceed a given limit (referred to as the storage capacity). The goal is to minimise the makespan, i.e. to minimise the time needed for the completion of all jobs. This problem is NP-hard in the strong sense. The paper analyses how the parameter - a lower bound on the storage capacity specified in terms of the processing times, affects the computational complexity.
Cite: Kononov A. , Memar J. , Zinder Y.
On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements
Journal of Global Optimization. 2022. V.83. N3. P.445-456. DOI: 10.1007/s10898-021-01097-w WOS Scopus РИНЦ OpenAlex
Dates:
Submitted: Jan 15, 2020
Accepted: Sep 17, 2021
Published online: Oct 13, 2021
Published print: Jul 5, 2022
Identifiers:
Web of science: WOS:000706608000002
Scopus: 2-s2.0-85117012596
Elibrary: 47514546
OpenAlex: W3205093017
Citing:
DB Citing
Scopus 4
Web of science 3
OpenAlex 4
Elibrary 4
Altmetrics: