메뉴 건너뛰기




Volumn 23, Issue 9, 1996, Pages 897-907

A user interactive heuristic procedure for solving the multiple product cycling problem

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COSTS; HEURISTIC METHODS; MACHINERY; MATHEMATICAL MODELS; SCHEDULING; STORAGE (MATERIALS);

EID: 0030241532     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0548(95)00050-X     Document Type: Article
Times cited : (3)

References (12)
  • 1
    • 0347459799 scopus 로고
    • The capacitated dynamic lot-sizing problem with startup and reservation costs: A forward algorithm solution
    • R. A. Sandbothe, The capacitated dynamic lot-sizing problem with startup and reservation costs: a forward algorithm solution. J. Op. Mgmt. 10, 255-266 (1991).
    • (1991) J. Op. Mgmt. , vol.10 , pp. 255-266
    • Sandbothe, R.A.1
  • 3
    • 0023456043 scopus 로고
    • Solving multi-item lot-sizing problems using variable redefinition
    • G. D. Eppen and R. K. Martin, Solving multi-item lot-sizing problems using variable redefinition. Op. Res. 35,832-848 (1987).
    • (1987) Op. Res. , vol.35 , pp. 832-848
    • Eppen, G.D.1    Martin, R.K.2
  • 4
    • 0022022738 scopus 로고
    • The deterministic dynamic product cycling problem
    • U.S. Karmarkar and L. Schrage, The deterministic dynamic product cycling problem. Op. Res. 33, 326-345 (1985).
    • (1985) Op. Res. , vol.33 , pp. 326-345
    • Karmarkar, U.S.1    Schrage, L.2
  • 5
    • 0025446417 scopus 로고
    • Heuristic procedures for multi-item inventory planning with limited storage
    • P.S. Dixon and C.L. Poh, Heuristic procedures for multi-item inventory planning with limited storage. IIE Trans. 22, 112-123 (1990).
    • (1990) IIE Trans. , vol.22 , pp. 112-123
    • Dixon, P.S.1    Poh, C.L.2
  • 6
    • 0028769381 scopus 로고
    • Batching decisions: Structure and models
    • R. Kuik and M. Salomon, Batching decisions: structure and models. Eur. J. Op. Res. 75, 243-263 (1994).
    • (1994) Eur. J. Op. Res. , vol.75 , pp. 243-263
    • Kuik, R.1    Salomon, M.2
  • 7
    • 0025814466 scopus 로고
    • Solving multi-item lot-sizing problems using strong cutting planes
    • Y. Pochet and L.A. Wolsey, Solving multi-item lot-sizing problems using strong cutting planes. Mgmt. Sci. 37, 53-67 (1991).
    • (1991) Mgmt. Sci. , vol.37 , pp. 53-67
    • Pochet, Y.1    Wolsey, L.A.2
  • 8
    • 0023342273 scopus 로고
    • The dynamic lot-size problem with startup and reservation costs
    • U.S. Karmarkar, S. Kekre and S. Kekre, The dynamic lot-size problem with startup and reservation costs. Op. Res. 35, 389-398 (1987).
    • (1987) Op. Res. , vol.35 , pp. 389-398
    • Karmarkar, U.S.1    Kekre, S.2    Kekre, S.3
  • 10
    • 0019032810 scopus 로고
    • Deterministic Production Planning: Algorithms and complexity
    • M. Florian, J. K. Lenstra, and A. H. G. Rinnooy Kan, Deterministic Production Planning: algorithms and complexity. Mgmt. Sci. 26, 669-679 (1980).
    • (1980) Mgmt. Sci. , vol.26 , pp. 669-679
    • Florian, M.1    Lenstra, J.K.2    Rinnooy Kan, A.H.G.3
  • 12
    • 23744460780 scopus 로고
    • The scientific Press, Palo Alto, CA
    • L. Schrage, LINDO (3rd edn). The scientific Press, Palo Alto, CA (1986).
    • (1986) LINDO (3rd Edn)
    • Schrage, L.1


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