메뉴 건너뛰기




Volumn 29, Issue 1, 2010, Pages 29-34

Scheduling a single batch-processing machine with non-identical job sizes in fuzzy environment using an improved ant colony optimization

Author keywords

[No Author keywords available]

Indexed keywords

BATCH PROCESSING MACHINE; FUZZY ENVIRONMENTS; FUZZY MODELS; IMPROVED ANT COLONY OPTIMIZATION; JOB SIZE; MAKESPAN; METROPOLIS CRITERION; RANDOM INSTANCE;

EID: 77957706119     PISSN: 02786125     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jmsy.2010.06.007     Document Type: Article
Times cited : (47)

References (19)
  • 1
    • 0028461472 scopus 로고
    • Scheduling a single batch-processing machine with non-identical job sizes
    • R. Uzsoy Scheduling a single batch-processing machine with non-identical job sizes International Journal of Production Research 32 7 1994 1615 1635
    • (1994) International Journal of Production Research , vol.32 , Issue.7 , pp. 1615-1635
    • Uzsoy, R.1
  • 2
    • 0033908430 scopus 로고    scopus 로고
    • Minimizing makespan on a single burn-in oven in semiconductor manufacturing
    • C.S. Sung, and Y.I. Choung Minimizing makespan on a single burn-in oven in semiconductor manufacturing European Journal of Operational Research 120 3 2000 559 574
    • (2000) European Journal of Operational Research , vol.120 , Issue.3 , pp. 559-574
    • Sung, C.S.1    Choung, Y.I.2
  • 3
    • 0032141320 scopus 로고    scopus 로고
    • Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizes
    • PII S092552739800067X
    • F.J. Ghazvini, and L. Dupont Minimizing mean flow times criteria on a single batch processing machine with non-identical job sizes International Journal of Production Economics 55 1998 273 280 (Pubitemid 128410049)
    • (1998) International Journal of Production Economics , vol.55 , Issue.3 , pp. 273-280
    • Jolai Ghazvini, F.1    Dupont, L.2
  • 4
    • 0036604740 scopus 로고    scopus 로고
    • Minimizing the makespan on a batch machine with nonidentical job sizes: An exact procedure
    • L. Dupont, and C.D. Flipo Minimizing the makespan on a batch machine with nonidentical job sizes: an exact procedure Computers & Operations Research 29 7 2002 807 819
    • (2002) Computers & Operations Research , vol.29 , Issue.7 , pp. 807-819
    • Dupont, L.1    Flipo, C.D.2
  • 5
    • 0041742181 scopus 로고    scopus 로고
    • Genetic algorithms to minimize the weighted number of late jobs on a single machine
    • M. Sevaux, and S.D. Peres Genetic algorithms to minimize the weighted number of late jobs on a single machine European Journal of Operational Research 151 2 2003 296 306
    • (2003) European Journal of Operational Research , vol.151 , Issue.2 , pp. 296-306
    • Sevaux, M.1    Peres, S.D.2
  • 6
    • 33745799227 scopus 로고    scopus 로고
    • Minimizing makespan on a single batch-processing machine with non-identical job sizes: A hybrid genetic approach
    • Evolutionary computation in combinatorial optimization6th European conference, 2006, proceedings
    • A.H. Kashan, B. Karimi, and F. Jolai Minimizing makespan on a single batch-processing machine with non-identical job sizes: a hybrid genetic approach Evolutionary computation in combinatorial optimization6th European conference, 2006, proceedings Lecture notes in computer science vol. 3906 2006 35 146
    • (2006) Lecture Notes in Computer Science , vol.3906 , pp. 35-146
    • Kashan, A.H.1    Karimi, B.2    Jolai, F.3
  • 7
    • 33745817107 scopus 로고    scopus 로고
    • Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms
    • P. Damodaran, P.K. Manjeshwar, and K. Srihari Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms International Journal of Production Economics 103 2 2006 882 891
    • (2006) International Journal of Production Economics , vol.103 , Issue.2 , pp. 882-891
    • Damodaran, P.1    Manjeshwar, P.K.2    Srihari, K.3
  • 8
    • 0346148281 scopus 로고    scopus 로고
    • Minimizing makespan for single batch-processing machine with non-identical job sizes using simulated annealing
    • S. Melouk, P. Damodaran, and P.Y. Chang Minimizing makespan for single batch-processing machine with non-identical job sizes using simulated annealing International Journal of Production Economics 87 2 2004 141 147
    • (2004) International Journal of Production Economics , vol.87 , Issue.2 , pp. 141-147
    • Melouk, S.1    Damodaran, P.2    Chang, P.Y.3
  • 9
    • 0035312958 scopus 로고    scopus 로고
    • Minimizing makespan on a single batch processing machine with nonidentical job sizes
    • G. Zhang, X. Cai, C.Y. Lee, and C.K. Wang Minimizing makespan on a single batch processing machine with nonidentical job sizes Naval Research Logistics 48 3 2001 226 240
    • (2001) Naval Research Logistics , vol.48 , Issue.3 , pp. 226-240
    • Zhang, G.1    Cai, X.2    Lee, C.Y.3    Wang, C.K.4
  • 10
    • 67349191242 scopus 로고    scopus 로고
    • A Note on minimizing makespan on a single batch processing machine with nonidentical job sizes
    • A.H. Kashan, B. Karimi, and S.M.T. Fatemi Ghomi A Note on minimizing makespan on a single batch processing machine with nonidentical job sizes Theoretical Computer Science 410 2729 2009 2754 2758
    • (2009) Theoretical Computer Science , vol.410 , Issue.2729 , pp. 2754-2758
    • Kashan, A.H.1    Karimi, B.2    Fatemi Ghomi, S.M.T.3
  • 11
    • 9644265591 scopus 로고    scopus 로고
    • Minimizing makespan on a single batching machine with release times and non-identical job sizes
    • S. Li, G. Li, X. Wang, and Q. Liu Minimizing makespan on a single batching machine with release times and non-identical job sizes Operations Research Letters 33 2 2005 157 164
    • (2005) Operations Research Letters , vol.33 , Issue.2 , pp. 157-164
    • Li, S.1    Li, G.2    Wang, X.3    Liu, Q.4
  • 12
    • 0141859879 scopus 로고    scopus 로고
    • A fuzzy robust scheduling approach for product development projects
    • J. Wang A fuzzy robust scheduling approach for product development projects European Journal of Operational Research 152 1 2004 180 194
    • (2004) European Journal of Operational Research , vol.152 , Issue.1 , pp. 180-194
    • Wang, J.1
  • 13
    • 34548401538 scopus 로고    scopus 로고
    • A modified ant colony system for solving the travelling salesman problem with time windows
    • C.B. Cheng, and C.P. Mao A modified ant colony system for solving the travelling salesman problem with time windows Mathematical and Computer Modelling 46 9 2007 1225 1235
    • (2007) Mathematical and Computer Modelling , vol.46 , Issue.9 , pp. 1225-1235
    • Cheng, C.B.1    Mao, C.P.2
  • 15
    • 33845332680 scopus 로고    scopus 로고
    • An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
    • C.S. Liao, and H.C. Juan An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups Computers & Operations Research 34 7 2007 1899 1909
    • (2007) Computers & Operations Research , vol.34 , Issue.7 , pp. 1899-1909
    • Liao, C.S.1    Juan, H.C.2
  • 16
    • 34548613299 scopus 로고    scopus 로고
    • Ant colony optimization combined with taboo search for the job shop scheduling problem
    • K.L. Huang, and C.J. Liao Ant colony optimization combined with taboo search for the job shop scheduling problem Computers & Operations Research 35 4 2008 1030 1046
    • (2008) Computers & Operations Research , vol.35 , Issue.4 , pp. 1030-1046
    • Huang, K.L.1    Liao, C.J.2
  • 17
    • 9544220684 scopus 로고    scopus 로고
    • Beam-ACOhybridizing ant colony optimization with beam search: An application to open shop scheduling
    • C. Blum Beam-ACOhybridizing ant colony optimization with beam search: an application to open shop scheduling Computers & Operations Research 32 6 2005 1565 1591
    • (2005) Computers & Operations Research , vol.32 , Issue.6 , pp. 1565-1591
    • Blum, C.1
  • 18
    • 34247624966 scopus 로고    scopus 로고
    • Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimization method
    • A. Rossi, and G. Dini Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimization method Robotics and Computer-Integrated Manufacturing 23 5 2007 503 516
    • (2007) Robotics and Computer-Integrated Manufacturing , vol.23 , Issue.5 , pp. 503-516
    • Rossi, A.1    Dini, G.2
  • 19
    • 0037117664 scopus 로고    scopus 로고
    • The single machine ready time scheduling problem with fuzzy processing times
    • Chengyao Wang, Dingwei Wang, W.H. Ip, and D.W. Yuen The single machine ready time scheduling problem with fuzzy processing times Fuzzy Sets and Systems 127 2 2002 117 129
    • (2002) Fuzzy Sets and Systems , vol.127 , Issue.2 , pp. 117-129
    • Wang, C.1    Wang, D.2    Ip, W.H.3    Yuen, D.W.4


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