메뉴 건너뛰기




Volumn 29, Issue 5-6, 2006, Pages 564-576

A genetic algorithmic approach to multi-objective scheduling in a kanban-controlled flowshop with intermediate buffer and transport constraints

Author keywords

Dual blocking mechanisms; Flowshops; Genetic algorithm; Kanbans; Mean completion time of containers; Mean completion time of part types; Multiple objectives; Standard deviation of mean completion time of part types

Indexed keywords

BLOCKING MECHANISMS; FLOW-SHOPS; KANBANS; MEAN COMPLETION TIME; MEAN COMPLETION TIME OF CONTAINERS; MULTIPLE OBJECTIVES; STANDARD DEVIATION;

EID: 73649137542     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/BF02729110     Document Type: Article
Times cited : (3)

References (21)
  • 1
    • 0032141635 scopus 로고    scopus 로고
    • A multi-objective genetic local search algorithm and its application to flowshop scheduling
    • 10.1109/5326.704576
    • H Ishibuchi T Murata 1998 A multi-objective genetic local search algorithm and its application to flowshop scheduling IEEE Trans Syst Man Cybernetics Part C Appl Rev 28 392 403 10.1109/5326.704576
    • (1998) IEEE Trans Syst Man Cybernetics Part C Appl Rev , vol.28 , pp. 392-403
    • Ishibuchi, H.1    Murata, T.2
  • 3
    • 0037063773 scopus 로고    scopus 로고
    • The development of gradual-priority weighting approach for the multi-objective flowshop scheduling problem
    • DOI 10.1016/S0925-5273(02)00141-X, PII S092552730200141X
    • PC Chang JC Hsieh SG Lin 2002 The development of gradual priority weighting approach for the multi-objective flowshop scheduling problem Int J Prod Econ 79 171 183 10.1016/S0925-5273(02)00141-X (Pubitemid 35039849)
    • (2002) International Journal of Production Economics , vol.79 , Issue.3 , pp. 171-183
    • Chang, P.-C.1    Hsieh, J.-C.2    Lin, S.-G.3
  • 4
    • 0038273913 scopus 로고    scopus 로고
    • Balance between genetic search and local search in memetic algorithms for multi-objective permutation flowshop scheduling
    • 10.1109/TEVC.2003.810752
    • H Ishibuchi T Yoshida T Murata 2003 Balance between genetic search and local search in memetic algorithms for multi-objective permutation flowshop scheduling IEEE Trans Evol Comput 7 204 223 10.1109/TEVC.2003.810752
    • (2003) IEEE Trans Evol Comput , vol.7 , pp. 204-223
    • Ishibuchi, H.1    Yoshida, T.2    Murata, T.3
  • 5
    • 0016952078 scopus 로고
    • The complexity of flow-shop and job-shop scheduling
    • 0396.90041 418895
    • MR Garey DS Johnson R Sethi 1976 The complexity of flow-shop and job-shop scheduling Math Oper Res 1 117 129 0396.90041 418895
    • (1976) Math Oper Res , vol.1 , pp. 117-129
    • Garey, M.R.1    Johnson, D.S.2    Sethi, R.3
  • 6
    • 0030134958 scopus 로고    scopus 로고
    • A survey of machine scheduling problems with blocking and no-wait in process
    • 0864.90060 1677545 10.1287/opre.44.3.510
    • NG Hall C Sriskandarajah 1996 A survey of machine scheduling problems with blocking and no-wait in process Oper Res 44 510 525 0864.90060 1677545 10.1287/opre.44.3.510
    • (1996) Oper Res , vol.44 , pp. 510-525
    • Hall, N.G.1    Sriskandarajah, C.2
  • 7
    • 84976662527 scopus 로고
    • Flowshop scheduling with limited temporary storage
    • 0475.68014 10.1145/322203.322213 581983
    • C Papadimitriou P Kanellakis 1980 Flowshop scheduling with limited temporary storage J ACM 27 533 549 0475.68014 10.1145/322203.322213 581983
    • (1980) J ACM , vol.27 , pp. 533-549
    • Papadimitriou, C.1    Kanellakis, P.2
  • 8
    • 0001057408 scopus 로고
    • Flowshop sequencing problems with limited buffer storage
    • 0707.90054 10.1080/00207549008942855
    • R Leisten 1990 Flowshop sequencing problems with limited buffer storage Int J Prod Res 28 2085 2100 0707.90054 10.1080/00207549008942855
    • (1990) Int J Prod Res , vol.28 , pp. 2085-2100
    • Leisten, R.1
  • 9
    • 84986958388 scopus 로고
    • A review of the Kanban production control research literature
    • BJ Berkley 1992 A review of the Kanban production control research literature Prod Oper Manage 1 393 411
    • (1992) Prod Oper Manage , vol.1 , pp. 393-411
    • Berkley, B.J.1
  • 10
    • 0034430625 scopus 로고    scopus 로고
    • Scheduling flowshops with limited buffer spaces
    • ISSN 0743-1902
    • Weng MX (2000) Scheduling flowshops with limited buffer spaces. In: Proceedings of the Winter Simulation Conference, pp 1359-1363, ISSN 0743-1902, www.direct.bl.uk
    • (2000) Proceedings of the Winter Simulation Conference , pp. 1359-1363
    • Weng, M.X.1
  • 11
    • 1442305305 scopus 로고    scopus 로고
    • Flowshop problems with intermediate buffers
    • 1042.90016 10.1007/s00291-003-0133-7 2020136
    • P Brucker S Heitmann JL Hurink 2003 Flowshop problems with intermediate buffers OR Spectrum 25 549 574 1042.90016 10.1007/s00291-003-0133-7 2020136
    • (2003) OR Spectrum , vol.25 , pp. 549-574
    • Brucker, P.1    Heitmann, S.2    Hurink, J.L.3
  • 13
    • 0034691895 scopus 로고    scopus 로고
    • Determination of the number of containers, production kanbans and withdrawal kanbans; and scheduling in kanban flowshops - Part 1
    • DOI 10.1080/00207540050031904
    • B Hemamalini C Rajendran 2000 Determination of the number of containers, production Kanbans and withdrawal Kanbans; and scheduling in Kanban flowshops - part 1 Int J Prod Res 38 2529 2548 0961.90034 10.1080/00207540050031904 (Pubitemid 35401840)
    • (2000) International Journal of Production Research , vol.38 , Issue.11 , pp. 2529-2548
    • Hemamalini, B.1    Rajendran, C.2
  • 14
    • 0030401255 scopus 로고    scopus 로고
    • A simulation study of container size in two-card Kanban system
    • 0919.90069 10.1080/00207549608905098
    • BJ Berkley 1996 A simulation study of container size in two-card Kanban system Int J Prod Res 34 3417 3445 0919.90069 10.1080/00207549608905098
    • (1996) Int J Prod Res , vol.34 , pp. 3417-3445
    • Berkley, B.J.1
  • 15
    • 0029734386 scopus 로고    scopus 로고
    • Simultaneously determining the number of Kanbans, container sizes and the final-assembly sequence of products in a just-in-time shop
    • 0923.90079 10.1080/00207549608904891
    • PR Philipoom LP Rees BW Taylor 1996 Simultaneously determining the number of Kanbans, container sizes and the final-assembly sequence of products in a just-in-time shop Int J Prod Res 34 51 69 0923.90079 10.1080/00207549608904891
    • (1996) Int J Prod Res , vol.34 , pp. 51-69
    • Philipoom, P.R.1    Rees, L.P.2    Taylor, B.W.3
  • 16
    • 0031332898 scopus 로고    scopus 로고
    • Heuristics for scheduling in a Kanban system with dual blocking mechanisms
    • 0921.90083 10.1016/S0377-2217(96)00276-7
    • B Sharadapriyadarshini C Rajendran 1997 Heuristics for scheduling in a Kanban system with dual blocking mechanisms Eur J Oper Res 103 439 452 0921.90083 10.1016/S0377-2217(96)00276-7
    • (1997) Eur J Oper Res , vol.103 , pp. 439-452
    • Sharadapriyadarshini, B.1    Rajendran, C.2
  • 17
    • 0033099220 scopus 로고    scopus 로고
    • Formulations and heuristics for scheduling in a Kanban flowshop to minimize the sum of weighted flowtime, weighted tardiness and weighted earliness of containers
    • 0951.90529 10.1080/002075499191445
    • C Rajendran 1999 Formulations and heuristics for scheduling in a Kanban flowshop to minimize the sum of weighted flowtime, weighted tardiness and weighted earliness of containers Int J Prod Res 37 1137 1158 0951.90529 10.1080/002075499191445
    • (1999) Int J Prod Res , vol.37 , pp. 1137-1158
    • Rajendran, C.1
  • 18
    • 0020699921 scopus 로고
    • A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
    • DOI 10.1016/0305-0483(83)90088-9
    • M Nawaz EE Enscore I Ham 1983 A heuristic algorithm for the m-machine, n-job flowshop sequencing problem OMEGA 11 91 95 10.1016/0305-0483(83)90088-9 (Pubitemid 13193807)
    • (1983) Omega , vol.11 , Issue.1 , pp. 91-95
    • Nawaz, M.1    Enscore Jr., E.E.2    Ham, I.3
  • 19
    • 0027542699 scopus 로고
    • Heuristic algorithm for scheduling in a flowshop to minimize total flowtime
    • DOI 10.1016/0925-5273(93)90024-F
    • C Rajendran 1993 Heuristic algorithm for scheduling in a flowshop to minimize total flowtime Int J Prod Econ 29 65 73 10.1016/0925-5273(93)90024-F (Pubitemid 23623618)
    • (1993) International Journal of Production Economics , vol.29 , Issue.1 , pp. 65-73
    • Rajendran, C.1
  • 21
    • 0027201278 scopus 로고
    • Benchmarks for basic scheduling problems
    • DOI 10.1016/0377-2217(93)90182-M
    • E Taillard 1993 Benchmarks for basic scheduling problems Eur J Oper Res 64 278 285 0769.90052 10.1016/0377-2217(93)90182-M (Pubitemid 23599340)
    • (1993) European Journal of Operational Research , vol.64 , Issue.2 , pp. 278-285
    • Taillard, E.1


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