Two-Machine Flow Shop with a Dynamic Storage Space and UET Operations

Berlińska, J; Kononov, A; Zinder, Y

Two-Machine Flow Shop with a Dynamic Storage Space and UET Operations

Berlińska, J Kononov, A

Zinder, Y

Permalink

Publisher:: Springer International Publishing
Publication Type:: Conference Proceeding
Citation:: Advances in Intelligent Systems and Computing, 2020, 991, pp. 1139-1148
Issue Date:: 2020-01-01

Closed Access

	Filename	Description	Size
	Two-step machine flow shop chapter.pdf	Published version	146.3 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Berlińska, J
dc.contributor.author	Kononov, A https://orcid.org/0000-0001-6144-0251
dc.contributor.author	Zinder, Y
dc.date.accessioned	2021-02-24T03:23:27Z
dc.date.available	2021-02-24T03:23:27Z
dc.date.issued	2020-01-01
dc.identifier.citation	Advances in Intelligent Systems and Computing, 2020, 991, pp. 1139-1148
dc.identifier.isbn	9783030218027
dc.identifier.issn	2194-5357
dc.identifier.issn	2194-5365
dc.identifier.uri	http://hdl.handle.net/10453/146379
dc.description.abstract	© 2020, Springer Nature Switzerland AG. The paper establishes the NP-hardness in the strong sense of a two-machine flow shop scheduling problem with unit execution time (UET) operations, dynamic storage availability, job dependent storage requirements, and the objective to minimise the time required for the completion of all jobs, i.e. to minimise the makespan. Each job seizes the required storage space for the entire period from the start of its processing on the first machine till the completion of its processing on the second machine. The considered scheduling problem has several applications, including star data gathering networks and certain supply chains and manufacturing systems. The NP-hardness result is complemented by a polynomial-time approximation scheme (PTAS) and several heuristics. The presented heuristics are compared by means of computational experiments.
dc.language	en
dc.publisher	Springer International Publishing
dc.relation.ispartof	Advances in Intelligent Systems and Computing
dc.relation.isbasedon	10.1007/978-3-030-21803-4_112
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	Two-Machine Flow Shop with a Dynamic Storage Space and UET Operations
dc.type	Conference Proceeding
utslib.citation.volume	991
pubs.organisational-group	/University of Technology Sydney/Faculty of Science
pubs.organisational-group	/University of Technology Sydney/Faculty of Science/School of Mathematical and Physical Sciences
pubs.organisational-group	/University of Technology Sydney
utslib.copyright.status	closed_access	*
dc.date.updated	2021-02-24T03:23:26Z
pubs.publication-status	Published
pubs.volume	991

Abstract:

© 2020, Springer Nature Switzerland AG. The paper establishes the NP-hardness in the strong sense of a two-machine flow shop scheduling problem with unit execution time (UET) operations, dynamic storage availability, job dependent storage requirements, and the objective to minimise the time required for the completion of all jobs, i.e. to minimise the makespan. Each job seizes the required storage space for the entire period from the start of its processing on the first machine till the completion of its processing on the second machine. The considered scheduling problem has several applications, including star data gathering networks and certain supply chains and manufacturing systems. The NP-hardness result is complemented by a polynomial-time approximation scheme (PTAS) and several heuristics. The presented heuristics are compared by means of computational experiments.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/146379