Sequencing with limited flexibility on moving assembly lines

Maher Lahmar, Saif Benjaafar

Research output: Contribution to conferencePaperpeer-review

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 languageEnglish (US)
Pages799-805
Number of pages7
StatePublished - Dec 1 2004
EventIIE Annual Conference and Exhibition 2004 - Houston, TX, United States
Duration: May 15 2004May 19 2004

Other

OtherIIE Annual Conference and Exhibition 2004
CountryUnited States
CityHouston, TX
Period5/15/045/19/04

Keywords

  • Dynamic programming
  • Feature assignment
  • Sequencing
  • Traveling salesman problem

Fingerprint Dive into the research topics of 'Sequencing with limited flexibility on moving assembly lines'. Together they form a unique fingerprint.

Cite this