메뉴 건너뛰기




Volumn , Issue , 2014, Pages 618-625

Evolving machine-specific dispatching rules for a two-machine job shop using genetic programming

Author keywords

[No Author keywords available]

Indexed keywords

CUSTOMER SATISFACTION; GENETIC ALGORITHMS; GENETIC PROGRAMMING;

EID: 84908568818     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2014.6900655     Document Type: Conference Paper
Times cited : (17)

References (20)
  • 3
    • 0030212629 scopus 로고    scopus 로고
    • The job shop scheduling problem: Conventional and new solution techniques
    • J. Blazewicz, W. Domschke, and E. Pesch, "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, vol. 93, no. 1, pp. 1-33, 1996.
    • (1996) European Journal of Operational Research , vol.93 , Issue.1 , pp. 1-33
    • Blazewicz, J.1    Domschke, W.2    Pesch, E.3
  • 6
    • 0040362439 scopus 로고
    • An extension of Johnson's result on job-lot scheduling
    • J. Jackson, "An extension of Johnson's result on job-lot scheduling," Naval Research Logistics Quarterly, vol. 3(3), pp. 201-204, 1956.
    • (1956) Naval Research Logistics Quarterly , vol.3 , Issue.3 , pp. 201-204
    • Jackson, J.1
  • 7
    • 30344458483 scopus 로고    scopus 로고
    • Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach
    • C. Geiger, R. Uzsoy, and H. Aytug, "Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach," Journal of Scheduling, vol. 9, no. 1, pp. 7-34, 2006.
    • (2006) Journal of Scheduling , vol.9 , Issue.1 , pp. 7-34
    • Geiger, C.1    Uzsoy, R.2    Aytug, H.3
  • 8
    • 84866872268 scopus 로고    scopus 로고
    • A coevolution genetic programming method to evolve scheduling policies for dynamic multi-objective job shop scheduling problems
    • S. Nguyen, M. Zhang, M. Johnston, and K. C. Tan, "A coevolution genetic programming method to evolve scheduling policies for dynamic multi-objective job shop scheduling problems," in Proceedings of the IEEE Congress on Evolutionary Computation, 2012, pp. 3332-3339.
    • (2012) Proceedings of the IEEE Congress on Evolutionary Computation , pp. 3332-3339
    • Nguyen, S.1    Zhang, M.2    Johnston, M.3    Tan, K.C.4
  • 10
    • 84863490088 scopus 로고    scopus 로고
    • Evolving priority scheduling heuristics with genetic programming
    • D. Jakobovíc and K. Marasovíc, "Evolving priority scheduling heuristics with genetic programming," Applied Soft Computing, vol. 12, no. 9, pp. 2781-2789, 2012.
    • (2012) Applied Soft Computing , vol.12 , Issue.9 , pp. 2781-2789
    • Jakobovíc, D.1    Marasovíc, K.2
  • 11
    • 38849162891 scopus 로고    scopus 로고
    • Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems
    • J. C. Tay and N. B. Ho, "Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems," Computer & Industrial Engineering, vol. 54, pp. 453-473, 2008.
    • (2008) Computer & Industrial Engineering , vol.54 , pp. 453-473
    • Tay, J.C.1    Ho, N.B.2
  • 12
    • 0003075019 scopus 로고
    • Optimal two-and three-stage production schedules with setup times included
    • S. Johnson, "Optimal two-and three-stage production schedules with setup times included," Naval Research Logistics Quarterly, vol. 1, pp. 61-68, 1954.
    • (1954) Naval Research Logistics Quarterly , vol.1 , pp. 61-68
    • Johnson, S.1
  • 15
    • 0023399009 scopus 로고
    • Priority rules for job shops with weighted tardiness costs
    • A. Vepsalainen and T. Morton, "Priority rules for job shops with weighted tardiness costs," Management Science, vol. 33, pp. 1035-1047, 1987.
    • (1987) Management Science , vol.33 , pp. 1035-1047
    • Vepsalainen, A.1    Morton, T.2


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