대한산업공학회지 (Journal of Korean Institute of Industrial Engineers)

  • 제43권1호
  • /
  • Pages.1-11
  • /
  • 2017
  • /
  • 1225-0988(pISSN)
  • /
  • 2234-6457(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지
DOI QR코드

DOI QR Code

확률적 자원제약 스케줄링 문제 해결을 위한 가변 이웃탐색 기반 동적 의사결정

Dynamic Decisions using Variable Neighborhood Search for Stochastic Resource-Constrained Project Scheduling Problem

  • 임동순 (한남대학교 산업경영공학과)
  • Yim, Dong Soon (Department of Industrial and Management Engineering, Hannam University)
  • 투고 : 2016.11.30
  • 심사 : 2017.01.24
  • 발행 : 2017.02.15
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Stochastic resource-constrained project scheduling problem is an extension of resource-constrained project scheduling problem such that activity duration has stochastic nature. In real situation where activity duration is not known until the activity is finished, open-loop based static policies such as activity-based policy and priority-based policy will not well cope with duration variability. Then, a dynamic policy based on closed-loop decision making will be regarded as an alternative toward achievement of minimal makespan. In this study, a dynamic policy designed to select activities to start at each decision time point is illustrated. The performance of static and dynamic policies based on variable neighborhood search is evaluated under the discrete-event simulation environment. Experiments with J120 sets in PSPLIB and several probability distributions of activity duration show that the dynamic policy is superior to static policies. Even when the variability is high, the dynamic policy provides stable and good solutions.

키워드

참고문헌

  1. Ballestin, F. and Leus, R. (2009), Resource-Constrained Project Scheduling for Timely Project Completion with Stochastic Activity Durations, Production and Operations Management, 18(4), 459-474. https://doi.org/10.1111/j.1937-5956.2009.01023.x
  2. Braysy, O. and Gendreau, M. (2005), Vehicle Routing Problem with Time Windows, Part I : Route Construction and Local Search Algorithms, Transportation Science, 39(1), 104-118. https://doi.org/10.1287/trsc.1030.0056
  3. Bruni, M. E., Beraldi, P., Guerriero, F., and Pinto, E. (2011), A Heuristic Approach for Resource Constrained Project Scheduling with Uncertain Activity Durations, Computers and Operations Research, 38(9), 1305-1318. https://doi.org/10.1016/j.cor.2010.12.004
  4. Fernandez, A. A., Armacost, R. L., and Pet-Edwards, J. J. (1998), Understanding Simulation Solutions to Resource Constrrained Project Scheduling Problems with Stochastic Task Duration, Engineering Management Journal, 10(4), 5-13.
  5. Fleszar, K. and Hindi, K. S. (2004), Solving the Resource-Constrained Project Scheduling Problem by a Variable Neighborhood Search, European Journal of Operations Research, 155(2), 402-413. https://doi.org/10.1016/S0377-2217(02)00884-6
  6. Graham, R. L. (1966), Bounds for Certain Multiprocessing Anomalies, Bell System Technical Journal, 45(9), 1563-1581. https://doi.org/10.1002/j.1538-7305.1966.tb01709.x
  7. Hansen, P., Mladenovic, N., and Perez, J. A. M. (2010), Variable Neighborhood Search : Methods and Applications, Annals of Operations Research, 175(1), 367-407. https://doi.org/10.1007/s10479-009-0657-6
  8. Kolisch, R. and Hartman, S. (2006), Experimental Investigation of Heuristics for Resource-Constrained Project Scheduling : An Update, European Journal of Operational Research, 174(1), 23-37. https://doi.org/10.1016/j.ejor.2005.01.065
  9. Kolisch, R. and Sprecher, A. (1996), PSPLIB-A project scheduling library, European Journal of Operational Research, 96(1), 205-216. https://doi.org/10.1016/S0377-2217(96)00170-1
  10. Li, H. and Womer, N. K. (2015), Solving Stochastic Resource-Constrained Project Scheduling Problems by Closed-Loop Approximate Dynamic Programming, European Journal of Operational Research, 246(1), 20-33. https://doi.org/10.1016/j.ejor.2015.04.015
  11. Li, K. Y. and Willis, R. J. (1992), An Iterative Scheduling Technique for Resource-Constrained Project Scheduling, European Journal of Operational Research, 56(3), 370-379. https://doi.org/10.1016/0377-2217(92)90320-9
  12. Li, S., Jia, Y., and Wang, J. (2012), A Discrete-Event Simulation Approach with Multiple-Comparison Procedure for Stochastic Resource-Constrained Project Scheduling, International Journal of Advanced Manufacturing Technology, 63(1), 65-76. https://doi.org/10.1007/s00170-011-3885-2
  13. Stork, F. (2001), Stochastic Resource-Constrained Project Scheduling, Ph. D. thesis, Technische Universitat Berlin.
  14. Tsai, Y.-W. and Gemmil, D. D. (1998), Using Tabu Search to Schedule Activities of Stochastic Resource-Constrained Projects, European Journal of Operational Research, 111(1), 129-141. https://doi.org/10.1016/S0377-2217(97)00311-1
  15. Tseng, L.-Y. and Chen, S.-C. (2006), A Hybrid Metaheuristic for the Resource-Constrained Project Scheduling Problem, European Journal of Operational Research, 175(2), 707-721. https://doi.org/10.1016/j.ejor.2005.06.014
  16. Valls, V., Ballestin, F., and Quintanilla, S. (2004), A Population-Based Approach to the Resource-Constrained Project Scheduling Problem, Annals of Operations Research, 131(1), 305-324. https://doi.org/10.1023/B:ANOR.0000039524.09792.c9
  17. Valls, V., Ballestin, F., and Quintanilla, S. (2008), A Hybrid Genetic Algorithm for the Resource-Constrained Project Scheduling Problem, European Journal of Operational Research, 185(2), 495-508. https://doi.org/10.1016/j.ejor.2006.12.033
  18. Yim, D. S. (2011), Performance Analysis of Local Optimization Algorithms in Resource-Constrained Project Scheduling Problem, Journal of the Korean Institute of Industrial Engineers, 37(4), 408-414. https://doi.org/10.7232/JKIIE.2011.37.4.408