메뉴 건너뛰기




Volumn 33, Issue 1, 2006, Pages 132-157

Comparative approaches to equipment scheduling in high volume factories

Author keywords

Benders decomposition; Equipment scheduling; Integer programming; LP based heuristic; Multi level lot sizing; Piece by piece decomposition; Postal operations

Indexed keywords

ALGORITHMS; BOUNDARY VALUE PROBLEMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; HEURISTIC METHODS; INTEGER PROGRAMMING; OPERATIONS RESEARCH; OPTIMIZATION; PERSONAL COMPUTERS; PROBLEM SOLVING; PRODUCTION CONTROL; SCHEDULING;

EID: 21444433839     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2004.07.003     Document Type: Article
Times cited : (5)

References (19)
  • 1
    • 0031070705 scopus 로고    scopus 로고
    • Scheduling workforce and workflow in a high volume factory
    • O. Berman, R.C. Larson, and E. Pinker Scheduling workforce and workflow in a high volume factory Management Science 43 2 1997 158 172
    • (1997) Management Science , vol.43 , Issue.2 , pp. 158-172
    • Berman, O.1    Larson, R.C.2    Pinker, E.3
  • 2
    • 0028479664 scopus 로고
    • Equipment selection and machine scheduling in general mail facilities
    • A.I.Z. Jarrah, J.F. Bard, and A.H. deSilva Equipment selection and machine scheduling in general mail facilities Management Science 40 8 1994 1049 1068
    • (1994) Management Science , vol.40 , Issue.8 , pp. 1049-1068
    • Jarrah, A.I.Z.1    Bard, J.F.2    Desilva, A.H.3
  • 4
  • 5
    • 0032093568 scopus 로고    scopus 로고
    • Scheduling of a multi-product batch process in the chemical industry
    • F. Blömer, and H. Günther Scheduling of a multi-product batch process in the chemical industry Computers in Industry 36 1998 245 259
    • (1998) Computers in Industry , vol.36 , pp. 245-259
    • Blömer, F.1    Günther, H.2
  • 9
    • 0028715377 scopus 로고
    • Polyhedra for lot sizing with Wagner-Whitin cost
    • Y. Pocket, and L.A. Wolsey Polyhedra for lot sizing with Wagner-Whitin cost Mathematical Programming 67 1994 297 324
    • (1994) Mathematical Programming , vol.67 , pp. 297-324
    • Pocket, Y.1    Wolsey, L.A.2
  • 10
    • 0036968625 scopus 로고    scopus 로고
    • Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation
    • L.A. Wolsey Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation Management Science 48 12 2002 1587 1602
    • (2002) Management Science , vol.48 , Issue.12 , pp. 1587-1602
    • Wolsey, L.A.1
  • 12
    • 0027348258 scopus 로고
    • Linear programming simulated annealing and tabu search heuristics for lot sizing in bottleneck assembly systems
    • R. Kuik, M. Salomon, L.N. van Wassenhove, and J. Maes Linear programming simulated annealing and tabu search heuristics for lot sizing in bottleneck assembly systems IEE Transactions on Design & Manufacturing 25 1 1993 62 72
    • (1993) IEE Transactions on Design & Manufacturing , vol.25 , Issue.1 , pp. 62-72
    • Kuik, R.1    Salomon, M.2    Van Wassenhove, L.N.3    Maes, J.4
  • 13
    • 0000857408 scopus 로고    scopus 로고
    • A Lagrangean-based heuristic for dynamic multi-level multi-item constrained lot sizing with setup times
    • H. Tempelmeier, and M. Derstroff A Lagrangean-based heuristic for dynamic multi-level multi-item constrained lot sizing with setup times Management Science 42 5 1996 738 757
    • (1996) Management Science , vol.42 , Issue.5 , pp. 738-757
    • Tempelmeier, H.1    Derstroff, M.2
  • 14
    • 0032179462 scopus 로고    scopus 로고
    • Lot-sizing with start-up times
    • F. Vanderbeck Lot-sizing with start-up times Management Science 44 10 1998 1409 1425
    • (1998) Management Science , vol.44 , Issue.10 , pp. 1409-1425
    • Vanderbeck, F.1
  • 17
    • 0000715666 scopus 로고
    • A modified benders partitioning algorithm for mixed integer programming
    • D. McDaniel, and M. Devine A modified benders partitioning algorithm for mixed integer programming Management Science 24 1977 312 379
    • (1977) Management Science , vol.24 , pp. 312-379
    • McDaniel, D.1    Devine, M.2
  • 18
    • 21444449624 scopus 로고    scopus 로고
    • Xpress-mosel: User guide
    • Englewood Cliffs, NJ: Prentice-Hall
    • Dash Optimization, Xpress-mosel: user guide. Englewood Cliffs, NJ: Prentice-Hall; 2002.
    • (2002) Dash Optimization
  • 19
    • 0019563706 scopus 로고
    • Preemptive scheduling of independent jobs with release and due times on open, flow and job shops
    • Y. Cho, and S. Sahni Preemptive scheduling of independent jobs with release and due times on open, flow and job shops Operations Research 29 3 1981 511 522
    • (1981) Operations Research , vol.29 , Issue.3 , pp. 511-522
    • Cho, Y.1    Sahni, S.2


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