메뉴 건너뛰기




Volumn 13, Issue 3, 2004, Pages 389-394

Scheduling algorithm for complex product development

Author keywords

Complex product development; Complicated constraint; Prediction; Scheduling algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; FORECASTING; HEURISTIC METHODS; PARAMETER ESTIMATION; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS); SCHEDULING; SET THEORY;

EID: 3242878115     PISSN: 10224653     EISSN: 20755597     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (1)

References (27)
  • 1
    • 0019342681 scopus 로고
    • Scheduling subject to resource constraints
    • J. Blazewica, et al., "Scheduling subject to resource constraints", Discrete Applied Mathematics, Vol.5, pp.11-24, 1983.
    • (1983) Discrete Applied Mathematics , vol.5 , pp. 11-24
    • Blazewica, J.1
  • 2
    • 0032736579 scopus 로고    scopus 로고
    • Resource-constrained project scheduling: Notation, classification, models, and methods
    • B. Peter, et al. "Resource-constrained Project scheduling: Notation, classification, models, and methods", European Journal of Operational Research, Vol.112, pp.3-41, 1999.
    • (1999) European Journal of Operational Research , vol.112 , pp. 3-41
    • Peter, B.1
  • 4
    • 0018011301 scopus 로고
    • Multiple resource-constrained scheduling using branch and bound
    • J.P. Stinson, et al., "Multiple resource-constrained scheduling using branch and bound", AIIE Transactions, Vol.10, pp.252-259, 1978.
    • (1978) AIIE Transactions , vol.10 , pp. 252-259
    • Stinson, J.P.1
  • 5
    • 0002907360 scopus 로고
    • A branch- and-bound procedure for the multiple resource- constrained project scheduling problem
    • E. Demeulemeester, W. Herroelen, "A branch- and-bound procedure for the multiple resource- constrained project scheduling problem", Management Science, Vol.38, pp.1803-1818, 1992.
    • (1992) Management Science , vol.38 , pp. 1803-1818
    • Demeulemeester, E.1    Herroelen, W.2
  • 6
    • 0031097802 scopus 로고    scopus 로고
    • A branch- and-bound procedure for the generalized resource-constrained project scheduling problem
    • E. Demeulemeester, W. Herroelen, "A branch- and-bound procedure for the generalized resource-constrained project scheduling problem", Operations Research, Vol.45, pp.201-212, 1997.
    • (1997) Operations Research , vol.45 , pp. 201-212
    • Demeulemeester, E.1    Herroelen, W.2
  • 7
    • 0035546606 scopus 로고    scopus 로고
    • A high-performance exact method for the resource-constrained project scheduling problem
    • M.R. Zamani, "A high-performance exact method for the resource-constrained project scheduling problem", Computers and Operations Research, Vol.28, pp.1387-1401, 2001.
    • (2001) Computers and Operations Research , vol.28 , pp. 1387-1401
    • Zamani, M.R.1
  • 8
    • 0016498438 scopus 로고
    • A comparison of heuristic and optimum solutions in resource-constrained project scheduling
    • E.W. Davis, J.H. Patterson, "A comparison of heuristic and optimum solutions in resource-constrained project scheduling", Management Science, Vol.21, pp.944-955, 1975.
    • (1975) Management Science , vol.21 , pp. 944-955
    • Davis, E.W.1    Patterson, J.H.2
  • 9
    • 84974870375 scopus 로고
    • Heuristic performance and network/resource characteristics in resource- Constrained project scheduling
    • G. Ulusoy, L. Özdamar, "Heuristic performance and network/resource characteristics in resource- constrained project scheduling", Journal of the Operational Research Society, Vol.40, pp.1145-1152, 1989.
    • (1989) Journal of the Operational Research Society , vol.40 , pp. 1145-1152
    • Ulusoy, G.1    Özdamar, L.2
  • 10
    • 0030231487 scopus 로고    scopus 로고
    • Efficient priority rules for the resource-constrained project scheduling problem
    • R. Kolisch, "Efficient priority rules for the resource-constrained project scheduling problem", Journal of Operations Management, Vol.14, pp. 172-192, 1996.
    • (1996) Journal of Operations Management , vol.14 , pp. 172-192
    • Kolisch, R.1
  • 11
    • 0004080973 scopus 로고    scopus 로고
    • Parameterized heuristics for project scheduling-Biased random sampling methods
    • Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel
    • A. Shirmer, S. Riesenberg, "Parameterized heuristics for project scheduling-Biased random sampling methods", Technical Report 456, Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel, 1997.
    • (1997) Technical Report 456 , vol.456
    • Shirmer, A.1    Riesenberg, S.2
  • 12
    • 0012364441 scopus 로고    scopus 로고
    • Project scheduling under resource constraints-efficient heuristics for several problem classes
    • Heidelberg, 1995
    • R. Kolisch, "Project scheduling under resource constraints-Efficient heuristics for several problem classes", Physica, Heidelberg, 1995.
    • Physica
    • Kolisch, R.1
  • 13
    • 0012765469 scopus 로고    scopus 로고
    • Adaptive control schemes for parameterized heuristic scheduling
    • Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel
    • A. Shirmer, "Adaptive control schemes for parameterized heuristic scheduling", Technical Report 488, Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel, 1998.
    • (1998) Technical Report 488 , vol.488
    • Shirmer, A.1
  • 14
    • 0035922493 scopus 로고    scopus 로고
    • A simple and effective heuristic for the resource constrained project scheduling problem
    • W.D. Gail, E.W. Gary, "A simple and effective heuristic for the resource constrained project scheduling problem", International Journal of Production Research, Vol.14, pp.3275-3287, 2001.
    • (2001) International Journal of Production Research , vol.14 , pp. 3275-3287
    • Gail, W.D.1    Gary, E.W.2
  • 15
    • 0030231464 scopus 로고    scopus 로고
    • An iterative local constraint based analysis for solving the resource constrained project scheduling problem
    • L. Özdamar, et al., "An iterative local constraint based analysis for solving the resource constrained project scheduling problem", Journal of Operations Management, Vol.14, pp.193-208, 1996.
    • (1996) Journal of Operations Management , vol.14 , pp. 193-208
    • Özdamar, L.1
  • 16
    • 0037508562 scopus 로고    scopus 로고
    • A new efficient simulated annealing algorithm for the resource- constrained project scheduling problem and its multiple mode version
    • K. Bouleimen, H. Lecocq, "A new efficient simulated annealing algorithm for the resource- constrained project scheduling problem and its multiple mode version", European Journal of Operational Research, Vol.149, pp.268-281, 2003.
    • (2003) European Journal of Operational Research , vol.149 , pp. 268-281
    • Bouleimen, K.1    Lecocq, H.2
  • 17
    • 0031188915 scopus 로고    scopus 로고
    • A simulated annealing algorithm for resource constrained project scheduling problems
    • J.H. Cho, Y.D. Kim, "A simulated annealing algorithm for resource constrained project scheduling problems", Journal of the Operational Research Society, Vol.48, pp.736-744, 1997.
    • (1997) Journal of the Operational Research Society , vol.48 , pp. 736-744
    • Cho, J.H.1    Kim, Y.D.2
  • 18
    • 0032210453 scopus 로고    scopus 로고
    • Using tabu search to schedule activities of stochastic resource- constrained projects
    • Y.W. Tsai, D.G. Douglas, "Using tabu search to schedule activities of stochastic resource- constrained projects", European Journal of Operational Research, Vol.111, pp.129-141, 1998.
    • (1998) European Journal of Operational Research , vol.111 , pp. 129-141
    • Tsai, Y.W.1    Douglas, D.G.2
  • 19
    • 84979597672 scopus 로고    scopus 로고
    • A new parallel breadth first tabu search technique for solving production planning problems
    • B. Stefan, R. Otto, "A new parallel breadth first tabu search technique for solving production planning problems", International Transactions in Operational Research, Vol.7, pp.625-635, 2000.
    • (2000) International Transactions in Operational Research , vol.7 , pp. 625-635
    • Stefan, B.1    Otto, R.2
  • 22
    • 0033349136 scopus 로고    scopus 로고
    • A genetic algorithm for minimizing the makespan in the case of scheduling parallel machines
    • M. Liu, C. Wu, "A genetic algorithm for minimizing the makespan in the case of scheduling parallel machines", Artificial Intelligence in Engineering, Vol.13, pp.399-403, 1999.
    • (1999) Artificial Intelligence in Engineering , vol.13 , pp. 399-403
    • Liu, M.1    Wu, C.2
  • 23
    • 0041691373 scopus 로고    scopus 로고
    • Scheduling algorithm based on evolutionary computing in identical parallel machine production line
    • M. Liu, C. Wu, "Scheduling algorithm based on evolutionary computing in identical parallel machine production line", Robotics and Computer Integrated Manufacturing, Vol.19, pp.401-407, 2003.
    • (2003) Robotics and Computer Integrated Manufacturing , vol.19 , pp. 401-407
    • Liu, M.1    Wu, C.2
  • 24
    • 1842843004 scopus 로고    scopus 로고
    • Genetic algorithm using sequence rule chain for multi-objective optimization in re-entrant micro-electronic production line
    • M. Liu, C. Wu, "Genetic algorithm using sequence rule chain for multi-objective optimization in re-entrant micro-electronic production line", Robotics and Computer Integrated Manufacturing, Vol.20, pp.225-236, 2004.
    • (2004) Robotics and Computer Integrated Manufacturing , vol.20 , pp. 225-236
    • Liu, M.1    Wu, C.2
  • 25
    • 0002866635 scopus 로고
    • The critical-path method: Resources planning and scheduling
    • Muth J. and G. Thompson (eds.), Prentice-Hall, New Jersey
    • J.E. Kelley, "The critical-path method: Resources planning and scheduling", Industrial scheduling, Muth J. and G. Thompson (eds.), Prentice-Hall, New Jersey, pp.347-365, 1963.
    • (1963) Industrial Scheduling , pp. 347-365
    • Kelley, J.E.1
  • 27
    • 0030121479 scopus 로고    scopus 로고
    • Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
    • R. Kolisch, "Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation", European Journal of Operational Research, Vol.90, pp.320-333 1996.
    • (1996) European Journal of Operational Research , vol.90 , pp. 320-333
    • Kolisch, R.1


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