메뉴 건너뛰기




Volumn 56, Issue 3, 2003, Pages 513-533

Project scheduling with inventory constraints

Author keywords

Branch and bound; Inventories; Project scheduling; Temporal and resource constraints

Indexed keywords

HEURISTIC METHODS; INVENTORY CONTROL; PROJECT MANAGEMENT; SCHEDULING;

EID: 0036461438     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001860200251     Document Type: Article
Times cited : (70)

References (36)
  • 1
    • 84918379220 scopus 로고
    • A formal set of algorithms for project scheduling with critical path scheduling/materials requirements planning
    • Aquilano NJ, Smith DE (1980) A formal set of algorithms for project scheduling with critical path scheduling/materials requirements planning. Journal of Operations Management 1:57-67
    • (1980) Journal of Operations Management , vol.1 , pp. 57-67
    • Aquilano, N.J.1    Smith, D.E.2
  • 3
    • 18144452822 scopus 로고    scopus 로고
    • Project scheduling under partially renewable resource constraints
    • Böttcher J, Drexl A, Kolisch R, Salewski F (1999) Project scheduling under partially renewable resource constraints. Management Science 45:543-559
    • (1999) Management Science , vol.45 , pp. 543-559
    • Böttcher, J.1    Drexl, A.2    Kolisch, R.3    Salewski, F.4
  • 5
    • 0002907360 scopus 로고
    • A branch-and-bound procedure for the multiple resource-constrained project scheduling problem
    • Demeulemeester EL, Herroelen WS (1992) A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Management Science 38:1803-1818
    • (1992) Management Science , vol.38 , pp. 1803-1818
    • Demeulemeester, E.L.1    Herroelen, W.S.2
  • 6
    • 0031272722 scopus 로고    scopus 로고
    • New benchmark results for the resource-constrained project scheduling problem
    • Demeulemeester EL, Herroelen WS (1997) New benchmark results for the resource-constrained project scheduling problem. Management Science 43:1485-1492
    • (1997) Management Science , vol.43 , pp. 1485-1492
    • Demeulemeester, E.L.1    Herroelen, W.S.2
  • 7
    • 0032210246 scopus 로고    scopus 로고
    • A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
    • De Reyck B, Herroelen WS (1998) A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations. European Journal of Operational Research 111:152-174
    • (1998) European Journal of Operational Research , vol.111 , pp. 152-174
    • De Reyck, B.1    Herroelen, W.S.2
  • 9
    • 0017478425 scopus 로고
    • Scheduling a project to maximize its present value: A zero-one programming approach
    • Doersch RH, Patterson JH (1977) Scheduling a project to maximize its present value: a zero-one programming approach. Management Science 23:882-889
    • (1977) Management Science , vol.23 , pp. 882-889
    • Doersch, R.H.1    Patterson, J.H.2
  • 10
    • 0029635345 scopus 로고
    • Activity nets: A guided tour through some recent developments
    • Elmaghraby SE (1995) Activity nets: A guided tour through some recent developments. European Journal of Operational Research 82:383-408
    • (1995) European Journal of Operational Research , vol.82 , pp. 383-408
    • Elmaghraby, S.E.1
  • 11
    • 0001215033 scopus 로고
    • The analysis of activity networks under generalized precedence relations
    • Elmaghraby SE, Kamburowski J (1992) The analysis of activity networks under generalized precedence relations. Management Science 38:1245-1263
    • (1992) Management Science , vol.38 , pp. 1245-1263
    • Elmaghraby, S.E.1    Kamburowski, J.2
  • 12
    • 0012712572 scopus 로고    scopus 로고
    • A capacity-oriented hierarchical approach to single-item and small-batch production planning using project-scheduling methods
    • Franck B, Neumann K, Schwindt C (1997) A capacity-oriented hierarchical approach to single-item and small-batch production planning using project-scheduling methods. OR Spektrum 19:77-85
    • (1997) OR Spektrum , vol.19 , pp. 77-85
    • Franck, B.1    Neumann, K.2    Schwindt, C.3
  • 14
    • 0040577754 scopus 로고    scopus 로고
    • Project scheduling with multiple modes: A comparison of exact algorithms
    • Hartmann S, Drexl A (1998) Project scheduling with multiple modes: A comparison of exact algorithms. Networks 32:283-297
    • (1998) Networks , vol.32 , pp. 283-297
    • Hartmann, S.1    Drexl, A.2
  • 16
    • 0030262162 scopus 로고    scopus 로고
    • A branch and bound procedure for the resource constrained project scheduling problem with discounted cash flows
    • Icmeli O, Erengüç SS (1996) A branch and bound procedure for the resource constrained project scheduling problem with discounted cash flows. Management Science 42:1395-1408
    • (1996) Management Science , vol.42 , pp. 1395-1408
    • Icmeli, O.1    Erengüç, S.S.2
  • 17
    • 0033908629 scopus 로고    scopus 로고
    • Integrated scheduling, assembly area-, and part-assignment for large scale make-to-order assemblies
    • Kolisch R (2000) Integrated scheduling, assembly area-, and part-assignment for large scale make-to-order assemblies. International Journal of Production Economics 64:127-141
    • (2000) International Journal of Production Economics , vol.64 , pp. 127-141
    • Kolisch, R.1
  • 19
    • 0034627935 scopus 로고    scopus 로고
    • Efficient methods for scheduling make-to-order assemblies under resource, assembly area, and part availability constraints
    • Kolisch R, Heß K (2000) Efficient methods for scheduling make-to-order assemblies under resource, assembly area, and part availability constraints. International Journal of Production Research 38:207-228
    • (2000) International Journal of Production Research , vol.38 , pp. 207-228
    • Kolisch, R.1    Heß, K.2
  • 21
    • 0012670567 scopus 로고    scopus 로고
    • Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
    • Toledo
    • Laborie P (2001) Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results. In Proceedings of the 6th European Conference on Planning, Toledo, 205-216
    • (2001) Proceedings of the 6th European Conference on Planning , pp. 205-216
    • Laborie, P.1
  • 23
    • 0000497721 scopus 로고    scopus 로고
    • Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production
    • Neumann K, Schwindt C (1997) Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production. OR Spektrum 19:205-217
    • (1997) OR Spektrum , vol.19 , pp. 205-217
    • Neumann, K.1    Schwindt, C.2
  • 24
    • 0001681374 scopus 로고    scopus 로고
    • Methods for resource-constrained project scheduling with regular and nonregular objective functions and schedule-dependent time windows
    • Wȩglarz J (ed.) Kluwer, Boston
    • Neumann K, Zimmermann J (1999) Methods for resource-constrained project scheduling with regular and nonregular objective functions and schedule-dependent time windows. In: Wȩglarz J (ed.) Project Scheduling: Recent Models, Algorithms and Applications. Kluwer, Boston, 261-287
    • (1999) Project Scheduling: Recent Models, Algorithms and Applications , pp. 261-287
    • Neumann, K.1    Zimmermann, J.2
  • 26
    • 0029393209 scopus 로고
    • A survey on the resource-constrained project scheduling problem
    • Özdamar L, Ulusoy G (1995) A survey on the resource-constrained project scheduling problem. IEE Transactions 27:574-586
    • (1995) IEE Transactions , vol.27 , pp. 574-586
    • Özdamar, L.1    Ulusoy, G.2
  • 27
    • 0000480311 scopus 로고
    • An algorithm for a general class of precedence and resource constrained scheduling problems
    • Słowiński R, Wȩglarz J (eds.). Elsevier, Amsterdam
    • Patterson JH, Słowiński R, Talbot FB, Wȩglarz J (1989) An algorithm for a general class of precedence and resource constrained scheduling problems. In: Słowiński R, Wȩglarz J (eds.) Advances in Project Scheduling. Elsevier, Amsterdam, 261-287
    • (1989) Advances in Project Scheduling , pp. 261-287
    • Patterson, J.H.1    Słowiński, R.2    Talbot, F.B.3    Wȩglarz, J.4
  • 30
    • 0001775820 scopus 로고    scopus 로고
    • Batch scheduling in process industries: An application of resource-constrained project scheduling
    • Schwindt C, Trautmann N (2000) Batch scheduling in process industries: An application of resource-constrained project scheduling. OR Spektrum 22:501-524
    • (2000) OR Spektrum , vol.22 , pp. 501-524
    • Schwindt, C.1    Trautmann, N.2
  • 32
    • 0000733012 scopus 로고
    • Constrained resource project scheduling subject to material constraints
    • Smith-Daniels DE, Aquilano NJ (1984) Constrained resource project scheduling subject to material constraints. Journal of Operations Management 4:369-387
    • (1984) Journal of Operations Management , vol.4 , pp. 369-387
    • Smith-Daniels, D.E.1    Aquilano, N.J.2
  • 33
    • 38249035744 scopus 로고
    • Maximizing the net present value of a project subject to materials and capital constraints
    • Smith-Daniels DE, Smith-Daniels VE (1987) Maximizing the net present value of a project subject to materials and capital constraints. Journal of Operations Management 7:33-45
    • (1987) Journal of Operations Management , vol.7 , pp. 33-45
    • Smith-Daniels, D.E.1    Smith-Daniels, V.E.2
  • 34
    • 0032096811 scopus 로고    scopus 로고
    • Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
    • Sprecher A, Drexl A (1998) Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm. European Journal of Operational Research 107:431-450
    • (1998) European Journal of Operational Research , vol.107 , pp. 431-450
    • Sprecher, A.1    Drexl, A.2


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