Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/10861
Title: Searching optimal resequencing and feature assignment on an automated assembly line
Authors: Lim, A
Xu, Z 
Issue Date: 2009
Publisher: Palgrave Macmillan
Source: Journal of the Operational Research Society, 2009, v. 60, no. 3, p. 361-371 How to cite?
Journal: Journal of the Operational Research Society 
Abstract: The resequencing and feature assignment problem (RFAP) appears among jobs in the assembly line, especially in the automotive industry. Each job in the assembly line must be assigned a feature from its feasible feature set. However, a changeover cost is incurred between two consecutive jobs with different features. To minimize the total changeover cost, the job sequence needs to be rearranged, but the rearrangement is restricted to the number of offline buffers. The RFAP turns out to be \[Nscr]-hard in the strong sense. Based on a beam search heuristic to generate upper bounds of optimum solutions, we have proposed an iterative search scheme which can achieve optimum solutions in a reasonably short time, for cases sized as large as that in reality. Extensive experiments have shown very favourable results for our methods in terms of both the solution quality and the time efficiency.
URI: http://hdl.handle.net/10397/10861
ISSN: 0160-5682
EISSN: 1476-9360
DOI: 10.1057/palgrave.jors.2602533
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

7
Last Week
0
Last month
0
Citations as of Oct 11, 2017

WEB OF SCIENCETM
Citations

7
Last Week
0
Last month
0
Citations as of Oct 16, 2017

Page view(s)

35
Last Week
1
Last month
Checked on Oct 16, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.