메뉴 건너뛰기




Volumn 38, Issue 17, 2000, Pages 4555-4564

A decision-making approach for nesting scheduling: A textile case

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; PROBLEM SOLVING; PROCESS ENGINEERING; PRODUCTION ENGINEERING; SCHEDULING; TEXTILE INDUSTRY;

EID: 0034694452     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540050205299     Document Type: Article
Times cited : (30)

References (15)
  • 1
    • 0030386923 scopus 로고    scopus 로고
    • Constraint network approach to the design and manufacture of labels in a high-variety label-printing environment
    • Awofala, A. O. and Singh, N., 1996, Constraint network approach to the design and manufacture of labels in a high-variety label-printing environment. Journal of Intelligent Manufacturing, 7, 499-514.
    • (1996) Journal of Intelligent Manufacturing , vol.7 , pp. 499-514
    • Awofala, A.O.1    Singh, N.2
  • 7
    • 0033132557 scopus 로고    scopus 로고
    • An application of simulated annealing to the cutting stock problem
    • Faina, L., 1999, An application of simulated annealing to the cutting stock problem. European Journal of Operational Research, 114, 542-556.
    • (1999) European Journal of Operational Research , vol.114 , pp. 542-556
    • Faina, L.1
  • 8
    • 0032143295 scopus 로고    scopus 로고
    • Computing closely matching upper and lower bounds on textile nesting problems
    • Heckman, R. and Lengauer, T., 1998, Computing closely matching upper and lower bounds on textile nesting problems. European Journal of Operational Research, 108, 473-489.
    • (1998) European Journal of Operational Research , vol.108 , pp. 473-489
    • Heckman, R.1    Lengauer, T.2
  • 9
    • 0031210357 scopus 로고    scopus 로고
    • An improvement of Viswanathan and Bagchi’s exact algorithm for constrained two-dimensional cutting stock
    • Hifi, M., 1997, An improvement of Viswanathan and Bagchi’s exact algorithm for constrained two-dimensional cutting stock. Computers & Operations Research, 24, 727-736.
    • (1997) Computers & Operations Research , vol.24 , pp. 727-736
    • Hifi, M.1
  • 11
    • 0011765001 scopus 로고    scopus 로고
    • Cutting stock problem: A heuristic solution based on operators’ intuitive strategies
    • Kopardekar, P. and Mital A., 1999, Cutting stock problem: a heuristic solution based on operators’ intuitive strategies. International Journal Computer Integrated Manufacturing, 12, 371-382.
    • (1999) International Journal Computer Integrated Manufacturing , vol.12 , pp. 371-382
    • Kopardekar, P.1    Mital, A.2
  • 12
    • 0029636136 scopus 로고
    • Nesting planning based on production priorities and technological efficiency
    • Maimon, O. and Dayagi, A., 1995, Nesting planning based on production priorities and technological 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
  • 15
    • 0027629757 scopus 로고
    • Best-first search methods for constrained twodimensional cutting stock problems
    • Viswanathan, K. V. and Bagchi, A., 1993, Best-first search methods for constrained twodimensional cutting stock problems. Operations Research, 41, 768-776.
    • (1993) Operations Research , vol.41 , pp. 768-776
    • Viswanathan, K.V.1    Bagchi, A.2


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