메뉴 건너뛰기




Volumn 42, Issue 1, 2004, Pages 21-36

Finding effective schedules for the economic lot scheduling problem: A simple mixed integer programming approach

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; INDUSTRIAL MANAGEMENT; INTEGER PROGRAMMING; INVENTORY CONTROL; MATHEMATICAL MODELS; PRODUCTION CONTROL; RESOURCE ALLOCATION;

EID: 1142268167     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207540310001595855     Document Type: Article
Times cited : (30)

References (16)
  • 1
    • 0000326705 scopus 로고
    • A dynamic programming approach to a lot size scheduling problem
    • Bomberger, E., 1966, A dynamic programming approach to a lot size scheduling problem. Management Science, 12, 778-784.
    • (1966) Management Science , vol.12 , pp. 778-784
    • Bomberger, E.1
  • 2
    • 26144442811 scopus 로고    scopus 로고
    • Economic lot sizing for a continuous process
    • Masters thesis, Faculty of Management, The University of Calgary, Calgary, Alberta
    • Cooke, D. L., 2001, Economic lot sizing for a continuous process. Masters thesis, Faculty of Management, The University of Calgary, Calgary, Alberta.
    • (2001)
    • Cooke, D.L.1
  • 3
    • 0000331249 scopus 로고
    • Scheduling economic lot size production runs
    • Davis, S. G., 1990, Scheduling economic lot size production runs. Management Science, 36, 985-998.
    • (1990) Management Science , vol.36 , pp. 985-998
    • Davis, S.G.1
  • 4
    • 0011790680 scopus 로고
    • An improved algorithm for solving the economic lot size problem
    • Davis, S. G., 1995, An improved algorithm for solving the economic lot size problem. International Journal of Production Research, 33, 1007-1026.
    • (1995) International Journal of Production Research , vol.33 , pp. 1007-1026
    • Davis, S.G.1
  • 5
    • 0023420909 scopus 로고
    • The economic lot-scheduling problem: Achieving feasibility using time-varying lot sizes
    • Dobson, G., 1987, The economic lot-scheduling problem: Achieving feasibility using time-varying lot sizes. Operations Research, 35, 764-771.
    • (1987) Operations Research , vol.35 , pp. 764-771
    • Dobson, G.1
  • 6
    • 0015669867 scopus 로고
    • An iterative procedure for the single-machine multi-product lot scheduling problem
    • Doll, C. L., and Whybark, D. C., 1973, An iterative procedure for the single-machine multi-product lot scheduling problem. Management Science, 20, 50-55.
    • (1973) Management Science , vol.20 , pp. 50-55
    • Doll, C.L.1    Whybark, D.C.2
  • 7
    • 0017931081 scopus 로고
    • The economic lot scheduling problem (ELSP): Review and extensions
    • Elmaghraby, S. E., 1978, The economic lot scheduling problem (ELSP): Review and extensions. Management Science, 24, 587-598.
    • (1978) Management Science , vol.24 , pp. 587-598
    • Elmaghraby, S.E.1
  • 9
    • 0018058202 scopus 로고
    • The application of marginal analysis to the economic lot scheduling problem
    • Fujita, S., 1978, The application of marginal analysis to the economic lot scheduling problem. AIIE Transactions, 10, 354-361.
    • (1978) AIIE Transactions , vol.10 , pp. 354-361
    • Fujita, S.1
  • 10
    • 0031161584 scopus 로고    scopus 로고
    • An optimal algorithm for the basic period approach to the economic lot scheduling problem
    • Grznar, J., and Riggle, C., 1997, An optimal algorithm for the basic period approach to the economic lot scheduling problem. Omega, 25, 355-364.
    • (1997) Omega , vol.25 , pp. 355-364
    • Grznar, J.1    Riggle, C.2
  • 11
    • 0018724120 scopus 로고
    • An improved extended basic period procedure for solving the economic lot-scheduling problem
    • Haessler, R. W., 1979, An improved extended basic period procedure for solving the economic lot-scheduling problem. AIIE Transactions, 11, 336-340.
    • (1979) AIIE Transactions , vol.11 , pp. 336-340
    • Haessler, R.W.1
  • 12
    • 0020587837 scopus 로고
    • On the general feasibility of scheduling lot sizes for several products on one machine
    • Hsu, W.-L., 1983, On the general feasibility of scheduling lot sizes for several products on one machine. Management Science, 29, 93-105.
    • (1983) Management Science , vol.29 , pp. 93-105
    • Hsu, W.-L.1
  • 13
    • 0032210383 scopus 로고    scopus 로고
    • The use of genetic algorithms to solve the economic lot size scheduling problem
    • Khouja, M., Michalewicz, Z., and Wilmot, M., 1998, The use of genetic algorithms to solve the economic lot size scheduling problem. European Journal of Operational Research, 110, 509-524.
    • (1998) European Journal of Operational Research , vol.110 , pp. 509-524
    • Khouja, M.1    Michalewicz, Z.2    Wilmot, M.3
  • 15
    • 0022150670 scopus 로고
    • Establishing consistent and realistic reorder intervals in production-distribution systems
    • Maxwell, W. L., and Muckstadt, J. A., 1985, Establishing consistent and realistic reorder intervals in production-distribution systems. Operations Research, 33, 1316-1341.
    • (1985) Operations Research , vol.33 , pp. 1316-1341
    • Maxwell, W.L.1    Muckstadt, J.A.2
  • 16
    • 0001343645 scopus 로고
    • Rounding to power-of-two in continuous relaxations of capacitated lot sizing problems
    • Roundy, R. O., 1989, Rounding to power-of-two in continuous relaxations of capacitated lot sizing problems. Management Science, 35, 1433-1442.
    • (1989) Management Science , vol.35 , pp. 1433-1442
    • Roundy, R.O.1


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