Abstract
We consider the problem of resequencing a set of prearranged jobs when there is limited resequencing flexibility and sequence dependent changeover costs. Resequencing flexibility is limited by how far forward or backward a job can shift in the sequence relative to its original position. We show how the problem can be solved using dynamic programming in time polynomial in the number of jobs. We also provide numerical results to support managerial insights regarding the value of flexibility. We show that our procedure can be extended to solve a variety of sequencing problems on moving assembly lines.
Original language | English (US) |
---|---|
Pages | 799-805 |
Number of pages | 7 |
State | Published - Dec 1 2004 |
Event | IIE Annual Conference and Exhibition 2004 - Houston, TX, United States Duration: May 15 2004 → May 19 2004 |
Other
Other | IIE Annual Conference and Exhibition 2004 |
---|---|
Country/Territory | United States |
City | Houston, TX |
Period | 5/15/04 → 5/19/04 |
Keywords
- Dynamic programming
- Feature assignment
- Sequencing
- Traveling salesman problem