메뉴 건너뛰기




Volumn 41, Issue 7, 2003, Pages 1549-1563

Part allocation to nesting layouts under variable demand

Author keywords

[No Author keywords available]

Indexed keywords

CUTTING TOOLS; INVENTORY CONTROL; MATHEMATICAL MODELS; OPTIMIZATION; PRODUCTION CONTROL; RESOURCE ALLOCATION; SHEET METAL;

EID: 0242333144     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/1352816031000075017     Document Type: Article
Times cited : (8)

References (11)
  • 4
    • 0001510482 scopus 로고
    • A linear programming approach to the cutting-stock problem
    • GILMORE, P. E. and 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.E.1    Gomory, R.E.2
  • 5
    • 0001547020 scopus 로고
    • A heuristic programming solution to a nonlinear cutting stock problem
    • HAESSLER, R. W., 1971, A heuristic programming solution to a nonlinear cutting stock problem. Management Science, 17, 793-802.
    • (1971) Management Science , vol.17 , pp. 793-802
    • Haessler, R.W.1
  • 7
    • 0029636136 scopus 로고
    • Nesting planning based on production priorities and technical efficiency
    • MAIMON, O. and DAYAGI, A., 1995, Nesting planning based on production priorities and technical efficiency. European Journal of Operational Research, 80, 121-129.
    • (1995) European Journal of Operational Research , vol.80 , pp. 121-129
    • Maimon, O.1    Dayagi, A.2
  • 8
    • 0242328690 scopus 로고
    • Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem
    • TEGHEM, J., PIRLOT, M. and ANTONIADIS, C., 1995, Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem. Journal of Computational and Applied Mathematics, 64, 91-102.
    • (1995) Journal of Computational and Applied Mathematics , vol.64 , pp. 91-102
    • Teghem, J.1    Pirlot, M.2    Antoniadis, C.3
  • 9
    • 0034313855 scopus 로고    scopus 로고
    • Exact algorithm for minimising the number of setups in the one-dimensional cutting stock problem
    • VANDERBECK, F., 2000, Exact algorithm for minimising the number of setups in the one-dimensional cutting stock problem. Operations Research, 48, 915-926.
    • (2000) Operations Research , vol.48 , pp. 915-926
    • Vanderbeck, F.1
  • 10
    • 0027629757 scopus 로고
    • Best-first search methods for constrained two-dimensional cutting stock problems
    • VISWANATHAN, K. V. and BAGCHI, A., 1993, Best-first search methods for constrained two-dimensional cutting stock problems. Operations Research, 41, 768-776.
    • (1993) Operations Research , vol.41 , pp. 768-776
    • Viswanathan, K.V.1    Bagchi, A.2
  • 11
    • 0020748440 scopus 로고
    • Two algorithms for constrained two-dimensional cutting stock problems
    • WANG, P. Y., 1983, Two algorithms for constrained two-dimensional cutting stock problems. Operations Research, 31, 573-586.
    • (1983) Operations Research , vol.31 , pp. 573-586
    • Wang, P.Y.1


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