loading...
Searching Optimal Resequencing and Feature Assignment on an Automated Assembly Line
Hong Kong, China November 14-November 16
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICTAI.2005.11417th IEEE International Conference on ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Andrew Lim, Zhou Xu, "Searching Optimal Resequencing and Feature Assignment on an Automated Assembly Line," Tools with Artificial Intelligence, IEEE International Conference on, pp. 491-498, 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/ICTAI.2005.114,
author = {Andrew Lim and Zhou Xu},
title = {Searching Optimal Resequencing and Feature Assignment on an Automated Assembly Line},
journal ={Tools with Artificial Intelligence, IEEE International Conference on},
volume = {0},
year = {2005},
issn = {1082-3409},
pages = {491-498},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICTAI.2005.114},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Tools with Artificial Intelligence, IEEE International Conference on
TI - Searching Optimal Resequencing and Feature Assignment on an Automated Assembly Line
SN - 1082-3409
SP491
EP498
A1 - Andrew Lim,
A1 - Zhou Xu,
PY - 2005
KW - null
VL - 0
JA - Tools with Artificial Intelligence, IEEE International Conference on
ER -
 
Andrew Lim, Hong Kong University of Science and Technology
Zhou Xu, Hong Kong University of Science and Technology
The resequencing and feature assignment problem (RFAP) is to schedule a set of jobs on a moving assembly line so that the total changeover cost is minimized. 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 off-line buffers where a job removed from the line can be temporarily stored before it is reinserted.
Citation:
Andrew Lim, Zhou Xu, "Searching Optimal Resequencing and Feature Assignment on an Automated Assembly Line," ictai, pp.491-498, 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.