| |
A fast greedy heuristic for scheduling modular projects
- 作者：Martijn Huysmans ; Kris Coolen ; Fabrice Talla Nobibon ; Roel Leus
- 关键词：Scheduling ; Greedy heuristics ; Modular projects
- 刊名：Journal of Heuristics
- 出版年：2015
- 出版时间：February 2015
- 年：2015
- 卷：21
- 期：1
- 页码：47-72
- 全文大小：556 KB
- 参考文献：1. Baldwin, C.Y., Clark, K.B.: Design Rules: The Power of Modularity. The MIT Press, Cambridge MA (2000)
2. Ben-Dov, Y.: A branch and bound algorithm for minimizing the expected cost of testing coherent systems. Eur. J. Oper. Res. 7(3), 284-89 (1981a) CrossRef
3. Ben-Dov, Y.: Optimal testing procedures for special structures of coherent systems. Manag. Sci. 27(12), 1410-420 (1981b) CrossRef
4. Birnbaum, Z.W.: On the importance of different components in a multi-component system. In: Krishnaiah, P.R. (ed.) Multivariate Analysis-II, vol. 1913, pp. 15-6. Academic Press, New York (1969)
5. Butterworth, R.W.: Some reliability fault-testing models. Oper. Res. 20(2), 335-43 (1972) CrossRef
6. Coolen, K., Wei, W., Talla Nobibon, F., Leus, R.: Project scheduling with modular project completion on a bottleneck resource. J. Sched. 17(1), 67-5 (2014) CrossRef
7. Creemers, S., De Reyck, B., Leus, R.: Project planning with alternative technologies in uncertain environments. Eur. J.Oper. Res. doi:10.1016/j.ejor.2014.11.014 (2014)
8. De, P., Dunne, E.J., Gosh, J.B., Wells, C.E.: The discrete time/cost trade-off problem revisited. Eur. J. Oper. Res. 81, 225-38 (1995) CrossRef
9. De Reyck, B., Demeulemeester, E.: Local search methods for the discrete time/resource trade-off problem in project networks. Naval Res. Logist. Q. 45, 553-78 (1998) CrossRef
10. De Reyck, B., Leus, R.: R&D-project scheduling when activities may fail. IIE Trans. 40(4), 367-84 (2008) CrossRef
11. Drexl, A.: Scheduling of project networks by job assignment. Manag. Sci. 37(12), 1590-602 (1991) CrossRef
12. Jain, V., Grossmann, I.E.: Resource-constrained scheduling of tests in new product development. Ind. Eng. Chem. Res. 38, 3013-026 (1999) CrossRef
13. J?drzejowicz, P.: Minimizing the average cost of testing coherent systems: complexity and approximate algorithms. IEEE Trans. Reliab. R-2(1), 67-0 (1983)
14. Mitten, L.G.: An analytic solution to the least cost testing sequence problem. J. Ind. Eng. 11(1), 17 (1960)
15. Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, New York (1994) CrossRef
16. Ranjbar, M., Davari, M.: An exact method for scheduling of the alternative technologies in R&D projects. Comput. Oper. Res. 40, 395-05 (2013) CrossRef
17. Runarsson, T.P., Yao, X.: Stochastic ranking for constrained evolutionary optimization. IEEE Trans. Evolut. Comput. 4(3), 284-94 (2000) CrossRef
18. Schmidt, C.W., Grossmann, I.E.: Optimization models for the scheduling of testing tasks in new product development. Ind. Eng. Chem. Res. 35, 3498-510 (1996) CrossRef
19. Talbot, F.B.: Resource-constrained project scheduling problem with time-resource trade-offs: the nonpreemptive case. Manag. Sci. - 刊物类别：Mathematics and Statistics
- 刊物主题：Mathematics
Operations Research and Mathematical Programming
Operation Research and Decision Theory
Artificial Intelligence and Robotics
Calculus of Variations and Optimal Control
- 出版者：Springer Netherlands
- ISSN：1572-9397
文摘
This article describes a heuristic for scheduling so-called ‘modular-projects. Exact solutions to this NP-hard problem can be obtained with existing branch-and-bound and dynamic-programming algorithms, but only for small to medium-size instances. The proposed heuristic, by contrast, can be used even for large instances, or when instances are particularly difficult because of their characteristics, such as a low network density. The proposed heuristic draws from existing results in the literature on sequential testing, which will be briefly reviewed. The performance of the heuristic is assessed over a dataset of 360 instances.
| |
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via email.
| |
