Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence

Hwang, FJ; Kovalyov, MY; Lin, BMT

Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence

Hwang, FJ

Kovalyov, MY Lin, BMT

Permalink

Publication Type:: Journal Article
Citation:: Annals of Operations Research, 2014, 217 (1), pp. 263 - 279
Issue Date:: 2014-01-01

Closed Access

	Filename	Description	Size
	2013002705OK.pdf		716.54 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	Kovalyov, MY	en_US
dc.contributor.author	Lin, BMT	en_US
dc.date.issued	2014-01-01	en_US
dc.identifier.citation	Annals of Operations Research, 2014, 217 (1), pp. 263 - 279	en_US
dc.identifier.issn	0254-5330	en_US
dc.identifier.uri	http://hdl.handle.net/10453/28121
dc.identifier.uri	http://hdl.handle.net/10453/32666
dc.description.abstract	This paper studies a problem of scheduling fabrication and assembly operations in a two-machine flowshop, subject to the same predetermined job sequence on each machine. In the manufacturing setting, there are n products, each of which consists of two components: a common component and a unique component which are fabricated on machine 1 and then assembled on machine 2. Common components of all products are processed in batches preceded by a constant setup time. The manufacturing process related to each single product is called a job. We address four regular performance measures: the total job completion time, the maximum job lateness, the total job tardiness, and the number of tardy jobs. Several optimality properties are presented. Based upon the concept of critical path and block schedule, a generic dynamic programming algorithm is developed to find an optimal schedule in O(n7) time. © 2014 Springer Science+Business Media New York.	en_US
dc.relation.ispartof	Annals of Operations Research	en_US
dc.relation.isbasedon	10.1007/s10479-014-1531-8	en_US
dc.subject.classification	Operations Research	en_US
dc.title	Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence	en_US
dc.type	Journal Article
utslib.citation.volume	1	en_US
utslib.citation.volume	217	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	1	en_US
pubs.publication-status	Published	en_US
pubs.volume	217	en_US

Abstract:

This paper studies a problem of scheduling fabrication and assembly operations in a two-machine flowshop, subject to the same predetermined job sequence on each machine. In the manufacturing setting, there are n products, each of which consists of two components: a common component and a unique component which are fabricated on machine 1 and then assembled on machine 2. Common components of all products are processed in batches preceded by a constant setup time. The manufacturing process related to each single product is called a job. We address four regular performance measures: the total job completion time, the maximum job lateness, the total job tardiness, and the number of tardy jobs. Several optimality properties are presented. Based upon the concept of critical path and block schedule, a generic dynamic programming algorithm is developed to find an optimal schedule in O(n7) time. © 2014 Springer Science+Business Media New York.

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

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