메뉴 건너뛰기




Volumn 45, Issue 16, 2007, Pages 3555-3577

Level schedules for mixed-model JIT production lines: Characteristics of the largest instances that can be solved optimally

Author keywords

Dynamic programming; Level schedules in just in time production; Sequencing mixed model production

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; PROBLEM SOLVING; SCHEDULING;

EID: 34547270476     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540701223394     Document Type: Article
Times cited : (20)

References (15)
  • 1
    • 0030571693 scopus 로고    scopus 로고
    • Heuristics and exact algorithms for solving the monden problem
    • Bautista, J., Companys, R. and Corominas, A., Heuristics and exact algorithms for solving the monden problem. Eur. J. Oper. Res., 1996, 88, 101-113.
    • (1996) Eur. J. Oper. Res , vol.88 , pp. 101-113
    • Bautista, J.1    Companys, R.2    Corominas, A.3
  • 2
    • 0030285453 scopus 로고    scopus 로고
    • Sequencing mixed-model assembly lines to minimise the weighted variations in just-in-time production systems
    • Cheng, L. and Ding, F., Sequencing mixed-model assembly lines to minimise the weighted variations in just-in-time production systems. IIE Trans., 1996, 28, 919-927.
    • (1996) IIE Trans , vol.28 , pp. 919-927
    • Cheng, L.1    Ding, F.2
  • 3
    • 0035295083 scopus 로고    scopus 로고
    • Sequencing JIT mixed-model assembly lines under station load- and part-usage constraints
    • Drexl, A. and Kimms, A., Sequencing JIT mixed-model assembly lines under station load- and part-usage constraints. Manage. Sci., 2001, 47, 480-491.
    • (2001) Manage. Sci , vol.47 , pp. 480-491
    • Drexl, A.1    Kimms, A.2
  • 4
    • 33646399781 scopus 로고    scopus 로고
    • Algorithms for the car sequencing and the level scheduling problem
    • Drexl, A., Kimms, A. and Matthiessen, L., Algorithms for the car sequencing and the level scheduling problem. J. Sched., 2006, 9, 153-176.
    • (2006) J. Sched , vol.9 , pp. 153-176
    • Drexl, A.1    Kimms, A.2    Matthiessen, L.3
  • 5
    • 0004102424 scopus 로고
    • Dow Jones-Irwin: Homewood, IL
    • Hall, R.W., Zero Inventories, 1983 (Dow Jones-Irwin: Homewood, IL).
    • (1983) Zero Inventories
    • Hall, R.W.1
  • 6
    • 9944236363 scopus 로고    scopus 로고
    • Sequencing problem for a mixed-model assembly line in the Toyota production system
    • Kotani, S., Ito, T. and Ohno, K., Sequencing problem for a mixed-model assembly line in the Toyota production system. Int. J. Prod. Res., 2004, 42(23), 4955-4974.
    • (2004) Int. J. Prod. Res , vol.42 , Issue.23 , pp. 4955-4974
    • Kotani, S.1    Ito, T.2    Ohno, K.3
  • 7
    • 2242443603 scopus 로고    scopus 로고
    • Optimal level schedules for mixed-model, multilevel just-in-time assembly systems
    • Kubiak, W., Steiner, G. and Yeomans, J.S., Optimal level schedules for mixed-model, multilevel just-in-time assembly systems. Ann. Oper. Res., 1997, 69, 241-259.
    • (1997) Ann. Oper. Res , vol.69 , pp. 241-259
    • Kubiak, W.1    Steiner, G.2    Yeomans, J.S.3
  • 8
    • 0013151718 scopus 로고
    • Efficient implementation of dynamic programming algorithms for sequencing problems
    • 106/79, Stichting Mathematish Centrum, 2e Boerhaavestraat 49, Amsterdam
    • Lawler, E.L., Efficient implementation of dynamic programming algorithms for sequencing problems. Report BW 106/79, Stichting Mathematish Centrum, 2e Boerhaavestraat 49, Amsterdam, 1979.
    • (1979) Report BW
    • Lawler, E.L.1
  • 9
    • 13544275547 scopus 로고    scopus 로고
    • A multi-objective genetic algorithm for mixed-model sequencing on JIT assembly lines
    • Mansouri, S.A., A multi-objective genetic algorithm for mixed-model sequencing on JIT assembly lines. Euro. J. Oper. Res., 2005, 167, 696-716.
    • (2005) Euro. J. Oper. Res , vol.167 , pp. 696-716
    • Mansouri, S.A.1
  • 10
    • 0035545592 scopus 로고    scopus 로고
    • An efficient frontier approach to addressing JIT sequencing problems with setups via search heuristics
    • McMullen, P.R., An efficient frontier approach to addressing JIT sequencing problems with setups via search heuristics. Comp. Indust. Eng., 2001, 41, 335-353.
    • (2001) Comp. Indust. Eng , vol.41 , pp. 335-353
    • McMullen, P.R.1
  • 11
    • 0001360372 scopus 로고
    • Level schedules for mixed-model assembly lines in just-in-time production systems
    • Miltenburg, J., Level schedules for mixed-model assembly lines in just-in-time production systems. Manage. Sci., 1989, 35(2), 192-207.
    • (1989) Manage. Sci , vol.35 , Issue.2 , pp. 192-207
    • Miltenburg, J.1
  • 12
    • 0024731470 scopus 로고
    • Scheduling mixed-model multi-level just-in-time production systems
    • Miltenburg, J. and Sinnamon, G., Scheduling mixed-model multi-level just-in-time production systems. Int. J. Prod. Res., 1989, 27(9), 1487-1509.
    • (1989) Int. J. Prod. Res , vol.27 , Issue.9 , pp. 1487-1509
    • Miltenburg, J.1    Sinnamon, G.2
  • 13
    • 0003449926 scopus 로고
    • 2nd ed, Industrial Engineering and Management Press, Institute of Industrial Engineers: Norcross, GA
    • Monden, Y., Toyota Production System, 2nd ed., 1993 (Industrial Engineering and Management Press, Institute of Industrial Engineers: Norcross, GA).
    • (1993) Toyota Production System
    • Monden, Y.1
  • 14
    • 30244535639 scopus 로고
    • Evaluating mixed-model assembly line sequencing heuristics for just-in-time production systems
    • Sumichrast, R.T. and Russell, R.S., Evaluating mixed-model assembly line sequencing heuristics for just-in-time production systems. J. Oper. Manage., 1990, 9(3), 371-390.
    • (1990) J. Oper. Manage , vol.9 , Issue.3 , pp. 371-390
    • Sumichrast, R.T.1    Russell, R.S.2


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