메뉴 건너뛰기




Volumn 7, Issue 5-6, 2005, Pages 581-593

Allocation of parts to cells, minimising tardiness and idle time by simulated annealing

Author keywords

Cellular manufacturing system; Common and special cells; Idle time; Simulated annealing; Tardiness

Indexed keywords

COMPUTATIONAL METHODS; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING; SIMULATED ANNEALING;

EID: 28844458415     PISSN: 13682148     EISSN: None     Source Type: Journal    
DOI: 10.1504/IJMTM.2005.007705     Document Type: Article
Times cited : (1)

References (26)
  • 1
    • 0000315146 scopus 로고
    • A survey of algorithms for single-machine total weighted tardiness scheduling problem
    • Abdul-Razaq, T.S., Potts, C.N. and Van Wassenhove, L.N.A. (1990) 'A survey of algorithms for single-machine total weighted tardiness scheduling problem', Discrete Applied Mathematics, Vol. 26, pp.235-253.
    • (1990) Discrete Applied Mathematics , vol.26 , pp. 235-253
    • Abdul-Razaq, T.S.1    Potts, C.N.2    Van Wassenhove, L.N.A.3
  • 2
    • 0032045130 scopus 로고    scopus 로고
    • A new lower bounding scheme for the total weighted tardiness problem
    • Arturk, S.M. and Yildrims, B.M. (1998) 'A new lower bounding scheme for the total weighted tardiness problem', Computers and Operation Research, Vol. 25, No. 4, pp.265-278.
    • (1998) Computers and Operation Research , vol.25 , Issue.4 , pp. 265-278
    • Arturk, S.M.1    Yildrims, B.M.2
  • 4
    • 0042904390 scopus 로고
    • Dominance and decomposition heuristics for single machine scheduling
    • Chambers, R.J., Carraway, R.L., Cowe, T.J. and Morin, T.L. (1991) 'Dominance and decomposition heuristics for single machine scheduling', Operations Research, Vol. 39, pp.639-647.
    • (1991) Operations Research , vol.39 , pp. 639-647
    • Chambers, R.J.1    Carraway, R.L.2    Cowe, T.J.3    Morin, T.L.4
  • 5
    • 0001636090 scopus 로고
    • A simulated annealing solution to the cell formation problem
    • Chen, C.L., Cotruvo, N.A. and Back, W. (1995) 'A simulated annealing solution to the cell formation problem', Int. Journal of Production Research, Vol. 33, No. 9, pp.2601-2614.
    • (1995) Int. Journal of Production Research , vol.33 , Issue.9 , pp. 2601-2614
    • Chen, C.L.1    Cotruvo, N.A.2    Back, W.3
  • 6
    • 0014535952 scopus 로고
    • One machine sequencing to minimize certain functions of job tardiness
    • Emmons, H. (1969) 'One machine sequencing to minimize certain functions of job tardiness', Operations Research, Vol. 17, pp.701-715
    • (1969) Operations Research , vol.17 , pp. 701-715
    • Emmons, H.1
  • 7
    • 0017240964 scopus 로고
    • Algorithm for one machine scheduling problem
    • Fisher, M.L.A. (1976) 'Algorithm for one machine scheduling problem', Mathematical Programming, Vol. 11, pp.229-251.
    • (1976) Mathematical Programming , vol.11 , pp. 229-251
    • Fisher, M.L.A.1
  • 10
    • 0043047871 scopus 로고    scopus 로고
    • Minimizing the number of tardy jobs in multi-period cell loading problems
    • Gursel, A.S. (1997) 'Minimizing the number of tardy jobs in multi-period cell loading problems', Computers and Industrial Engineering, Vol. 33, Nos. 3-4, pp.721-724.
    • (1997) Computers and Industrial Engineering , vol.33 , Issue.3-4 , pp. 721-724
    • Gursel, A.S.1
  • 11
    • 0029193149 scopus 로고
    • Stronger lagrangian bounds by use of slack variables application to machine scheduling problems
    • Hoogveen, J.A. and Van Develde, S.L. (1995) 'Stronger lagrangian bounds by use of slack variables application to machine scheduling problems', Mathematical Programming, Vol. 70, pp. 173-190.
    • (1995) Mathematical Programming , vol.70 , pp. 173-190
    • Hoogveen, J.A.1    Van Develde, S.L.2
  • 12
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • Kirkpatrick, S., Gelatt, C.D. and Vecchi, M.P. (1983) 'Optimization by simulated annealing', Science, Vol. 220, pp.671-680.
    • (1983) Science , vol.220 , pp. 671-680
    • Kirkpatrick, S.1    Gelatt, C.D.2    Vecchi, M.P.3
  • 13
    • 77957077792 scopus 로고    scopus 로고
    • Pseudo polynomial algorithms for sequencing jobs to minimize total tardiness
    • Lawler, E.L.A. (1997) 'Pseudo polynomial algorithms for sequencing jobs to minimize total tardiness', Annals of Discrete Mathematics, Vol. 1, pp.331-342.
    • (1997) Annals of Discrete Mathematics , vol.1 , pp. 331-342
    • Lawler, E.L.A.1
  • 14
    • 0043031168 scopus 로고
    • Complexity of single machine dual criteria scheduling with minimum number of tardy jobs
    • Industrial and Systems Engineering Department, University of Florida
    • Lee, C. and Rairaktarakis, G. (1992) 'Complexity of single machine dual criteria scheduling with minimum number of tardy jobs', Working paper, Industrial and Systems Engineering Department, University of Florida.
    • (1992) Working Paper
    • Lee, C.1    Rairaktarakis, G.2
  • 16
    • 0022023671 scopus 로고
    • Branch and bound algorithms for total weighted tardiness problem
    • Potts, C.N. and Van Wassenhove, L.N.A. (1985) 'Branch and bound algorithms for total weighted tardiness problem', Operations Research, Vol. 33, pp.363-377.
    • (1985) Operations Research , vol.33 , pp. 363-377
    • Potts, C.N.1    Van Wassenhove, L.N.A.2
  • 17
    • 0023565502 scopus 로고
    • Dynamic programming and decomposition approaches for the single machine total tardiness problem
    • Potts, C.N. and Van Wassenhove, L.N.A. (1987) 'Dynamic programming and decomposition approaches for the single machine total tardiness problem', European Journal of Operational Research, Vol. 32, pp.405-414.
    • (1987) European Journal of Operational Research , vol.32 , pp. 405-414
    • Potts, C.N.1    Van Wassenhove, L.N.A.2
  • 18
    • 0023341921 scopus 로고
    • Note: One weighted tardiness problem
    • Rachomadugu, R.M.V.A. (1987) 'Note: one weighted tardiness problem', Operations Research, Vol. 35, pp.450-452.
    • (1987) Operations Research , vol.35 , pp. 450-452
    • Rachomadugu, R.M.V.A.1
  • 21
    • 0020633499 scopus 로고
    • Scheduling n jobs on one machine to minimize the maximum tardiness with minimum number of tardy
    • Shanthikumar, J.G. (1983) 'Scheduling n jobs on one machine to minimize the maximum tardiness with minimum number of tardy', Computers and Operations Research, Vol. 10, No. 3, pp.255-266.
    • (1983) Computers and Operations Research , vol.10 , Issue.3 , pp. 255-266
    • Shanthikumar, J.G.1
  • 25
    • 0027592752 scopus 로고
    • Weighted tardiness single machine scheduling with proportional weights
    • Szwarc, W. and Liu, J.J. (1993) 'Weighted tardiness single machine scheduling with proportional weights', Management Science, Vol. 39, pp.626-632.
    • (1993) Management Science , vol.39 , pp. 626-632
    • Szwarc, W.1    Liu, J.J.2
  • 26
    • 0242265603 scopus 로고    scopus 로고
    • A simulated annealing algorithm for facility layout problems under variable demand in cellular manufacturing systems
    • Wang, T.Y., Wu, K.B. and Liu, Y.W. (2001) 'A simulated annealing algorithm for facility layout problems under variable demand in cellular manufacturing systems', Computers in Industry, Vol. 46, pp.181-188.
    • (2001) Computers in Industry , vol.46 , pp. 181-188
    • Wang, T.Y.1    Wu, K.B.2    Liu, Y.W.3


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