Using multiple objective tabu search and grammars to model and solve multi-objective flexible job shop scheduling problems

Journal of Intelligent Manufacturing

Volumn 15, Issue 6, 2004, Pages 777-785

  Baykasoǧlu, Adil ^a   Özbakir, Lale ^b   Sönmez, Ali Ihsan ^c  

^a GAZIANTEP UNIVERSITY   (Turkey)

^b ERCIYES UNIVERSITY   (Turkey)

^c CAG UNIVERSITY   (Turkey)

Author keywords

Flexibility; Grammars; Optimization; Scheduling; Tabu search

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL GRAMMARS; FLEXIBLE MANUFACTURING SYSTEMS; HEURISTIC METHODS; PROBLEM SOLVING; SEARCH ENGINES;

GRAMMERS; JOB SHOP SCHEDULING PROBLEM (JSSP); PRODUCTION SCHEDULING; TABU SEARCH;

SCHEDULING;

EID: 4944252227     PISSN: 09565515     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:JIMS.0000042663.16199.84     Document Type: Conference Paper

References (22)

1. Al-Fawzan, M. A. and Al-Sultan, K. S. (1996) A tabu search algorithm for minimizing the makespan in a job shop scheduling. Proceedings of the 5th Industrial Engineering Research Conference, Minneapolis, MN, USA, May 1996, pp. 115-119.
2. Baykasoǧlu, A. (2002) Linguistic based meta-heuristic optimisation model for flexible job shop scheduling. International Journal of Production Research, 40(17), 4523-4543.
3. Baykasoǧlu, A., Owen, S. and Gindy, N. (1999) A taboo search based approach to find the Pareto optimal set in multiple objective optimisation. Journal of Engineering Optimization, 31, 731-748.
4. Baykasoǧlu, A., Saad, S. M. and Gindy, N. (1998) A loading approach for cellular manufacturing systems. FAIM'1998: 8th International Conference on Flexible Automation and Intelligent Manufacturing, July 1-3 1998, Portland, Oregon, USA, pp. 215-226.
5. Ben-Daya, M. (1994) Solution methodologies for scheduling problems in flexible manufacturing systems. International Journal of Manufacturing Systems Design, 1(4), 315-328.
6. Blackstone, J. H., Phillips, D. T. and Hogg, G. L. (1982) A state-of-the-art survey of dispatching rules for manufacturing job shop operations. International Journal of Production Research, 20(1), 27-45.
7. Chambers, J. B. (1996) Classical and flexible job shop scheduling by Tabu search, Ph.D. Thesis, Operations Research and Industrial Engineering, The University of Texas at Austin.
8. Cheng, R., Gen, M. and Tsujimura, Y. (1996) A tutorial survey of job-shop scheduling problems using genetic algorithms-1, Representation. Computers and Industrial Engineering, 30(4), 983-997.
9. Dorndorf, U. and Pesch, E. (1995) Evolution based learning in a job shop scheduling environment. Complex Systems, 22, 25-40.
10. Fu, K. S. (1974) Syntactic Pattern Recognition, Academic Press, London.
11. Giffler, B. and Thompson, G. (1960) Algorithms for solving production scheduling problems. Operations Research, 8, 487-503.
12. Glover, F. (1990) Tabu search: a tutorial. Interfaces, 20, 74-94.
13. Jansen, K., Mastrolilli, M. and Solis-Oba, R. (2000) Approximation algorithms for flexible job shop problems. Proceedings of Latin American Theoretical Informatics (LATIN'2000), LNCS 1776, July 21, 2000, pp. 68-77.
14. Kusiak, A. (1990) Intelligent Manufacturing Systems, Prentice Hall, U.S.A.
15. Kusiak, A., Chen, M. (1988) Expert systems for planning and scheduling manufacturing systems. European Journal of Operational Research, 34, 113-130.
16. Mastrolilli, M. and Gambardella, L. M. (2000) Effective neighborhood functions for the flexible job shop problem. Journal of Scheduling, 3(1), 3-20.
17. Maturana, F., Gu, P., Naumann, A. and Norrie, D. H. (1997) Object oriented job-shop scheduling using genetic algorithms. Computers in Industry, 32, 281-294.
18. Mesghouni, K., Hammadi, S. and Borne, P. (1998) On modelling genetic algorithms for flexible job-shop scheduling problems. Studies in Informatics and Control, 7(1).
19. Pinedo, M. (1995) Scheduling: Theory, Algorithms, and Systems, Prentice-Hall, New Jersey.
20. Sönmez, A. I. and Baykasoglu, A. (1998) A new dynamic programming formulation of (n*m) flowshop sequencing problems with due dates. International Journal of Production Research, 36(8), 2269-2283.
21. Upton, D. M. and Barash, M. M. (1988) A grammatical approach to routing flexibility in large manufacturing systems. Journal of Manufacturing Systems, 7(3), 209-221.
22. Van Laarhoven, P. J. M., Aarts, E. H. L. and Lenstra, J. K. (1992) Job shop scheduling by simulated annealing. Operations Research, 40, 113-125.