Task scheduling of parallel development projects using genetic algorithms

Proceedings of the ASME Design Engineering Technical Conference

Volumn 1, Issue , 2004, Pages 215-223

  Zhuang, Miao ^a   Yassine, Ali A ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Design Structure Matrix (DSM); Genetic Algorithm (GA); Makespan; Resource Constrained Multi Project Scheduling Problem (RCMPSP)

Indexed keywords

COMPUTER SIMULATION; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; GENETIC ALGORITHMS; MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING; PRODUCT DESIGN; PROJECT MANAGEMENT; RESOURCE ALLOCATION;

DESIGN STRUCTURE MATRIX (DSM); GENETIC ENCODING; MAKESPAN; RESOURCE CONSTRAINED MULTI PROJECT SCHEDULING PROBLEM (RCMPSP);

SCHEDULING;

EID: 14044256646     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1115/detc2004-57159     Document Type: Conference Paper

References (21)

1. Davis, L. (1985). Job shop scheduling with genetic algorithms. Proceedings of the 1st international conference on genetic algorithms. Lawrence Erlbaum.
2. Demeulemeester, E., & Herroelen, W. (1992). A branch-and-bound procedure for the resource constrained project scheduling problem. Management Science, 38, 1803-1818.
3. Demeulemeester, E., & Herroelen, W. (1996). An efficient optimal solution procedure for resource constrained project scheduling problem. European Journal of Operational Research, 90, 334-348.
4. Fang, H. L., Ross, P., & Corne, D. (1993). A promising genetic algorithm approach to job-shop scheduling, rescheduling, and open-shop scheduling problems. Proceedings on the 5th international conference on genetic algorithms. Morgan Kaufman.
5. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. (New York: W. H. Freeman & Co.)
6. Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley.
7. Hartmann, S. (1998). A competitive genetic algorithm for resource-constrained project scheduling. Naval Research Logistics 45:733-750.
8. Kolisch R., S. Hartmann (1998). Heuristic algorithms for solving the resource constrained project scheduling problem: classification and computational analysis. Handbook on Recent Advances in Project Scheduling, ed. by Weglarz, 197-212. Kluwer.
9. Leu, S., & Yang, C. (1999). A GA-based multicriteria optimal model for construction scheduling. Journal of Construction Engineering and Management, ASCE, 125(6), 420-427.
10. Sprecher, A. (1996). Solving the RCPSP efficiently at modest memory requirements. Manuskripte aus den Insituten fur Betreibswirtschaftslehre. No. 425. Kiel, Germany: University of Kiel.
11. Goldberg, D. E., Deb, K. (1991). A comparative analysis of selection schemes used in genetic algorithms. Foundations of Genetic Algorithms, 69-93.
12. S.M.T. Fatemi Ghomi, B. Ashjari (2002). A simulation model for multi-project resource allocation. International Journal of Project Management, 29, 127-130
13. F. S. C. Lam, B. C. Lin, C. Sriskandarajah, H. Van (1999). Scheduling to minimize product design time using a genetic algorithm. International Journal of Production Research. 37(6), 1369-1386
14. W. H. Ip, Y. Li, K. F. Man, K. S. Tang (2000). Multi-product planning and scheduling using Genetic Algorithm approach. Computer & Industrial Engineering. 38, 283-296
15. P. Pongcharoen, C. Hicks, P. M. Braiden (2004). The development of genetic algorithms for the capacity scheduling of complex products, with multiple levels of product structure. European Journal of Operational Research. 152, 215-225.
16. Kolisch R., and R. Padman 1997. An integrated survey of project scheduling. Technical Report 463, Manuskripte aus den Instituten f'ur Betriebswirtschaftslehre der Universit''at Kiel.
17. nd Int. Conf. Hillsdale, NJ: Lawrence Erlbaum Associate.
18. Poon, P. W., and Carter, J. N. (1995). "Genetic algorithms crossover operators for ordering applications." Comp. Ops. Res., 22(1), 135-147.
19. Spinner, M., 1989, Improving Project Management Skills and techniques (Englewood Cliffs, NJ: Prentice-Hall).
20. Yassine, A. and Braha, D. (2003). Four Complex Problems in Concurrent Engineering and the Design Structure Matrix Method. Concurrent Engineering Research & Applications, 11(3).
21. Kurtulus, I. and Davis, E.W. (1982). Multi-Project Scheduling: Categorization of Heuristic Rules Performance. Management Science, 28(2), 161-172.