메뉴 건너뛰기




Volumn 44, Issue 5, 1998, Pages 698-713

Discrete lotsizing and scheduling by batch sequencing

Author keywords

Batch Sequencing; Branch and Bound Algorithm; Bounding Dominance Rules; Discrete Lotsizing and Scheduling; Sequence Dependent Setup Times and Setup Costs

Indexed keywords

ALGORITHMS; COST EFFECTIVENESS; INVENTORY CONTROL; PROBLEM SOLVING; PROCESS CONTROL; PRODUCTION CONTROL; SCHEDULING;

EID: 0032069649     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.44.5.698     Document Type: Article
Times cited : (41)

References (25)
  • 1
    • 0025208001 scopus 로고
    • Single Facility Multi-Class Job Scheduling
    • Ahn, B. H. and J. H. Hyun, "Single Facility Multi-Class Job Scheduling," Computers and Operations Res., 17 (1990), 265-272.
    • (1990) Computers and Operations Res. , vol.17 , pp. 265-272
    • Ahn, B.H.1    Hyun, J.H.2
  • 2
    • 0000612586 scopus 로고
    • Complexity of Task Sequencing with Deadlines, Setup-Times and Changeover Costs
    • Bruno, J. and P. Downey, "Complexity of Task Sequencing with Deadlines, Setup-Times and Changeover Costs," SIAM J. Computing, 7 (1978), 393-404.
    • (1978) SIAM J. Computing , vol.7 , pp. 393-404
    • Bruno, J.1    Downey, P.2
  • 4
    • 0027582974 scopus 로고
    • A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup-Times
    • Cattrysse, D., M. Salomon, R. Kuik, and L. N. van Wassenhove, "A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup-Times. Management Sci., 39 (1993), 477-486.
    • (1993) Management Sci. , vol.39 , pp. 477-486
    • Cattrysse, D.1    Salomon, M.2    Kuik, R.3    Van Wassenhove, L.N.4
  • 5
    • 0031170482 scopus 로고    scopus 로고
    • Lot Sizing and Scheduling: Survey and Extensions
    • Drexl, A. and A. Kimms, "Lot Sizing and Scheduling: Survey and Extensions," European J. Oper. Res., 99 (1997), 221-235.
    • (1997) European J. Oper. Res. , vol.99 , pp. 221-235
    • Drexl, A.1    Kimms, A.2
  • 6
    • 0001452629 scopus 로고
    • Technical Note: "An Optimal Algorithm for the Traveling Salesman Problem with Time Windows,"
    • Dumas, Y., J. Desrosiers, E. Gelinas, and M. M. Solomon, Technical Note: "An Optimal Algorithm for the Traveling Salesman Problem with Time Windows," Oper. Res., 43 (1995), 367-371.
    • (1995) Oper. Res. , vol.43 , pp. 367-371
    • Dumas, Y.1    Desrosiers, J.2    Gelinas, E.3    Solomon, M.M.4
  • 7
    • 0025384312 scopus 로고
    • The Discrete Lot-Sizing and Scheduling Problem
    • Fleischmann, B., "The Discrete Lot-Sizing and Scheduling Problem," European J. Oper. Res., 44 (1990), 337-348.
    • (1990) European J. Oper. Res. , vol.44 , pp. 337-348
    • Fleischmann, B.1
  • 8
    • 0028769382 scopus 로고
    • The Discrete Lot-Sizing and Scheduling Problem with Sequence-Dependent Setup-Costs
    • _, "The Discrete Lot-Sizing and Scheduling Problem with Sequence-Dependent Setup-Costs," European J. Oper. Res., 75 (1994), 395-404.
    • (1994) European J. Oper. Res. , vol.75 , pp. 395-404
  • 10
    • 0010775487 scopus 로고    scopus 로고
    • Capacitated Lot-Sizing with Sequence Dependent Setup Costs
    • Haase, K., "Capacitated Lot-Sizing with Sequence Dependent Setup Costs," OR Spektrum, 18 (1996), 51-59.
    • (1996) OR Spektrum , vol.18 , pp. 51-59
    • Haase, K.1
  • 12
    • 0039010038 scopus 로고    scopus 로고
    • Batching and Scheduling -Models and Methods for Several Problem Classes
    • Springer, Berlin
    • Jordan, C., Batching and Scheduling -Models and Methods for Several Problem Classes, Lecture Notes in Economics and Math. Systems No. 437, Springer, Berlin, 1996.
    • (1996) Lecture Notes in Economics and Math. Systems No. 437
    • Jordan, C.1
  • 14
    • 0015095281 scopus 로고
    • An Efficient Algorithm for Multi-Item Scheduling
    • Lasdon, L. S. and R. C. Terjung, "An Efficient Algorithm for Multi-Item Scheduling," Oper. Res., 19 (1971), 946-969.
    • (1971) Oper. Res. , vol.19 , pp. 946-969
    • Lasdon, L.S.1    Terjung, R.C.2
  • 15
    • 84989754383 scopus 로고
    • Minimizing Flow Time on a Single Machine with Job Classes and Setup Times
    • Mason, A. J. and E. J. Anderson, "Minimizing Flow Time on a Single Machine with Job Classes and Setup Times," Naval Res. Logistics, 38 (1991), 333-350.
    • (1991) Naval Res. Logistics , vol.38 , pp. 333-350
    • Mason, A.J.1    Anderson, E.J.2
  • 16
    • 0024736520 scopus 로고
    • On the Complexity of Scheduling with Batch Setup-Times
    • Monma, C. L. and C. N. Potts, "On the Complexity of Scheduling with Batch Setup-Times," Oper. Res., 37 (1989), 798-804.
    • (1989) Oper. Res. , vol.37 , pp. 798-804
    • Monma, C.L.1    Potts, C.N.2
  • 17
    • 84974861854 scopus 로고
    • Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
    • Potts, C. N. and L. N. van Wassenhove, "Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity," J. Oper. Res. Society, 43 (1992), 395-406.
    • (1992) J. Oper. Res. Society , vol.43 , pp. 395-406
    • Potts, C.N.1    Van Wassenhove, L.N.2
  • 18
    • 0000967878 scopus 로고
    • Some Extensions of the Discrete Lotsizing and Scheduling Problem
    • Salomon, M., L. G. Kroon, R. Kuik, and L. N. van Wassenhove, "Some Extensions of the Discrete Lotsizing and Scheduling Problem," Management Sci., 37 (1991), 801-812.
    • (1991) Management Sci. , vol.37 , pp. 801-812
    • Salomon, M.1    Kroon, L.G.2    Kuik, R.3    Van Wassenhove, L.N.4
  • 19
    • 0001532011 scopus 로고    scopus 로고
    • Solving the Discrete Lotsizing and Scheduling Problem with Sequence Dependent Set-up Costs and Set-up Times Using the Travelling Salesman Problem with Time Windows
    • _, M. M. Solomon, L. N. van Wassenhove, Y. D. Dumas, and S. Dauzere-Peres, "Solving the Discrete Lotsizing and Scheduling Problem with Sequence Dependent Set-up Costs and Set-up Times Using the Travelling Salesman Problem with Time Windows," European J. Oper. Res., 100 (1997), 494-513.
    • (1997) European J. Oper. Res. , vol.100 , pp. 494-513
    • Solomon, M.M.1    Van Wassenhove, L.N.2    Dumas, Y.D.3    Dauzere-Peres, S.4
  • 20
    • 0022132659 scopus 로고
    • Batching in Single Operation Manufacturing Systems
    • Santos, C. and M. Magazine, "Batching in Single Operation Manufacturing Systems," Oper. Res. Letters, 4 (1985), 99-103.
    • (1985) Oper. Res. Letters , vol.4 , pp. 99-103
    • Santos, C.1    Magazine, M.2
  • 21
    • 0030215229 scopus 로고    scopus 로고
    • Single-Machine Scheduling with Release Dates, Due Dates, and Family Setup Times
    • Schutten, J. M. J., S. L. van de Velde, and W. H. M. Zijm, "Single-Machine Scheduling with Release Dates, Due Dates, and Family Setup Times," Management Sci., 42 (1996), 1165-1174.
    • (1996) Management Sci. , vol.42 , pp. 1165-1174
    • Schutten, J.M.J.1    Van De Velde, S.L.2    Zijm, W.H.M.3
  • 22
    • 0002436722 scopus 로고
    • Batch Sequencing
    • Unal, A. and A. S. Kiran, "Batch Sequencing," IIE Trans., 24 (1992), 73-83.
    • (1992) IIE Trans. , vol.24 , pp. 73-83
    • Unal, A.1    Kiran, A.S.2
  • 23
    • 0027569358 scopus 로고
    • Batching and Sequencing of Components at a Single Facility
    • Vickson, R. G., M. Magazine, and C. Santos, "Batching and Sequencing of Components at a Single Facility," IIE Trans., 25 (1993), 65-70.
    • (1993) IIE Trans. , vol.25 , pp. 65-70
    • Vickson, R.G.1    Magazine, M.2    Santos, C.3
  • 24
    • 0001962762 scopus 로고
    • Dynamic Version of the Economic Lot Size Model
    • Wagner, H. M. and T. M. Whitin, "Dynamic Version of the Economic Lot Size Model," Management Sci., 5 (1958), 89-96.
    • (1958) Management Sci. , vol.5 , pp. 89-96
    • Wagner, H.M.1    Whitin, T.M.2
  • 25
    • 0029338650 scopus 로고
    • Scheduling Groups of Jobs on a Single Machine
    • Webster, S. and K. R. Baker, "Scheduling Groups of Jobs on a Single Machine," Oper. Res., 43 (1995), 692-704.
    • (1995) Oper. Res. , vol.43 , pp. 692-704
    • Webster, S.1    Baker, K.R.2


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