Two-stage flexible flow shop scheduling subject to fixed job sequences

Hwang, FJ; Lin, BMT

Two-stage flexible flow shop scheduling subject to fixed job sequences

Hwang, FJ

Lin, BMT

Permalink

Publication Type:: Journal Article
Citation:: Journal of the Operational Research Society, 2016, 67 (3), pp. 506 - 515
Issue Date:: 2016-03-01

Closed Access

	Filename	Description	Size
	Two-stage flexible flow shop scheduling subject to fixed job sequences(2016).pdf	Published Version	612.46 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	Hwang, FJ https://orcid.org/0000-0002-1741-5590	en_US
dc.contributor.author	Lin, BMT	en_US
dc.date.issued	2016-03-01	en_US
dc.identifier.citation	Journal of the Operational Research Society, 2016, 67 (3), pp. 506 - 515	en_US
dc.identifier.issn	0160-5682	en_US
dc.identifier.uri	http://hdl.handle.net/10453/42231
dc.description.abstract	© 2016 Operational Research Society Ltd. This paper investigates the scheduling problem in a two-stage flexible flow shop, which consists of m stage-1 parallel dedicated machines and a stage-2 bottleneck machine, subject to the condition that n l jobs per type l∈1,..., m are processed in a fixed sequence. Four regular performance metrics, including the total completion time, the maximum lateness, the total tardiness, and the number of tardy jobs, are considered. For each considered objective function, we aim to determine an optimal interleaving processing sequence of all jobs coupled with their starting times on the stage-2 bottleneck machine. The problem under study is proved to be strongly NP-hard. An O(m 2 Π l=1 m n l 2) dynamic programming algorithm coupled with numerical experiments is presented.	en_US
dc.relation.ispartof	Journal of the Operational Research Society	en_US
dc.relation.isbasedon	10.1057/jors.2015.61	en_US
dc.subject.classification	Operations Research	en_US
dc.title	Two-stage flexible flow shop scheduling subject to fixed job sequences	en_US
dc.type	Journal Article
utslib.citation.volume	3	en_US
utslib.citation.volume	67	en_US
utslib.for	010206 Operations Research	en_US
utslib.for	01 Mathematical Sciences	en_US
utslib.for	08 Information and Computing Sciences	en_US
utslib.for	15 Commerce, Management, Tourism and Services	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	3	en_US
pubs.publication-status	Published	en_US
pubs.volume	67	en_US

Abstract:

© 2016 Operational Research Society Ltd. This paper investigates the scheduling problem in a two-stage flexible flow shop, which consists of m stage-1 parallel dedicated machines and a stage-2 bottleneck machine, subject to the condition that n l jobs per type l∈1,..., m are processed in a fixed sequence. Four regular performance metrics, including the total completion time, the maximum lateness, the total tardiness, and the number of tardy jobs, are considered. For each considered objective function, we aim to determine an optimal interleaving processing sequence of all jobs coupled with their starting times on the stage-2 bottleneck machine. The problem under study is proved to be strongly NP-hard. An O(m 2 Π l=1 m n l 2) dynamic programming algorithm coupled with numerical experiments is presented.

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

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