GRASP with path relinking for a multiple objective sequencing problem for a mixed-model assembly line

International Journal of Production Research

Volumn 47, Issue 21, 2009, Pages 6001-6017

  Alpay, Serafettin ^a  

^a ESKISEHIR OSMANGAZI UNIVERSITY   (Turkey)

Author keywords

Greedy randomised adaptive search procedure; Heuristics; Mixed model assembly line; Mixed model sequencing; Multiple objective decision making; Optimisation

Indexed keywords

GREEDY RANDOMISED ADAPTIVE SEARCH PROCEDURE; HEURISTICS; MIXED-MODEL ASSEMBLY LINE; MIXED-MODEL SEQUENCING; MULTIPLE OBJECTIVE DECISION MAKING; OPTIMISATION;

ASSEMBLY; ASSEMBLY MACHINES; BIPED LOCOMOTION; COMPUTATIONAL COMPLEXITY; DECISION MAKING; HEURISTIC METHODS; SIMULATED ANNEALING; TABU SEARCH;

JUST IN TIME PRODUCTION;

EID: 70449556646     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540802158291     Document Type: Article

References (17)

1. Aiex, R.M., Binato, S., and Resende, M.G.C., 2003. Parallel GRASP with path-relinking for job shop scheduling. Parallel Computing, 29, 393-430.
2. Alpay, S., 1997. The design of computer aided master production scheduling system and an application. Thesis (Masters) (in Turkish). Eskisehir Osmangazi University, Turkey.
3. Cho, H.S, Paik, C.H., Yoon, H.M., and Kim, H.G., 2005. A robust design of simulated annealing approach for mixed model sequencing. Computers & Industrial Engineering, 48, 753-764.
4. Feo, T.A. and Bard, J., 1989. Flight scheduling and maintenance base planning. Management Science, 35 (12), 1415-1432.
5. Gupta, S.R. and Smith, J., 2006. Algorithms for single machine total tardiness scheduling with sequence dependent setups. European Journal of Operational Research, 175, 722-739.
6. Mansouri, S.A, 2005. A multi-objective genetic algorithm for mixed-model sequencing on JIT assembly lines. European Journal of Operational Research, 167, 696-716.
7. McMullen, P.R., 1998. JIT sequencing for mixed-model assembly lines with setups using tabu search. Production Planning and Controlling, 9 (5), 504-510.
8. McMullen, P.R. and Frazier, G.V., 2000. A simulated annealing approach to mixed-model sequencing with multiple objectives on a JIT line. IIE Transactions, 32 (8), 679-686.
9. McMullen, P.R., 2001a. An efficient frontier approach to addressing JIT sequencing problems with setups via search heuristics. Computers & Industrial Engineering, 41, 335-353.
10. McMullen, P.R., 2001b. A Kohonen self-organising map approach to addressing a multiple objective, mixed-model JIT sequencing problem. International Journal of Production Economics, 72, 59-71.
11. McMullen, P.R., 2001c. An ant colony optimisation approach to addressing a JIT sequencing problem with multiple objectives. Artificial Intelligence in Engineering, 15, 309-317.
12. McMullen, P.R., 2005. A beam search heuristic method for mixed-model scheduling with setups. International Journal of Production Economics, 96, 273-283.
13. Miltenburg, J., 1989. Level schedules for mixed-model assembly lines in just-in-time production systems. Management Science, 35 (2), 192-207.
14. Rahimi-Vahed, A.R., Mirghorbani, S.M., and Rabbania, M., 2007. Hybrid multi-objective particle swarm algorithm for a mixed-model assembly line sequencing problem. Engineering Optimisation, 39 (8), 877-898.
15. Resende, M.G.C. and Riberio, C.C., 2002. Chapter 8: Greedy randomised adaptive search procedures, In: F.W. Glower and G.A. Kochenberger, eds. Handbook of Metaheuristics, International Series in Operations Research and Management Science, Volume 57. Dordrecht: Kluwer Academic Publishers, 219-249.
16. Sabuncuoglu,-I., Gocgun, Y., and Erel, E., 2008. Backtracking and exchange of information: methods to enhance a beam search algorithm for assembly line scheduling. European Journal of Operational Research, 186, 915-930.
17. Tavakkoli-Moghadam, R. and Rahimi-Vahed, A.R., 2006. Multi-criteria sequencing problem for a mixed-model assembly line in a JIT production system. Applied Mathematics and Computation, 181 (2), 1471-1481.