Two-stage assembly-type flowshop batch scheduling problem subject to a fixed job sequence

Hwang, FJ; Lin, BMT

Two-stage assembly-type flowshop batch scheduling problem subject to a fixed job sequence

Hwang, FJ

Lin, BMT

Permalink

Publication Type:: Journal Article
Citation:: Journal of the Operational Research Society, 2012, 63 (6), pp. 839 - 845
Issue Date:: 2012-06-01

Closed Access

	Filename	Description	Size
	2012001331OK.pdf		217.51 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 https://orcid.org/0000-0003-0456-296X	en_US
dc.date.issued	2012-06-01	en_US
dc.identifier.citation	Journal of the Operational Research Society, 2012, 63 (6), pp. 839 - 845	en_US
dc.identifier.issn	0160-5682	en_US
dc.identifier.uri	http://hdl.handle.net/10453/43747
dc.description.abstract	This paper discusses a two-stage assembly-type flowshop scheduling problem with batching considerations subject to a fixed job sequence. The two-stage assembly flowshop consists of m stage-1 parallel dedicated machines and a stage-2 assembly machine which processes the jobs in batches. Four regular performance metrics, namely, the total completion time, maximum lateness, total tardiness, and number of tardy jobs, are considered. The goal is to obtain an optimal batching decision for the predetermined job sequence at stage 2. This study presents a two-phase algorithm, which is developed by coupling a problem-transformation procedure with a dynamic program. The running time of the proposed algorithm is O(mnn 5), where n is the number of jobs. © 2012 Operational Research Society Ltd.	en_US
dc.relation.ispartof	Journal of the Operational Research Society	en_US
dc.relation.isbasedon	10.1057/jors.2011.90	en_US
dc.subject.classification	Operations Research	en_US
dc.title	Two-stage assembly-type flowshop batch scheduling problem subject to a fixed job sequence	en_US
dc.type	Journal Article
utslib.citation.volume	6	en_US
utslib.citation.volume	63	en_US
utslib.for	010205 Financial Mathematics	en_US
utslib.for	0102 Applied Mathematics	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
pubs.organisational-group	/University of Technology Sydney/Faculty of Science/School of Mathematical Sciences
utslib.copyright.status	closed_access
pubs.issue	6	en_US
pubs.publication-status	Published	en_US
pubs.volume	63	en_US

Abstract:

This paper discusses a two-stage assembly-type flowshop scheduling problem with batching considerations subject to a fixed job sequence. The two-stage assembly flowshop consists of m stage-1 parallel dedicated machines and a stage-2 assembly machine which processes the jobs in batches. Four regular performance metrics, namely, the total completion time, maximum lateness, total tardiness, and number of tardy jobs, are considered. The goal is to obtain an optimal batching decision for the predetermined job sequence at stage 2. This study presents a two-phase algorithm, which is developed by coupling a problem-transformation procedure with a dynamic program. The running time of the proposed algorithm is O(mnn 5), where n is the number of jobs. © 2012 Operational Research Society Ltd.

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

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