Resequencing and feature assignment on an automated assembly line

IEEE Transactions on Robotics and Automation

Volumn 19, Issue 1, 2003, Pages 89-102

  Lahmar, Maher ^a   Ergan, Hakan ^b   Benjaafar, Saif ^a  

^a University of Minnesota   (United States)

^b USAirways   (United States)

Author keywords

Assembly line design; Feature assignment; Sequencing with setups

Indexed keywords

ASSEMBLY; AUTOMOBILE MANUFACTURE; AUTOMOTIVE ENGINEERING; MATHEMATICAL MODELS; OPTIMIZATION;

ASSEMBLY LINE DESIGN; AUTOMATED ASSEMBLY LINE; FEATURE ASSIGNMENT PROBLEM; FEATURE DENSITY MATRIX;

FACTORY AUTOMATION;

EID: 0037325865     PISSN: 1042296X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TRA.2002.807556     Document Type: Article

References (16)

1. D. L. Myron and T. L. Magnanti, "Paint blocking in Ford's in-line vehicle sequencing environment," Leaders for Manufacturing Program, Cambridge, MA, Tech. Rep., 1996.
2. I. Baybars, "A survey of exact algorithms for the simple assembly line balancing problem," Manage. Sci., vol. 32, pp. 902-952, 1986.
3. C. A. Yano and A. Bolat, "Survey, development, and application of algorithms for sequencing paced assembly lines," J. Manuf. Oper. Manage., vol. 2, pp. 172-198, 1989.
4. C. Y. Lee and G. Vairaktarakis, "Workforce planning in mixed model assembly systems," Oper. Res., vol. 45, pp. 553-567, 1997.
5. C. A. Yano and R. Rachamadugu, "Sequencing to minimize work overload in assembly lines with product options," Manage. Sci., vol. 37, no. 5, pp. 572-586, 1991.
6. L. D. Burns and C. F. Daganzo, "Assembly line job sequencing principles," Int. J. Prod. Res., vol. 25, pp. 71-99, 1987.
7. A. Bolat, M. Savsar, and M. A. Al-Fawzan, "Algorithms for real-time scheduling of jobs on mixed model assembly lines," Comput. Oper. Res., vol. 21, pp. 487-498, 1994.
8. C. L. Monma and C. N. Potts, "On the complexity of scheduling with batch setup times," Oper. Res., vol. 37, pp. 798-804, 1999.
9. C. N. Potts and L. N. Van Wassenhove, "Integrating scheduling with batching and lot sizing: A review of algorithms and complexity," J. Oper. Res. Soc., vol. 43, pp. 395-406, 1992.
10. A. T. Unal and A. S. Kiran, "Batch sequencing," IIE Trans., vol. 24. pp. 73-83, 1992.
11. S. Webster and K. R. Baker, "Scheduling groups of jobs on a single machine," Oper. Res., vol. 43, pp. 692-703, 1995.
12. J. Bruno and P. Downey, "Complexity of task sequencing with deadlines, setup times, and changeover costs," SIAM J. Comput., vol. 7, pp. 393-404, 1978.
13. G. Laporte, "The traveling salesman problem: an overview of exact and approximate algorithms," Eur. J. Oper. Res., 59, pp. 231-247, 1992.
14. E. Balas and M. C. Carrera, "A dynamic subgradient-based branch and bound procedure for set covering," Oper. Res., vol. 44, pp. 875-890, 1996.
15. A. Caprara, M. Fischetti, and P. Toth, "A heuristic method for the set covering problem," Oper. Res., vol. 47, pp. 730-743, 1999.
16. M. Lahmar and S. Benjaafar, "Resequencing with limited flexibility," Grad. Pgm. in Ind. Eng., Univ. of Minnesota, Minneapolis, MN, Working Paper, 2003.