Dynamic programming for services scheduling with start time constraints in distributed collaborative manufacturing systems

Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

Volumn , Issue , 2012, Pages 803-808

  Cai, Zhicheng ^a   Li, Xiaoping ^a   Chen, Long ^a  

^a SOUTHEAST UNIVERSITY   (China)

Author keywords

distributed collabarative manufacturing; DTCTP; dynamic programming; services scheduling

Indexed keywords

COLLABORATIVE MANUFACTURING SYSTEM; COMPUTATION TIME; CONVERGENT SPEED; DISCRETE TIME-COST TRADEOFF PROBLEMS; DTCTP; EFFECTIVE DYNAMICS; MANUFACTURING SERVICE; NP-HARD; SERVICE-SCHEDULING; SIMULATED EXPERIMENTS; TIME COMPLEXITY; TIME CONSTRAINTS; TIME POINTS;

COMMERCE; COMPUTATIONAL COMPLEXITY; COMPUTER AIDED MANUFACTURING; CYBERNETICS; MANUFACTURE; SCHEDULING;

DYNAMIC PROGRAMMING;

EID: 84872401047     PISSN: 1062922X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSMC.2012.6377826     Document Type: Conference Paper

References (14)

1. W.M. Shen. Agent-Based Distributed Manufacturing Process Planning and Scheduling: A State-of-the-Art Survey. IEEE Transactions On Systems, Man, And Cybernetics.2006, 36(4).
2. W.M. Shen. An agent-based service-oriented integration architecture for collaborative intelligent manufacturing. Robotics and Computer-Integrated Manufacturing. 2007, 23:315-325.
3. Z.Li, X.Jin, Y.Cao, X.Zhang, Y.Li. Conception and implementation of a collaborative manufacturing grid. International Journal of Advanced Manufacturing Technology. 2007, 34:1224-1235.
4. F.Tao, L.Zhang, A.Y.C. Nee. A review of the application of grid technology in manufacturing. International Journal of Production Research. 2011, 49(13):4119-4155.
5. J.W. Yin, W.Y. Zhang, M. Cai. Weaving an agent-based Semantic Grid for distributed collaborativemanufacturing. International Journal of Production Research. 2010, 48(7):2109-2126.
6. D.R. Robinson. A dynamic programming solution to cost-time trade off for CPM. Management Science. 1975, 2292:158-166.
7. T.J. Hindelang, J.F. Muth. A dynamic programming algorithm for decision CPM networks. Operations Research. 1979, 27(2):225-241.
8. P. De, E.J. Dunne, J.B. Ghosh, C.E. Wells. The discrete time-cost tradeoff problem revisited. European Journal Of Operational Research. 1995, 81:225-238.
9. E.L. Demeulemeester, W.S. herroelen, S.E. Elmaghraby. Optimal procedures for the discrete time/cost trade-off problem in project networks. European Journal Of Operational Research. 1996, 88:50-68. (Pubitemid 126367092)
10. P. De, E.J. Dunne, J.B. Ghosh, C.E. Wells, Complexity of the discrete time-cost tradeoff problem for project networks, Operations Research 45 (1997) 302-306.
11. M. SKUTELLA. Approximation algorithms for the discrete time-cost tradeoff problem. Mathematic Of Operation Research.1998, 23(4).
12. AB Hafizoglu, M. Azizoglu. Linear programing based approaches for the discrete time/cost trade-off problem in project networks. Journal of Operational Research Society.2010, 61:676-685.
13. Hazir, M. Haouari, E. Erel.Hazir,Discrete time/cost trade-off problem: A decomposition-based solution algorithm for the budget version. Computers & Operations Research.2010, 37:649-655.
14. C.Akkan, A.Drexl, A.Kimms.Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. European Journal Of Operational Research. 2005, 165:339-358.