메뉴 건너뛰기




Volumn 124, Issue 2, 2010, Pages 369-381

Analyzing the effect of dispatching rules on the scheduling performance through grammar based flexible scheduling system

Author keywords

Dispatching rules; Flexibility; Flexible job shop scheduling; Optimization

Indexed keywords

DISPATCHING RULES; FLEXIBLE JOB-SHOP SCHEDULING; FLEXIBLE SCHEDULING; JOB SHOP; MACHINE FLEXIBILITY; MEAN TARDINESS; PERFORMANCE CRITERION; PERFORMANCE VARIATIONS; SCHEDULING PERFORMANCE; SCHEDULING SYSTEMS;

EID: 76049094322     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2009.11.032     Document Type: Article
Times cited : (34)

References (29)
  • 1
    • 58049195659 scopus 로고    scopus 로고
    • Fuzzy multi-criteria decision model for evaluating reconfigurable machines
    • Abdi M.R. Fuzzy multi-criteria decision model for evaluating reconfigurable machines. International Journal of Production Economics 117 1 (2009) 1-15
    • (2009) International Journal of Production Economics , vol.117 , Issue.1 , pp. 1-15
    • Abdi, M.R.1
  • 3
    • 0037146442 scopus 로고    scopus 로고
    • Linguistic based meta-heuristic optimisation model for flexible job shop scheduling
    • Baykasoǧlu A. Linguistic based meta-heuristic optimisation model for flexible job shop scheduling. International Journal of Production Research 40 17 (2002) 4523-4543
    • (2002) International Journal of Production Research , vol.40 , Issue.17 , pp. 4523-4543
    • Baykasoǧlu, A.1
  • 4
    • 0033339759 scopus 로고    scopus 로고
    • A taboo search based approach to find the Pareto optimal set in multiple objective optimisation
    • Baykasoǧlu A., Owen S., and Gindy N. A taboo search based approach to find the Pareto optimal set in multiple objective optimisation. Journal of Engineering Optimization 31 (1999) 731-748
    • (1999) Journal of Engineering Optimization , vol.31 , pp. 731-748
    • Baykasoǧlu, A.1    Owen, S.2    Gindy, N.3
  • 5
    • 4944252227 scopus 로고    scopus 로고
    • Using multiple objective tabu search and grammars to model and solve multi-objective flexible job shop scheduling problems
    • Baykasoǧlu A., Özbaki{dotless}r L., and Sönmez A.I. Using multiple objective tabu search and grammars to model and solve multi-objective flexible job shop scheduling problems. Journal of Intelligent Manufacturing 15 6 (2004) 777-785
    • (2004) Journal of Intelligent Manufacturing , vol.15 , Issue.6 , pp. 777-785
    • Baykasoǧlu, A.1    Özbakir, L.2    Sönmez, A.I.3
  • 6
    • 0012552020 scopus 로고
    • Solution methodologies for scheduling problems in flexible manufacturing systems
    • Ben-Daya M. Solution methodologies for scheduling problems in flexible manufacturing systems. International Journal of Manufacturing System Design 1 4 (1994) 315-328
    • (1994) International Journal of Manufacturing System Design , vol.1 , Issue.4 , pp. 315-328
    • Ben-Daya, M.1
  • 8
    • 34250084648 scopus 로고
    • Routing and scheduling in a flexible job shop by tabu search
    • Brandimarte P. Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research 22 (1993) 158-183
    • (1993) Annals of Operations Research , vol.22 , pp. 158-183
    • Brandimarte, P.1
  • 9
    • 85047672999 scopus 로고    scopus 로고
    • Tabu search for the multi-mode job-shop problem
    • Brucker P., and Neyer J. Tabu search for the multi-mode job-shop problem. Operations Research Spektrum 20 (1997) 21-28
    • (1997) Operations Research Spektrum , vol.20 , pp. 21-28
    • Brucker, P.1    Neyer, J.2
  • 10
    • 33750497004 scopus 로고    scopus 로고
    • Tabu search for the flexible-routing job shop problem
    • Technical Report Series ORP96-10, Graduate Program in Operation Research and Industrial Engineering, The University of Texas, Austin
    • Chambers, J.B., Barnes, J.W., 1996a. Tabu search for the flexible-routing job shop problem. Technical Report Series ORP96-10, Graduate Program in Operation Research and Industrial Engineering, The University of Texas, Austin.
    • (1996)
    • Chambers, J.B.1    Barnes, J.W.2
  • 11
    • 0012645395 scopus 로고    scopus 로고
    • New tabu search results for the job shop scheduling problem
    • Technical Report Series ORP96-06, Graduate Program in Operation Research and Industrial Engineering, The University of Texas, Austin
    • Chambers, J.B., Barnes, J.W., 1996b. New tabu search results for the job shop scheduling problem. Technical Report Series ORP96-06, Graduate Program in Operation Research and Industrial Engineering, The University of Texas, Austin.
    • (1996)
    • Chambers, J.B.1    Barnes, J.W.2
  • 13
    • 0030242695 scopus 로고    scopus 로고
    • A tutorial survey of job-shop scheduling problems using genetic algorithms-1
    • Cheng R., Gen M., and Tsujimura Y. A tutorial survey of job-shop scheduling problems using genetic algorithms-1. Computers and Industrial Engineering 30 4 (1996) 983-997
    • (1996) Computers and Industrial Engineering , vol.30 , Issue.4 , pp. 983-997
    • Cheng, R.1    Gen, M.2    Tsujimura, Y.3
  • 14
    • 0029543116 scopus 로고
    • Scheduling complex flexible job shop problems
    • INRIA/IEEE, pp
    • El Maqrini, H., Teghem, J., 1995. Scheduling complex flexible job shop problems. In: Proceedings of the ETFA'95, INRIA/IEEE, pp. 541-549.
    • (1995) Proceedings of the ETFA'95 , pp. 541-549
    • El Maqrini, H.1    Teghem, J.2
  • 16
    • 34447289102 scopus 로고    scopus 로고
    • A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems
    • Gao J., Gen M., Sun L., and Zhao X. A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems. Computers and Industrial Engineering 53 (2007) 149-162
    • (2007) Computers and Industrial Engineering , vol.53 , pp. 149-162
    • Gao, J.1    Gen, M.2    Sun, L.3    Zhao, X.4
  • 17
    • 38749142590 scopus 로고    scopus 로고
    • A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
    • Gao J., Sun L., and Gen M. A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Computers and Operations Research 35 (2008) 2892-2907
    • (2008) Computers and Operations Research , vol.35 , pp. 2892-2907
    • Gao, J.1    Sun, L.2    Gen, M.3
  • 18
    • 0000131281 scopus 로고
    • Algorithms for solving production scheduling problems
    • Giffler B., and Thompson G. Algorithms for solving production scheduling problems. Operations Research 8 (1960) 487-503
    • (1960) Operations Research , vol.8 , pp. 487-503
    • Giffler, B.1    Thompson, G.2
  • 21
    • 0037201140 scopus 로고    scopus 로고
    • Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic
    • Kacem I., Hammadi S., and Borne P. Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Mathematics and Computers in Simulation 60 (2002) 245-276
    • (2002) Mathematics and Computers in Simulation , vol.60 , pp. 245-276
    • Kacem, I.1    Hammadi, S.2    Borne, P.3
  • 22
    • 0012501806 scopus 로고    scopus 로고
    • On modelling genetic algorithms for flexible job-shop scheduling problems
    • Mesghouni K., Hammadi S., and Borne P. On modelling genetic algorithms for flexible job-shop scheduling problems. Studies in Informatics and Control 7 1 (1998) 234-247
    • (1998) Studies in Informatics and Control , vol.7 , Issue.1 , pp. 234-247
    • Mesghouni, K.1    Hammadi, S.2    Borne, P.3
  • 25
    • 37049019469 scopus 로고    scopus 로고
    • Choquet integral for criteria aggregation in the flexible job-shop scheduling problems
    • Saad I., Hammadi S., Benrejeb M., and Borne P. Choquet integral for criteria aggregation in the flexible job-shop scheduling problems. Mathematics and Computers in Simulation 76 5-6 (2008) 447-462
    • (2008) Mathematics and Computers in Simulation , vol.76 , Issue.5-6 , pp. 447-462
    • Saad, I.1    Hammadi, S.2    Benrejeb, M.3    Borne, P.4
  • 26
    • 38249031740 scopus 로고
    • A grammatical approach to routing flexibility in large manufacturing systems
    • Upton D.M., and Barash M.M. A grammatical approach to routing flexibility in large manufacturing systems. Journal of Manufacturing Systems 7 3 (1988) 209-221
    • (1988) Journal of Manufacturing Systems , vol.7 , Issue.3 , pp. 209-221
    • Upton, D.M.1    Barash, M.M.2
  • 27
    • 43549120028 scopus 로고    scopus 로고
    • A dynamic approach to measure machine and routing flexibilities of manufacturing systems
    • Wahab M.I.M., and Stoyan S.J. A dynamic approach to measure machine and routing flexibilities of manufacturing systems. International Journal of Production Economics 113 2 (2008) 895-913
    • (2008) International Journal of Production Economics , vol.113 , Issue.2 , pp. 895-913
    • Wahab, M.I.M.1    Stoyan, S.J.2
  • 28
    • 14044268702 scopus 로고    scopus 로고
    • An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems
    • Xia W., and Wu Z. An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Computers and Industrial Engineering 48 (2005) 409-425
    • (2005) Computers and Industrial Engineering , vol.48 , pp. 409-425
    • Xia, W.1    Wu, Z.2
  • 29
    • 33747735942 scopus 로고    scopus 로고
    • Multistage-based genetic algorithm for flexible job shop scheduling problem
    • Zhang H., and Gen M. Multistage-based genetic algorithm for flexible job shop scheduling problem. Complexity International 11 (2005) 223-232
    • (2005) Complexity International , vol.11 , pp. 223-232
    • Zhang, H.1    Gen, M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.