Optimal assembly line balancing using tabu search with partial random permutation technique

International Journal of Management Science and Engineering Management

Volumn 3, Issue 1, 2008, Pages 3-18

  Suwannarongsri, Supaporn ^a   Puangdownreong, Deacha ^a  

^a South East Asia University   (Thailand)

Author keywords

Assembly line balancing; Partial random permutation; Tabu search

Indexed keywords

EID: 62749128655     PISSN: 17509653     EISSN: 17509661     Source Type: Journal    
DOI: 10.1080/17509653.2008.10671032     Document Type: Article

References (21)

1. Arcus, A., 1966. Comsoal:a computer method of sequencing operations for assembly line. International Journal of Production Research, 4:25–32.
2. Baybars, I., 1986. A survey of exact algorithms for the simple assembly line balancing problem. Management Science, 32:11–17.
3. Chiang, W., 1998. The application of the tabu search metaheuristic to the assembly line balancing problem. Journal of Operation Research, 77:209–227.
4. Erel, E., and Sarin, S., 1998. A survey of the assembly line balancing procedures. Production Planning and Control, 9 (5):34–42.
5. Glover, F., 1986. Future paths for integer programming and links to artificial intelligence. Computer and Operation Research, 13:533–549.
6. Glover, F., and Hanafi, S., 2001. “ Finite convergence of tabu search ”. In Proceeding of the MIC’2001-4th Metaheuristic 333–336. in
7. Glover, F., and Laguna, M., 1997. Tabu Search, Norwell:Kluwer Academic Publishers.
8. Gutjahr, A., and Nemhauser, G., 1964. An algorithm for the balancing problem. Management Science, 11:23–35.
9. Helgeson, W., and Birnie, D., 1960. Assembly line balancing using the ranked positional weighting technique. Journal of Industrial Engineering, 12:18–27.
10. Kawasaki Motor Enterprise (Thailand) Ltd. Data sheet of the motorcycle assembly line Vol. 10, 119
11. Liu D., et al. On solving multiobjective bin packing problems using particle swarm optimization Proceeding of the IEEE Congress on Evolutionary Computation 2006 2095 2102 in
12. McMullen, P., Jit sequencing for mixed-model assembly lines with setups using tabu search. Production Planning and Control, 9 (5) 504–510.
13. McMullen, P., and Frazier, G., 1998. Using simulated annealing to solve a multiobjective assembly line balancing problem with parallel work stations. International Journal of Production Research, 36 (10):2717–2741.
14. McMullen, P., and Tarasewich, P., 2006. Multi-objective assembly line balancing via a modified ant-colony optimization technique. International Journal of Production Research, 44:27–42.
15. Moses, L., and Oakford, R., 1963. Tables of random permutations, Stanford, Calif:Stanford University Press.
16. Murat, E., Ozgur, K., and Fusun, U., 2004. “ An agent based supply chain system with neural network controlled processes ”. In Lecture Notes in Computer Science, Vol. 3314, 837–846. Berlin/Heidelberg:Springer. in
17. Rubinovitz, J., and Levitin, G., 1995. Genetic algorithm for assembly line balancing. International Journal of Production Economics, 41:343–354.
18. Scholl, A., 1999. Balancing and Sequencing of Assembly Lines, Heidelberg:Physica.
19. Sedgewick, R., 1977. Permutation generation methods. Computing Surveys, 9:137–164.
20. Sury, R., 1971. Aspects of assembly line balancing. International Journal of Production Research, 9:8–14.
21. Suwannarongsri, S., Limnararat, S., and Puangdownreong, D., A new hybrid intelligent method for assembly line balancing. Proceeding of the IEEE International Conference on Industrial Engineering and Engineering Management. pp. 1115–1119. in