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.