Research Article
BibTex RIS Cite

PROBLEM ÇÖZMEDE ŞEBEKE ANALİZİ YAKLAŞIM

Year 1993, Volume: 11 , 95 - 114, 31.12.1993

Abstract

Makaleye ait öz bulunmamaktadır.    

References

  • Bazaraa, M.S., J.J.Jarvis. Linear Programming and Network Flows. 1977.
  • Bellmore,M.. G.Bennington,ve S.Lubore, "A Multivehicle Tanker Scheduling Problem", Transportation Science, 5 , 1971
  • Bey,R.B., RH.Doersch, J.H.Patterson, "The Net Present Value Criterion: Its Impact on Project Scheduling", Project Management guartely, June 1981
  • Bradley,G.H., 'Survey of Deterministic Networks", AllE Transactions,V7, N03, 1975.
  • Charnes,A., ve W.W.Cooper, Management Models and Industrial Applications of Linear Programming, 2 Vols,John Wiley and Sons,New York 1961.
  • Dantzig, G.B., Linear Programming and Extensions, Princeton University Press, Princeton, N.J. 1963.
  • Dorsey,R.C., T.J.Hodgson. ve Network Approach to a Multi Facility Production Scheduling Problem without Backordering", Management Science,21 1975.
  • Dorsey,R.C., T.J.Hodgson, ve D.H.Ratliff,"A Production Scheduling Problem with Batch Processing", Operations Research22, 1974.
  • Elmaghraby, S.E. "The Theory of Networks and Management Science Parts I and Il". Management Science. Voll 7.1970.
  • Elmaghraby, S.E. "Project Bidding Under Deterministic and Probabilistic Activity Durations", European Journal of Operational Research, 49, 1990.
  • Elmaghraby, S.E., W.S.Herroelen, "The Scheduling of Activities to Maximize the Net Present Value of Projects", European Journal of Operational Research, 49, 1990.
  • Ford,L.R, ve D.R.Fulkerson, Flows in Network, Pflnceton University Press, Princeton, N.J., 1962.
  • Glover. F. ve D.Klingman, "New Advances in Solution of Large Scale Network and Network-Related Problems", Colloquid Mathematica Societatis Janos Bolyai12, North Holland Publishing co. 1975.
  • Grinold,R.C., "The Payment Scheduling Problem", Naval Research Logistics Quarterly. 19, 1972.
  • Guim,L., ve D,J,Nye, "A Network Model for insurance Company Cash Flow Management".MathematicaI Programming Study. 15, 1981. Hitchcock,F.L., 'The Distribuüon of a Product from Several Sources to Numerous Localities", Journal of Mathematics and Physics, 20, 1941.
  • Jensen, P.A., J.W. Barnes. Network Flow Programming. 1980
  • Kennington, J.L., R.V. Helgason. Algorithms for Network Programming. 1980.
  • Koopmans,T.C., 'Optimum Utilization of the Transportation System", Econometric, XVII, (1949).
  • Kuhn, H.W., 'The Hungarian Method for Assignment Problems", Naval Research Logistics Ouarterly, 2, 1955
  • Minieka, E. Optimization Algorithms for Networks and Graphs. 1978.
  • Orden,A., "The fransshipment Problem", Management Science, 2, 1956.
  • Ratliff,H.D., "Network Models for Production Scheduling Problems with Convex Cost and Batch Processing', Ind.and Sys.Dept.,U. of Florida, Research Report, 76-18, 1976.
  • Russell,A.H., "Cash Flows in Networks", Management Science, 16, 1970.
  • Wijngaard, J.. "Aggregation in Manpower Planning', Management Science. 29. 1983
  • Zahorik, A. , L.J.Thomas ve V.Trigeirro, "Network Programming Models for Production Scheduling in Multi-Stage, Multi-item Capacitated Systems", Management Science,
  • Zangwill,W. , "A Backlogging Model And a Multi-Echelon Model of a Dynamic Economic Lot Size Production System-A Network Approach", Management Science, 15, 1969
Year 1993, Volume: 11 , 95 - 114, 31.12.1993

Abstract

References

  • Bazaraa, M.S., J.J.Jarvis. Linear Programming and Network Flows. 1977.
  • Bellmore,M.. G.Bennington,ve S.Lubore, "A Multivehicle Tanker Scheduling Problem", Transportation Science, 5 , 1971
  • Bey,R.B., RH.Doersch, J.H.Patterson, "The Net Present Value Criterion: Its Impact on Project Scheduling", Project Management guartely, June 1981
  • Bradley,G.H., 'Survey of Deterministic Networks", AllE Transactions,V7, N03, 1975.
  • Charnes,A., ve W.W.Cooper, Management Models and Industrial Applications of Linear Programming, 2 Vols,John Wiley and Sons,New York 1961.
  • Dantzig, G.B., Linear Programming and Extensions, Princeton University Press, Princeton, N.J. 1963.
  • Dorsey,R.C., T.J.Hodgson. ve Network Approach to a Multi Facility Production Scheduling Problem without Backordering", Management Science,21 1975.
  • Dorsey,R.C., T.J.Hodgson, ve D.H.Ratliff,"A Production Scheduling Problem with Batch Processing", Operations Research22, 1974.
  • Elmaghraby, S.E. "The Theory of Networks and Management Science Parts I and Il". Management Science. Voll 7.1970.
  • Elmaghraby, S.E. "Project Bidding Under Deterministic and Probabilistic Activity Durations", European Journal of Operational Research, 49, 1990.
  • Elmaghraby, S.E., W.S.Herroelen, "The Scheduling of Activities to Maximize the Net Present Value of Projects", European Journal of Operational Research, 49, 1990.
  • Ford,L.R, ve D.R.Fulkerson, Flows in Network, Pflnceton University Press, Princeton, N.J., 1962.
  • Glover. F. ve D.Klingman, "New Advances in Solution of Large Scale Network and Network-Related Problems", Colloquid Mathematica Societatis Janos Bolyai12, North Holland Publishing co. 1975.
  • Grinold,R.C., "The Payment Scheduling Problem", Naval Research Logistics Quarterly. 19, 1972.
  • Guim,L., ve D,J,Nye, "A Network Model for insurance Company Cash Flow Management".MathematicaI Programming Study. 15, 1981. Hitchcock,F.L., 'The Distribuüon of a Product from Several Sources to Numerous Localities", Journal of Mathematics and Physics, 20, 1941.
  • Jensen, P.A., J.W. Barnes. Network Flow Programming. 1980
  • Kennington, J.L., R.V. Helgason. Algorithms for Network Programming. 1980.
  • Koopmans,T.C., 'Optimum Utilization of the Transportation System", Econometric, XVII, (1949).
  • Kuhn, H.W., 'The Hungarian Method for Assignment Problems", Naval Research Logistics Ouarterly, 2, 1955
  • Minieka, E. Optimization Algorithms for Networks and Graphs. 1978.
  • Orden,A., "The fransshipment Problem", Management Science, 2, 1956.
  • Ratliff,H.D., "Network Models for Production Scheduling Problems with Convex Cost and Batch Processing', Ind.and Sys.Dept.,U. of Florida, Research Report, 76-18, 1976.
  • Russell,A.H., "Cash Flows in Networks", Management Science, 16, 1970.
  • Wijngaard, J.. "Aggregation in Manpower Planning', Management Science. 29. 1983
  • Zahorik, A. , L.J.Thomas ve V.Trigeirro, "Network Programming Models for Production Scheduling in Multi-Stage, Multi-item Capacitated Systems", Management Science,
  • Zangwill,W. , "A Backlogging Model And a Multi-Echelon Model of a Dynamic Economic Lot Size Production System-A Network Approach", Management Science, 15, 1969
There are 26 citations in total.

Details

Primary Language Turkish
Journal Section Articles
Authors

Aydın Ulucan

Publication Date December 31, 1993
Submission Date January 1, 1993
Published in Issue Year 1993 Volume: 11

Cite

APA Ulucan, A. (1993). PROBLEM ÇÖZMEDE ŞEBEKE ANALİZİ YAKLAŞIM. Hacettepe Üniversitesi İktisadi Ve İdari Bilimler Fakültesi Dergisi, 11, 95-114.
AMA Ulucan A. PROBLEM ÇÖZMEDE ŞEBEKE ANALİZİ YAKLAŞIM. Hacettepe Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi. December 1993;11:95-114.
Chicago Ulucan, Aydın. “PROBLEM ÇÖZMEDE ŞEBEKE ANALİZİ YAKLAŞIM”. Hacettepe Üniversitesi İktisadi Ve İdari Bilimler Fakültesi Dergisi 11, December (December 1993): 95-114.
EndNote Ulucan A (December 1, 1993) PROBLEM ÇÖZMEDE ŞEBEKE ANALİZİ YAKLAŞIM. Hacettepe Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi 11 95–114.
IEEE A. Ulucan, “PROBLEM ÇÖZMEDE ŞEBEKE ANALİZİ YAKLAŞIM”, Hacettepe Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi, vol. 11, pp. 95–114, 1993.
ISNAD Ulucan, Aydın. “PROBLEM ÇÖZMEDE ŞEBEKE ANALİZİ YAKLAŞIM”. Hacettepe Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi 11 (December 1993), 95-114.
JAMA Ulucan A. PROBLEM ÇÖZMEDE ŞEBEKE ANALİZİ YAKLAŞIM. Hacettepe Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi. 1993;11:95–114.
MLA Ulucan, Aydın. “PROBLEM ÇÖZMEDE ŞEBEKE ANALİZİ YAKLAŞIM”. Hacettepe Üniversitesi İktisadi Ve İdari Bilimler Fakültesi Dergisi, vol. 11, 1993, pp. 95-114.
Vancouver Ulucan A. PROBLEM ÇÖZMEDE ŞEBEKE ANALİZİ YAKLAŞIM. Hacettepe Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi. 1993;11:95-114.

Manuscripts must conform to the requirements indicated on the last page of the Journal - Guide for Authors- and in the web page.


Privacy Statement

Names and e-mail addresses in this Journal Web page will only be used for the specified purposes of the Journal; they will not be opened for any other purpose or use by any other person.