메뉴 건너뛰기




Volumn , Issue , 2004, Pages 472-476

Equal size lot streaming to job-shop scheduling problem using genetic algorithms

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; COSTS; GENETIC ALGORITHMS; PROBLEM SOLVING; PROCESS CONTROL; PUBLIC POLICY; RELIABILITY; SCHEDULING;

EID: 20344394416     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (22)

References (12)
  • 1
    • 0031380485 scopus 로고    scopus 로고
    • A batch splitting heuristic for dynamic job shop scheduling problem
    • Woo S., Kang S. and Park J., A Batch Splitting Heuristic for Dynamic Job Shop Scheduling Problem, Comput. Ind. Eng., vol. 33, 1997, pp 781-784.
    • (1997) Comput. Ind. Eng. , vol.33 , pp. 781-784
    • Woo, S.1    Kang, S.2    Park, J.3
  • 2
    • 0033207931 scopus 로고    scopus 로고
    • A batch splitting method for a job shop scheduling problem in an MRP environment
    • Jeong H. I., Park J. and Leachman R. C., A Batch Splitting Method for a Job Shop Scheduling Problem in an MRP Environment, Int. J. Prod. Res., vol. 37, 1999, pp 3583-3598.
    • (1999) Int. J. Prod. Res. , vol.37 , pp. 3583-3598
    • Jeong, H.I.1    Park, J.2    Leachman, R.C.3
  • 3
    • 0013356811 scopus 로고    scopus 로고
    • A near-optimal heuristic for the sequencing problem in multiplebatch flow-shops with small equal sublots
    • Kalir A. A. and Sarin S. C., A Near-optimal Heuristic for the Sequencing Problem in Multiplebatch Flow-shops with Small Equal Sublots, Int. J. Manage. Sci., vol. 29, 2001, pp 577-584.
    • (2001) Int. J. Manage. Sci. , vol.29 , pp. 577-584
    • Kalir, A.A.1    Sarin, S.C.2
  • 4
    • 0033708147 scopus 로고    scopus 로고
    • Lot streaming and scheduling heuristics for m-machine no-wait flowshops
    • Kumar S., Bagchi T. P. and Sriskandarajah C., Lot Streaming and Scheduling Heuristics for m-machine No-wait Flowshops, Computers Ind. Eng., vol. 38, 2000, pp 149-172.
    • (2000) Computers Ind. Eng. , vol.38 , pp. 149-172
    • Kumar, S.1    Bagchi, T.P.2    Sriskandarajah, C.3
  • 5
    • 0036722525 scopus 로고    scopus 로고
    • An application of genetic algorithms to lot-streaming flow shop scheduling
    • Yoon S. H. and Ventura J. A., An Application of Genetic Algorithms to Lot-streaming Flow Shop Scheduling, HE Trans., vol. 34, 2002, pp 779-787.
    • (2002) HE Trans. , vol.34 , pp. 779-787
    • Yoon, S.H.1    Ventura, J.A.2
  • 6
    • 0000611941 scopus 로고
    • Basic techniques for lot streaming
    • Trietsch D. and Baker K. R., Basic Techniques for Lot Streaming, Ops. Res., vol. 6, 1993, pp 1065-1076.
    • (1993) Ops. Res. , vol.6 , pp. 1065-1076
    • Trietsch, D.1    Baker, K.R.2
  • 7
    • 0031186470 scopus 로고    scopus 로고
    • Lot streaming in job-shop scheduling
    • Dauzère-pérès S. and Lasserre J. B., Lot Streaming in Job-shop Scheduling. Ops. Res., vol. 45, 1997, pp 584-595.
    • (1997) Ops. Res. , vol.45 , pp. 584-595
    • Dauzère-Pérès, S.1    Lasserre, J.B.2
  • 9
    • 0032592184 scopus 로고    scopus 로고
    • A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: Hybrid genetic search strategies
    • Cheng R., Gen M. and Tsujimura Y., A Tutorial Survey of Job-shop Scheduling Problems Using Genetic Algorithms, Part II: Hybrid Genetic Search Strategies. Computers Ind. Eng., vol. 36, 1999, pp 343-364.
    • (1999) Computers Ind. Eng. , vol.36 , pp. 343-364
    • Cheng, R.1    Gen, M.2    Tsujimura, Y.3
  • 10
    • 0029224911 scopus 로고
    • A genetic algorithm for the job shop problem
    • Croce F. D., Tadei R. and Volta G., A Genetic Algorithm for the Job Shop Problem. Computers Ops. Res., vol. 22, 1995, pp 15-24.
    • (1995) Computers Ops. Res. , vol.22 , pp. 15-24
    • Croce, F.D.1    Tadei, R.2    Volta, G.3
  • 11
    • 0029722804 scopus 로고    scopus 로고
    • A genetic algorithm for job-shop scheduling problems using job-based order crossover
    • Nayoya, Japan
    • Ono I., Yamamura M. and Kobayashi S., "A Genetic Algorithm for Job-shop Scheduling Problems Using Job-based Order Crossover", in International Conference on Evolutionary Computation, Nayoya, Japan, 1996, pp 547-552.
    • (1996) International Conference on Evolutionary Computation , pp. 547-552
    • Ono, I.1    Yamamura, M.2    Kobayashi, S.3
  • 12
    • 0023977010 scopus 로고
    • The shifting bottleneck procedure for job shop scheduling
    • Adams J., Balas E. and Zawack D., The Shifting Bottleneck Procedure for Job Shop Scheduling. Manage. Sci., vol. 34, 1988, pp 391-401.
    • (1988) Manage. Sci. , vol.34 , pp. 391-401
    • Adams, J.1    Balas, E.2    Zawack, D.3


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