메뉴 건너뛰기




Volumn 47, Issue 11, 1996, Pages 1410-1414

A note on the relation between the product rate variation (PRV) problem and the apportionment problem

Author keywords

Apportionment problem; Scheduling

Indexed keywords

APPORTIONMENT PROBLEM; PRODUCT RATE VARIATION PROBLEM;

EID: 0030290247     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.1996.177     Document Type: Article
Times cited : (30)

References (24)
  • 1
    • 0003449926 scopus 로고
    • Institute of Industrial Engineers Press, Norcross, GA
    • Y. Monden (1983) Toyota Production System. Institute of Industrial Engineers Press, Norcross, GA.
    • (1983) Toyota Production System.
    • Monden, Y.1
  • 2
    • 0027595182 scopus 로고
    • Minimizing variations of production rates in just-in-time systems: A survey
    • W. Kubiak (1993) Minimizing variations of production rates in just-in-time systems: a survey. Eur. J. Opl Res. 66, 259-271.
    • (1993) Eur. J. Opl Res. , vol.66 , pp. 259-271
    • Kubiak, W.1
  • 3
    • 0024731470 scopus 로고
    • Scheduling mixed-model multi-level just-in-time production systems
    • J. G. Miltenburg AND G. Sinnamon
    • J. G. Miltenburg AND G. Sinnamon (1989) Scheduling mixed-model multi-level just-in-time production systems. Int. J. Prod. Res. 27, 1487-1509.
    • (1989) Int. J. Prod. Res. , vol.27 , pp. 1487-1509
  • 4
    • 84989692636 scopus 로고
    • Developing production schedules with balance part usage and smooth production loads for just-in-time production systems. Naval Res
    • J. G. Miltenburg and T. Goldstein (1991) Developing production schedules with balance part usage and smooth production loads for just-in-time production systems. Naval Res. Logist. 38, 893-910.
    • (1991) Logist. , vol.38 , pp. 893-910
    • Miltenburg, J.G.1    Goldstein, T.2
  • 6
    • 0030571693 scopus 로고
    • Heuristics and exact algorithms for solving the Monden problem
    • J. Bautista, R. Companys and A. Corominas (1993) Heuristics and exact algorithms for solving the Monden problem. Eur. J. OplRes. 88, 101-113.
    • (1993) Eur. J. Oplres. , vol.88 , pp. 101-113
    • Bautista, J.1    Companys, R.2    Corominas, A.3
  • 7
    • 0001360372 scopus 로고
    • Level schedules for mixed-model assembly lines in just-in-time production systems
    • J. G. MLTENBURG (1989) Level schedules for mixed-model assembly lines in just-in-time production systems. Mgmt Sci. 35, 192-207.
    • (1989) Mgmt Sci. , vol.35 , pp. 192-207
    • Mltenburg, J.G.1
  • 8
    • 0025251040 scopus 로고
    • A dynamic programming algorithm for scheduling mixed-model, just- in-time production systems
    • J. G. Miltenburg, G. Steiner and S. Yeomans (1990) A dynamic programming algorithm for scheduling mixed-model, just- in-time production systems. Mathl. Comput. Modelling. 13 (3), 51-66.
    • (1990) Mathl. Comput. Modelling. , vol.13 , Issue.3 , pp. 51-66
    • Miltenburg, J.G.1    Steiner, G.2    Yeomans, S.3
  • 9
    • 30244535639 scopus 로고
    • Evaluating mixed-model assembly line sequencing heuristics for just-in-time production systems
    • R. T. Sumichrast and R. S. Russell (1990) Evaluating mixed-model assembly line sequencing heuristics for just-in-time production systems. J. Opns Mgmt. 9, 371-390.
    • (1990) J. Opns Mgmt. , vol.9 , pp. 371-390
    • Sumichrast, R.T.1    Russell, R.S.2
  • 10
    • 0025868004 scopus 로고
    • A note on,‘Level schedules for mixed-model assembly lines in just-in-time production systems
    • W. Kublak and S. Sethi (1991) A note on,‘Level schedules for mixed-model assembly lines in just-in-time production systems. Mgmt. Sci. 37, 121-122.
    • (1991) Mgmt. Sci. , vol.37 , pp. 121-122
    • Kublak, W.1    Sethi, S.2
  • 11
    • 0001602291 scopus 로고
    • Sequencing JIT mixed-model assembly lines
    • R. R. INMAN and R. L. BULFIN (1991) Sequencing JIT mixed-model assembly lines. Mgmt Sci. 35, 901-904.
    • (1991) Mgmt Sci. , vol.35 , pp. 901-904
    • Inman, R.R.1    Bulfin, R.L.2
  • 13
    • 0027614669 scopus 로고
    • Level schedules for mixed-model just-in-time processes
    • G. Steiner and J. S. Yeomans (1993) Level schedules for mixed-model just-in-time processes. Mgmt Sci. 39, 728-735.
    • (1993) Mgmt Sci. , vol.39 , pp. 728-735
    • Steiner, G.1    Yeomans, J.S.2
  • 14
    • 0027543299 scopus 로고
    • A simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems
    • F. Y. Ding and L. Cheng (1993) A simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems. Opns Res. Letters. 13, 27-36.
    • (1993) Opns Res. Letters. , vol.13 , pp. 27-36
    • Ding, F.Y.1    Cheng, L.2
  • 15
    • 0027568670 scopus 로고
    • An effective mixed-model assembly lines sequencing heuristic for Just-In-Time production systems
    • F. Y. DING and L. CHENG (1993) An effective mixed-model assembly lines sequencing heuristic for Just-In-Time production systems. J. Opns Mgmt. 11, 45-50.
    • (1993) J. Opns Mgmt. , vol.11 , pp. 45-50
    • Ding, F.Y.1    Cheng, L.2
  • 17
    • 0028409837 scopus 로고
    • Optimal just-in-time schedules for flexible transfer lines
    • W. Kubiak and S. Sethi (1994) Optimal just-in-time schedules for flexible transfer lines. J. Flexible Manufacturing Systems. 6, 137-154.
    • (1994) J. Flexible Manufacturing Systems. , vol.6 , pp. 137-154
    • Kubiak, W.1    Sethi, S.2
  • 18
    • 0343206424 scopus 로고
    • A comment on ‘A simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems’
    • J. S. Yeomans (1994) A comment on ‘A simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems’. Opns Res. Letters. 16, 299-301.
    • (1994) Opns Res. Letters. , vol.16 , pp. 299-301
    • Yeomans, J.S.1
  • 21
    • 0005349605 scopus 로고
    • The Apportionment Problem
    • S. J. Brams, W. F. Lucas and P. D. Straffin Jr, Springer-Verlag, Berlin
    • W. F. Lucas (1978) The Apportionment Problem. In Political and Related Models. (S. J. Brams, W. F. Lucas and P. D. Straffin Jr, Eds) pp 358-396. Springer-Verlag, Berlin.
    • (1978) Political and Related Models. , pp. 358-396
    • Lucas, W.F.1
  • 23
    • 0020796531 scopus 로고
    • Apportining the United States House of Representatives
    • M. L. BALINSKI and H. P. Young (1983) Apportining the United States House of Representatives. Interfaces. 13 (4), 35-43.
    • (1983) Interfaces. , vol.13 , Issue.4 , pp. 35-43
    • Balinski, M.L.1    Young, H.P.2
  • 24
    • 0005384259 scopus 로고
    • A class of new methods for congressional apportionment. SIAM
    • J. W. Still (1979) A class of new methods for congressional apportionment. SIAM J. Applied Mathematics. 37, 401-418.
    • (1979) J. Applied Mathematics. , vol.37 , pp. 401-418
    • Still, J.W.1


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