메뉴 건너뛰기




Volumn , Issue , 2009, Pages 2516-2520

A framework model of production planning optimization for make-to-order discrete manufacturing

Author keywords

Discrete manufacturing; Make to order; Production planning optimization

Indexed keywords

COMPETITIVE EDGES; DISCRETE MANUFACTURING; ERP SYSTEM; FRAMEWORK MODELS; GLOBAL MARKET; IMPLEMENTATION SYSTEM; LOW LEVEL; MAKE-TO-ORDER; MANUFACTURING ENTERPRISE; PRODUCTION CAPACITY; PRODUCTION PLANNING; PRODUCTION PLANNING OPTIMIZATION; SYSTEM IMPLEMENTATION;

EID: 70449395699     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCDC.2009.5191920     Document Type: Conference Paper
Times cited : (2)

References (10)
  • 2
    • 0035254165 scopus 로고    scopus 로고
    • A study of simple rules for subcontracting in make-to-order manufacturing
    • Bertrand J.W.M. and V. Sridharan, A study of simple rules for subcontracting in make-to-order manufacturing, European Journal of Operational Research, v128, 509-531, 2001;
    • (2001) European Journal of Operational Research , vol.128 , pp. 509-531
    • Bertrand, J.W.M.1    Sridharan, V.2
  • 3
    • 17644423483 scopus 로고    scopus 로고
    • Controllability of switched bilinear systems
    • D. Z. Cheng, Controllability of switched bilinear systems, IEEE Trans. on Automatic Control, Vol. 50, No. 4, 511-515, 2005.
    • (2005) IEEE Trans. on Automatic Control , vol.50 , Issue.4 , pp. 511-515
    • Cheng, D.Z.1
  • 6
    • 0027658539 scopus 로고
    • Material management in decentralized supply chains
    • Lee, Hau L. and Corey Billington, Material management in decentralized supply chains, Operations Research, v41, n5, 835-847, 1993;
    • (1993) Operations Research , vol.41 , Issue.N5 , pp. 835-847
    • Lee, H.L.1    Billington, C.2
  • 7
    • 0037513522 scopus 로고    scopus 로고
    • Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem
    • Svetlana A. Kravchenko, Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem, Discrete Applied Mathematics, 98, 209-217, 2000;
    • (2000) Discrete Applied Mathematics , vol.98 , pp. 209-217
    • Kravchenko, S.A.1
  • 8
    • 34547699982 scopus 로고    scopus 로고
    • Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
    • Stavros G. Kolliopoulos, George Steiner, Approximation algorithms for scheduling problems with a modified total weighted tardiness objective, Operations Research Letters, 35, 685-692, 2007;
    • (2007) Operations Research Letters , vol.35 , pp. 685-692
    • Kolliopoulos, S.G.1    Steiner, G.2
  • 9
    • 33846084254 scopus 로고    scopus 로고
    • Simple heuristics for scheduling with limited intermediate storage
    • Andreas Witt, Stefan Voş, Simple heuristics for scheduling with limited intermediate storage, Computers & Operations Research, 34, 2293-2309, 2007;
    • (2007) Computers & Operations Research , vol.34 , pp. 2293-2309
    • Witt, A.1    Voş, S.2


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