Skip to main content

Research on the Optimization Decision-Making Two Row-Sequencing-Pairs of Activities with Slacks

  • Conference paper
Advances in Swarm Intelligence (ICSI 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6146))

Included in the following conference series:

  • 2182 Accesses

Abstract

In Operation research, how to schedule parallel activities to sequential ones is typical project scheduling problem with restrained resources, and it is also complicated optimization problem. In this paper, on the basis of characteristic of CPM (Critical Path Method) network, theories of Deficient Values of sequencing-pair and standard row-sequencing-pair are deduced. Based on these theories, an optimization method on selecting 4 activities from N parallel activities to constitute 2 row-sequencing-pairs of activities is designed. By proof, using the method could get optimal solution.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bai, S.J.: Modern Project Management, pp. 83–105. Machinery Industry Press, Beijing (2005)

    Google Scholar 

  2. Elmaghraby, S.E.: Activity nets: A guided tour through some recent developments. European Journal of Operational Research 82, 383–408 (1995)

    Article  MATH  Google Scholar 

  3. Lin, M., Lin, Z.X.: A cost-effective critical path approach for service priority selections in grid computing economy. Decision Support Systems 42, 1628–1640 (2006)

    Article  Google Scholar 

  4. Chanas, S., Zieliski, P.: The computational complexity of the criticality problems in a network with interval activity times. European Journal of Operational Research 136, 541–550 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  5. Cao, G.M., Bai, S.J.: Three aspects of international development of PERT/CPM network techinques. System Engineering Theory and Practice 3, 41–46 (1993)

    Google Scholar 

  6. Bai, S.J.: Network planning and heuristic optimal method with restrained resources and its evaluation and choice. Chinese management science 11, 30–38 (1993)

    Google Scholar 

  7. Montemanni, R., Gambardella, L.M., Donati, A.V.: A branch and bound algorithm for the robust shortest path problem with interval data. Operations Research Letters 32, 225–232 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  8. Wang, Z.T.: Network planning techniques, pp. 48–62. LiaoNing Press, Shengyang (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lv, S., Qi, J., Zhao, X., Su, Z. (2010). Research on the Optimization Decision-Making Two Row-Sequencing-Pairs of Activities with Slacks. In: Tan, Y., Shi, Y., Tan, K.C. (eds) Advances in Swarm Intelligence. ICSI 2010. Lecture Notes in Computer Science, vol 6146. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13498-2_55

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13498-2_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13497-5

  • Online ISBN: 978-3-642-13498-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics