Permutation schedules for a two-machine flow shop with storage

Fung, J; Zinder, Y

Permutation schedules for a two-machine flow shop with storage

Fung, J

Zinder, Y

Permalink

Publication Type:: Journal Article
Citation:: Operations Research Letters, 2016, 44 (2), pp. 153 - 157
Issue Date:: 2016-03-01

Closed Access

	Filename	Description	Size
	1-s2.0-S0167637715001716-main.pdf	Published Version	446.28 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	Fung, J https://orcid.org/0000-0001-7352-4321	en_US
dc.contributor.author	Zinder, Y https://orcid.org/0000-0003-2024-8129	en_US
dc.date.issued	2016-03-01	en_US
dc.identifier.citation	Operations Research Letters, 2016, 44 (2), pp. 153 - 157	en_US
dc.identifier.issn	0167-6377	en_US
dc.identifier.uri	http://hdl.handle.net/10453/117807
dc.description.abstract	© 2015 Elsevier B.V. All rights reserved. This paper considers a two-machine flow shop problem with a buffer, arising in various applications, and addresses a fundamental question of the existence of an optimal permutation schedule. The paper proves that the problem of recognising whether an instance has an optimal permutation schedule is NP-complete in the strong sense, and estimates the deviation from the optimal makespan as a result of the restriction to permutation schedules only.	en_US
dc.relation.ispartof	Operations Research Letters	en_US
dc.relation.isbasedon	10.1016/j.orl.2015.12.012	en_US
dc.subject.classification	Operations Research	en_US
dc.title	Permutation schedules for a two-machine flow shop with storage	en_US
dc.type	Journal Article
utslib.citation.volume	2	en_US
utslib.citation.volume	44	en_US
utslib.for	0103 Numerical and Computational Mathematics	en_US
utslib.for	0102 Applied Mathematics	en_US
utslib.for	1503 Business and Management	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
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
utslib.copyright.status	closed_access
pubs.issue	2	en_US
pubs.publication-status	Published	en_US
pubs.volume	44	en_US

Abstract:

© 2015 Elsevier B.V. All rights reserved. This paper considers a two-machine flow shop problem with a buffer, arising in various applications, and addresses a fundamental question of the existence of an optimal permutation schedule. The paper proves that the problem of recognising whether an instance has an optimal permutation schedule is NP-complete in the strong sense, and estimates the deviation from the optimal makespan as a result of the restriction to permutation schedules only.

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

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