메뉴 건너뛰기




Volumn 3906 LNCS, Issue , 2006, Pages 135-146

Minimizing makespan on a single batch processing machine with non-identical job sizes: A hybrid genetic approach

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC PROGRAMMING; OPTIMIZATION; SIMULATED ANNEALING; WORK-REST SCHEDULES;

EID: 33745799227     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11730095_12     Document Type: Conference Paper
Times cited : (30)

References (8)
  • 1
    • 0028461472 scopus 로고
    • A single batch processing machine with non-identical job sizes
    • Uzsoy, R.: A single batch processing machine with non-identical job sizes. International Journal of Production Research. 32 (1994) 1615-1635
    • (1994) International Journal of Production Research , vol.32 , pp. 1615-1635
    • Uzsoy, R.1
  • 2
    • 0008350147 scopus 로고    scopus 로고
    • Minimizing makes pan on a single batch processing machine with non identical job sizes
    • Dupont, L., Jolai Ghazvini, F., Minimizing makes pan on a single batch processing machine with non identical job sizes. European journal of Automation Systems, 1998, 32, 431-440.
    • (1998) European Journal of Automation Systems , vol.32 , pp. 431-440
    • Dupont, L.1    Jolai Ghazvini, F.2
  • 3
    • 0032141320 scopus 로고    scopus 로고
    • Minimizing mean flow time on a single batch processing machine with non- Identical job size
    • Jolai Ghazvini, F., Dupont, L.: Minimizing mean flow time on a single batch processing machine with non- identical job size. International Journal of Production Economics. 55 (1998) 273-280.
    • (1998) International Journal of Production Economics , vol.55 , pp. 273-280
    • Jolai Ghazvini, F.1    Dupont, L.2
  • 4
    • 0036604740 scopus 로고    scopus 로고
    • Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
    • Dupont, L., Dhaenens-Flipo, C.: Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure. Computers & Operations Research. 29 (2002) 807-819.
    • (2002) Computers & Operations Research , vol.29 , pp. 807-819
    • Dupont, L.1    Dhaenens-Flipo, C.2
  • 5
    • 0346148281 scopus 로고    scopus 로고
    • Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing
    • Melouk, S., Damodaran, P., Chang, P.Y.: Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing. International Journal of Production Economics. 87 (2004) 141-147.
    • (2004) International Journal of Production Economics , vol.87 , pp. 141-147
    • Melouk, S.1    Damodaran, P.2    Chang, P.Y.3
  • 6
    • 9644265591 scopus 로고    scopus 로고
    • Minimizing makespan on a single batching machine with release times and non-identical job sizes
    • Shuguang, L., Guojun, L., Xiaoli, W., Qiming, L.: Minimizing makespan on a single batching machine with release times and non-identical job sizes. Operations Research Letter. 33 (2005) 157-164.
    • (2005) Operations Research Letter , vol.33 , pp. 157-164
    • Shuguang, L.1    Guojun, L.2    Xiaoli, W.3    Qiming, L.4
  • 7
    • 0001096735 scopus 로고
    • Genetic algorithms and random keys for sequencing and optimization
    • Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA Journal of Computing. 6 (1994) 154-160.
    • (1994) ORSA Journal of Computing , vol.6 , pp. 154-160
    • Bean, J.C.1
  • 8
    • 0036778940 scopus 로고    scopus 로고
    • A genetic algorithm to minimize maximum lateness on a batch processing machine
    • Wang, C., Uzsoy, R.: A genetic algorithm to minimize maximum lateness on a batch processing machine. Computers & Operations Research. 29 (2002) 1621-1640.
    • (2002) Computers & Operations Research , vol.29 , pp. 1621-1640
    • Wang, C.1    Uzsoy, R.2


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