Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/ICTAI.2005.114 | ICTAI |
Keywords | Field | DocType |
changeover cost,searching optimal resequencing,feature assignment,different feature,automated assembly line,consecutive job,feasible feature set,total changeover cost,feature assignment problem,assembly line,off-line buffer,job sequence,assignment problem,assembly | Heuristic,Search algorithm,Upper and lower bounds,Computer science,Scheduling (computing),Iterative method,Beam search,Heuristics,Assignment problem,Operations management | Conference |
Volume | Issue | ISSN |
60 | 3 | 1476-9360 |
ISBN | Citations | PageRank |
0-7695-2488-5 | 4 | 0.47 |
References | Authors | |
9 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrew Lim | 1 | 20 | 3.19 |
| Zhou Xu | 2 | 66 | 15.44 |