Particle swarm optimization for preemptive scheduling under break and resource-constraints

Journal of Construction Engineering and Management

Volumn 132, Issue 3, 2006, Pages 259-267

  Zhang, Hong ^a   Li, Heng ^b   Tam, C M ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Construction management; Optimization; Scheduling

Indexed keywords

CONSTRAINT THEORY; CONSTRUCTION INDUSTRY; PROJECT MANAGEMENT; RESOURCE ALLOCATION; SCHEDULING;

CONSTRUCTION MANAGEMENT; PARTICLE SWARM OPTIMIZATION (PSO); PREEMPTIVE SCHEDULING UNDER BREAK AND RESOURCE-CONSTRAINTS (PSBRC);

OPTIMIZATION;

EID: 32944474678     PISSN: 07339364     EISSN: None     Source Type: Journal    
DOI: 10.1061/(ASCE)0733-9364(2006)132:3(259)     Document Type: Article

References (30)

1. Baker, E. (1983). " An exact algorithm for the time-constrained traveling salesmen problem.. " Oper. Res., 31, 938-945.
2. Bean, J. (1994). " Genetic algorithms and random keys for sequencing and optimization.. " Oper. Res. Soc. Am., 6 (2), 154-160.
3. Boctor, F. F. (1990). " Some efficient multi-heuristic procedures for resource-constrained project scheduling.. " Eur. J. Oper. Res., 49, 3-13.
4. Brucker, P., Heitmann, S., and Hurink, J. (2003). " How useful are preemptive schedules? " Oper. Res. Lett., 31, 129-136.
5. Chan, W. T., Chua, D. K. H., and Kannan, G. (1996). " Construction resource scheduling with genetic algorithms.. " J. Constr. Eng. Manage., 122 (2), 125-132.
6. Chan, W. T., and Hao, H. (2002). " Production scheduling for precast plants using a flow shop sequencing model.. " J. Comput. Civ. Eng., 16 (3), 165-174.
7. Christofides, N., Mingozzi, A., and Toth, P. (1981). " State space relaxation procedures for the computation of bounds to routing problems.. " Networks, 11, 145-164.
8. Clerc, M., and Kennedy, J. (2002). " The particle swarm-explosion, stability, and convergence in a multidimensional complex space.. " IEEE Trans. Evol. Comput., 6 (1), 58-73.
9. Demeulemeester, E. L., and Herroelen, W. S. (1996). " An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem.. " Eur. J. Oper. Res., 90, 334-348.
10. Dumas, Y., Desrosiers, J., and Soumis, F. (1991). " The pickup and delivery problem with time windows.. " Eur. J. Oper. Res., 54, 7-22.
11. Eberhart, R. C., and Shi, Y. (1998). " Comparison between genetic algorithms and particle swarm optimization.. " Evolutionary Programming VII: Proc., Seventh Annual Conf. on Evolutionary Programming, San Diego, Calif., 611-616.
12. Eberhart, R. C., and Shi, Y. (2001). " Tracking and optimizing dynamic systems with particle swarms.. " Proc., IEEE Congress on Evolutionary Computation (CEC 2001), Seoul, Korea, 94-97.
13. Fisher, M., and Jaikumar, R. (1981). " A generalized assignment heuristic for vehicle routing.. " Networks, 11, 109-124.
14. Gavish, B., and Pirkul, H. (1991). " Algorithms for multi-resource generalized assignment problem.. " Manage. Sci., 37 (6), 695-713.
15. Gupta, C. G., Gupta, Y. P., and Kumar, A. (1993). " Minimizing flow time variance in a single system using genetic algorithm.. " Eur. J. Oper. Res., 70, 289-303.
16. Hartmann, S. (1998). " A competitive genetic algorithm for resource-constrained project scheduling.. " Naval Res. Logistics Quart., 45, 733-750.
17. Kennedy, J., and Eberhart, R. C. (1995). " Particle swarm optimization.. " Proc., IEEE Conf. on Neural Networks, IV, Piscataway, N.J., 1942-1948.
18. Kennedy, J., Eberhart, R. C., and Shi, Y. (2001). Swarm intelligence, Morgan Kaufmann, San Francisco, Calif.
19. Kolisch, R. (1996). " Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation.. " Eur. J. Oper. Res., 90, 320-333.
20. Lawler, E. L. (1982). " Preemptive scheduling of precedence-constrained jobs on parallel machines.. " Deterministic and stochastic scheduling, M. A. H. Dempster, J. K. Lenstra, and, A. H. G. Rinnooy Kan, eds., Reidel, Dordrecht, 101-123.
21. Lee, J. K., and Kim, Y. D. (1996). " Search heuristics for resource constrained project scheduling.. " J. Oper. Res. Soc., 47 (5), 678-689.
22. Leu, S. S., and Yang, C. H. (1999). " GA-based multicriteria optimal model for construction scheduling.. " J. Constr. Eng. Manage., 125 (6), 420-427.
23. Padilla, E. M., and Carr, R. I. (1991). " Resource strategies for dynamic project management.. " J. Constr. Eng. Manage., 117 (2), 279-293.
24. Shi, Y., and Eberhart, R. C. (1998). " Parameter selection in particle swarm optimization.. " Evolutionary Programming VII: Proc., Seventh Annual Conf. on Evolutionary Programming, Springer, New York, 591-600.
25. Solman, M. M. (1987). " Algorithms for the vehicle routing and scheduling problems with time window constraints.. " Oper. Res., 35, 254-265.
26. Stinson, J. P. (1976). " A branch and bound algorithm for a general class resource-constrained scheduling problem.. " PhD thesis, Univ. of North Carolina at Chapel Hill, Chapel Hill, N.C.
27. Talbot, F. B. (1982). " Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case.. " Manage. Sci., 28 (10), 1197-1210.
28. Trelea, I. C. (2003). " The particle swarm optimization algorithm: Convergence analysis and parameter selection.. " Inf. Process. Lett., 85 (6), 317-325.
29. Yang, H. H., and Chen, Y. L. (2000). " Finding the critical path in an activity network with time-switch constraints.. " Eur. J. Oper. Res., 120, 603-613.
30. Young, S. Y. (2002). " Genetic algorithm with fuzzy logic controller for preemptive and non-preemptive job-shop scheduling problems.. " Comput. Ind. Eng., 43, 623-644.