Study on a Robust Optimization Model for Project Scheduling Policies

Article Preview

Abstract:

The genetic algorithm discussed in this paper for project scheduling solution to this problem can be obtained the near optimal schedule programs. This has established the objective function and constraints that have a certain scope; it requires the duration of each process that is determined in advance for enterprises. If the project is more familiar with the history with more experience, and more complete database, the project environment can be controlled well. It can accurately determine the time with the construction plan, construction process and the optimization method with the good trial.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2866-2871

Citation:

Online since:

October 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Li yongchun, A Hybrid Genetic Algorithm Based on Neighborhood Search in Resource-constrained Project Scheduling Problem s, ,Journal of Huainan Teachers College,2007, (21).

Google Scholar

[2] Chen mingtai, HGA Algorithm for Flowshop Scheduling with Limited Waiting Time, ,Heilongjiang art press. (2000).

Google Scholar

[3] Yuan zhentian, Project Scheduling Problem Involving Time-Splittable Tasks, Educational Science Publishing House. (1998).

Google Scholar

[4] Asiafulan, Study on Job Shop Scheduling Based on Search Hybrid Strategy, ,Sichuan People Press,(2000).

Google Scholar

[5] Lian, shourao, Tabu Search Algorithm in Varying Neighborhood for Hybrid Flowshop Scheduling, ,Nanjing Press,(2008).

Google Scholar

[6] Huangbin, Approach for fuzzy multi-objective resource-constrained project scheduling problems, J, Education and career. 2006(4).

Google Scholar

[7] W.C. Jakes, Jr., Heuristic approach for resource-constrained project scheduling problems, John Wiley and Sons, New York, Chapters 1 and 5, (1974).

Google Scholar

[8] B.J. Tuch, A Genetic Algorithm for Solving RCPSP, IEEE Workshop on Local Area Networks, Worcester Polytechnic Institute, Worcester Massachusetts, p.103–111, (1991).

Google Scholar

[9] W. Diepstraten and H.J.M. Stevens, Hybrid genetic algorithm for resource constrained multi-project scheduling problem, NCR Corporation TR No. 4070023871 rev A.

Google Scholar

[10] J. Kruys, A Hybrid Genetic Algorithm Based on Neighborhood Search and its Application in Symmetry TSP", PIMRC , 92, Boston Massachusetts, p.133–135, (1992).

Google Scholar