Minimizing task completion time with the execution set method

European Journal of Operational Research

Volumn 187, Issue 3, 2008, Pages 1513-1519

  Laslo, Zohar ^a   Keren, Baruch ^a   Ilani, Hagai ^a  

^a SAMI SHAMOON COLLEGE OF ENGINEERING   (Israel)

Author keywords

Linear programming optimization; Networks graphs: applications

Indexed keywords

INTEGER PROGRAMMING; LINEAR PROGRAMMING; OPTIMIZATION; ROBOTS;

ACYCLIC NETWORK; LINEAR PROGRAMMING OPTIMIZATION;

SET THEORY;

EID: 36849065885     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.09.030     Document Type: Article

References (18)

1. Chen Y.L., Rinks D., and Tang K. Critical path in an activity network with time constraints. European Journal of Operational Research 100 (1997) 122-133
2. Cook W.J., Cunningham W.H., Pulleyblank W.R., and Schrijver A. Combinatorial Optimization (1998), John Wiley & Sons, Inc., New York
3. Garey, and Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman & Co, New York
4. Golenko-Ginzburg D. Two-level decision-making model for controlling stochastic projects. International Journal of the Production Economics 32 (1993) 117-127
5. Karamburowski, J., 1993. Project crashing in CPM networks. In: Proceedings of the Annual Meeting Of Decision Science Institute, Washington DC, pp. 1099-1101.
6. Kelley Jr. J.E. Critical path planning and scheduling: Mathematical basis. Operations Research 9 3 (1961) 296-320
7. Kelley, J.E., Walker, M.R., 1959. Critical path planning and scheduling. In: Proceedings of the Eastern Joint Computer Conference, pp. 160-173.
8. Keren, B., Laslo, Z., Ilani, H., 2004. Planning the most-parallel processing of directed acyclic graphs. In: Proceedings of the Twentieth European Conference on Operational Research (OR on the Management of Electronic Services - EURO XX), Rhodes, Greece.
9. Laslo Z. Activity time-cost tradeoffs under time and cost chance constraints. Computers and Industrial Engineering 44 3 (2003) 365-384
10. Luh J.Y.C., and Lin C.S. Scheduling parallel operations in automation for minimum execution time based on PERT. Computers and Industrial Engineering 9 2 (1985) 149-165
11. Malcolm D.G., Roseboom J.H., Clark C.E., and Fazar W. Application of technique for research and development program evaluation (PERT). Operations Research 7 5 (1959) 646-669
12. Monde C.L., Schrijver A., Todd M.J., and Wei V.K. Convex resource allocation problems on directed acyclic graphs: Duality, complexity, special cases and extensions. Mathematics of Operations Research 15 4 (1990) 736-748
13. Phillips Jr. S., and Dessouki M.I. Solving the project time-cost tradeoff problem using the minimal cut concept. Management Science 24 (1977) 393-400
14. Solomon M.M. Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35 (1987) 254-265
15. Tufeci S. A flow preserving algorithm for time-cost tradeoff problem. IIE Transactions 14 (1982) 109-113
16. Wu Y., and Li C. Minimal cost networks: The cut set parallel difference method. Omega 22 (1994) 401-407
17. Yang H.H., and Chen Y.L. Finding the critical path in an activity network with time switch constraints. European Journal of Operational Research 120 (2000) 603-613
18. Yu-Kwong K., and Ishfaq A. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys 31 4 (1999) 406-471 ABI/INFORM Global