메뉴 건너뛰기




Volumn 110, Issue 2, 1998, Pages 272-281

Simulated annealing for order spread minimization in sequencing cutting patterns

Author keywords

Cutting; Heuristics; Order spread minimization; Simulated annealing

Indexed keywords

COMPUTATIONAL COMPLEXITY; CUTTING; HEURISTIC METHODS; PRODUCTION CONTROL; SIMULATED ANNEALING;

EID: 0032188527     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00257-9     Document Type: Article
Times cited : (40)

References (11)
  • 2
    • 0025449198 scopus 로고
    • Simulated annealing: A tool for operational research
    • Eglese, R.W., 1990. Simulated annealing: A tool for operational research. European Journal of Operational Research 46, 271-281.
    • (1990) European Journal of Operational Research , vol.46 , pp. 271-281
    • Eglese, R.W.1
  • 3
    • 0000121045 scopus 로고
    • CUTGEN1: A problem generator for the one-dimensional cutting stock problem
    • Gau, T., Wäscher, G., 1995. CUTGEN1: A problem generator for the one-dimensional cutting stock problem. European Journal of Operational Research 84, 572-579.
    • (1995) European Journal of Operational Research , vol.84 , pp. 572-579
    • Gau, T.1    Wäscher, G.2
  • 4
    • 0001510482 scopus 로고
    • A linear programming approach to the cutting stock problem
    • Gilmore, P.C., Gomory, R.E., 1961. A linear programming approach to the cutting stock problem. Operations Research 9, 849-859.
    • (1961) Operations Research , vol.9 , pp. 849-859
    • Gilmore, P.C.1    Gomory, R.E.2
  • 5
    • 0043159382 scopus 로고
    • Cutting patterns and cutter schedules
    • Johnston, R.E., 1984. Cutting patterns and cutter schedules. ASOR Bulletin 4, 3-13.
    • (1984) ASOR Bulletin , vol.4 , pp. 3-13
    • Johnston, R.E.1
  • 6
    • 0023980558 scopus 로고
    • An application of travelling-salesman routines to solve pattern-allocation problems in the glass industry
    • Madsen, O.B.G., 1988. An application of travelling-salesman routines to solve pattern-allocation problems in the glass industry. Journal of the Operational Research Society 39, 249-256.
    • (1988) Journal of the Operational Research Society , vol.39 , pp. 249-256
    • Madsen, O.B.G.1
  • 7
    • 0025226303 scopus 로고
    • A one-dimensional cutting stock problem in the aluminium industry and its solution
    • Stadtler, H., 1990. A one-dimensional cutting stock problem in the aluminium industry and its solution. European Journal of Operational Research 44, 209-223.
    • (1990) European Journal of Operational Research , vol.44 , pp. 209-223
    • Stadtler, H.1
  • 8
    • 0000596106 scopus 로고    scopus 로고
    • Heuristics for the integer one-dimensional cutting stock problem - A computational study
    • Wäscher, G., Gau, T., 1996. Heuristics for the integer one-dimensional cutting stock problem - A computational study. Operations Research-Spektrum 18, 131-144.
    • (1996) Operations Research-spektrum , vol.18 , pp. 131-144
    • Wäscher, G.1    Gau, T.2
  • 10
    • 0029538201 scopus 로고
    • Improved heuristics for sequencing cutting patterns
    • Yuen, B.J., 1995. Improved heuristics for sequencing cutting patterns. European Journal of Operational Research 87, 57-64.
    • (1995) European Journal of Operational Research , vol.87 , pp. 57-64
    • Yuen, B.J.1
  • 11
    • 0000121044 scopus 로고
    • Establishing the optimality of sequencing heuristics for cutting stock problems
    • Yuen, B.J., Richardson, K.V., 1995. Establishing the optimality of sequencing heuristics for cutting stock problems. European Journal of Operational Research 84, 590-598.
    • (1995) European Journal of Operational Research , vol.84 , pp. 590-598
    • Yuen, B.J.1    Richardson, K.V.2


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