Facilities planning and Design by Alberto Garcia Diaz and Smith J. Mac Gregor Download Software FLAP v2.0 G-Maflad STEP

طراحی و طرح ریزی واحدهای صنعتی – مدیریت کارخانه – جلد اول

Facilities planning and Design

by Alberto Garcia Diaz and Smith J. Mac Gregory

نوشته : آلبرتو گارسیا دیاز و اسمیت جمیز مک گریگوری

ترجمه مهندس علی شهابی و مهندس امین وفادار

304 صفحه مصور سیاه و سفید قیمت 6000 تومان همراه با سی دی CD چاپ اول بهار 1389

 کارخانه ها ، طرح و برنامه ریزی ، مواد صنعتی ، حمل و نقل ، مدیریت کارخانه ،

پیشگفتار مولفین : این کتاب نتیجه بیش از بیست سال تدریس درس طرح ریزی واحدهای صنعتی و حمل و نقل مواد در دوره کاترشناسی صنایع در دانشگاه A&M تگزاس و دانشگاه ماساچوست می باشد . این کتاب قابل استفاده برای مهندسین صنایع و دیگر رشته های مهندسی مثل مهندسی تکنولوژی ، مهندسی مکانیک ، مهندسی عمران و معماری نیز می باشد . درحالی که تمرکز اصلی بر روی تسهیلات صنعتی در مفاهیم و متولوژی روش شناسی طراحی می باشد ، قابل استفاده توسط تعداد دیگری از انواع تسهیلات و فعالیت های بخش خدماتی نیز می باشد . در توسعه پوشش موضوعی و سطح ارائه مطالب برای هر موضوع ، دانشجویان کارشناسی سطح بالاتر را در نظر گرفتیم . .. در دانشگاه تگزاس و ماساچوست ؛ دانشجویان در قالب گروه های سه تا پنج نفره کار می کنند و کارخانه ای را برای یک محصول از قبل طراحی شده و انتخابی خودشان طرح ریزی می نمایند . دانشجویان در رشد و توسعه طراحی ، دانش قبلی خود را در زمینه های مهندسی ، ریاضی ، آمار ، فرایند های تولید و اقتصاد مهندسی و نیز مفاهیمی در زمینه هایی نظیر بازاریابی ، مهندسی فاکتورهای انسانی ، روانشناسی صنعتی ،و طراحی محل کار مورد استفاده قرار می دهند . در لوح فشرده علاوه بر چند نرم افزار طراحی و توسعه چیدمان ..فرم های لازم و سندهایی مانند فهرست ملزومات ، مکان ها احتیاجات کارکنان و.. به زبان فارسی آفیس ورد و پی دی اف آکروبات برای انجام پروژه های طرح ریزی واحدهای صنعتی قرار داده شده است .

دانلود کتاب ، سی دی همراه ، فرم ها در انتهای صفحه 

Refrence :

[1] Apple, J M., and M. P. Deisenroth, "A Computerized Aant U3yout Analysis and Bialuation Tecilnique [RANET]" AIlE Tecilnical Papers, Twenty-third CDnference, Anaheim, 1972.
[2] Ananth, G Y., V. Kumar, and P. Pardalos. "Parallet Processing of Discrete Optimization Problems." Encyclopedia of Miaocomputers, Vol. 13,1993, pp. 129-1147. New York: Marcel Dekker, lnc., 1994.
[3] Armour, G. c., and Buffa, E. S., "A Heuristic Algorithm and Simulation Approadl to R3lative location of Facilities," Management 8::ience, Vol.9, No.2, pp. 215-219.
[4] Bazaraa, M. S, "CDmputerized Layout Design: A Branch and Bound Approach," AilE Transac1ions, Vol. 7, 1975, pp. 432-438.
[5J BLOCPLAN, Moore Productivity Software, Blacksburg, VA, 1986.
[6] Buffa, E S, G C Armour, and T. E Vollman, "Allocating Faolities with CRlIFT," Harvard Business Paview, Vol. 42, No.2, 1964, pp. 136-158.
[7] Burkard,R E,and J Offerman, "Entwurf von 3 hreibmaschinentastaturen mittels quadratischer Zuordnungs Problem," Operations Research Vol. 21, pp. B121-B132, 1977.
[8] O1hajed, D., B. Montreuil, and T. lDwe, "Row Network Design for Manufacturing ~em tayout." European .burna! of Operational Pasearch Vol. 57, 1992, pp. 145-161.
[9] Cornell National Supercomputer Facility, Parallel A-ocessing Workshop, 1988.
[10] O1ristofides, N., G Gallleni, and L Sefanini, "An Algorithm for the Maximal Aanar Qaph Problem Based on Lagrangian Felaxation," Working Paper, 1981.
[11] Colin, M., Haddas Lev, 9Jzanne ~osato, and K Micheal Tougher, "Mie 373 Rnal Paport: Incandescent Torchiere Lamo," Department of mechanical and Industrial Engineering, University of Massachusetts, Amherst, Ma, 2001.
[12] Donaghey, C E, and V. F. Are, Blaocplan-90, User's Manual Houston. TX: Industrial Engineering Department, University of I-buston, 1991.
[13] Duncan, A. J., Quality Control and Industrial Statistic. Homewood, Il, Rchard D. trwin, 1986.
[14] Elshafei, A. N., "Hospital layout as a Quadratic Assignment Problem," Operations Research Vol. 28, 1977, pp, 167-179.
[15] Finke, G. and R. E. Burkard, "Quadratic Assignment Problems," Surveys in CDmbinatorial Optimization, Amsterdam: North-Holland, 1867, pp.61-82.
[16] Fruin, J J, Pedestrian Ranning and Design. New York: Metropolitan Assocof Urban Des. and 8w. Rng, 1971.
[17] Foulds. L R, and D. F. Rlbin,.,ns. "A Srategy for S:Jlving the Rant layout Problem." Operations Research Vol. 27, 1976, pp. 845-855.
[18] Foulds, L. R., and D. F. Robinsons, "Graph Theoretic for the Plant layout A"oblem," Intern at. J. Production Res. Vol. 16, 1978, pp. 27-37.
[19] Foulds, l. R., "Techniques for Facilities Layout: Deciding Which Pairs of Activities Should Be Adjacent:' Management Science Vol. 29, No.I2, 1983, pp. 1414-1426.
[20] Garey, M. R, and D. S .ohnson, COmputers and Intractability: A GJide to Ihe Theory of Np-COmpleleness. San Franci9]Q: Freeman,1979.
[21] Gaskins, R J, and J M. A Tanchooo, "Row Path De~gn for Automated Guided Vehicle System," International. J. Production Res. Vol. 25, No. 5,1987, pp. 667-676.
[22] Goetschalckx, M., "An Interactive Layout Heuristic Based on Hexagonal Adjacency Graphs," European Journal of Operational Research Vol. 63, 1992, pp. 304-321.
[23] Goetschalckx, M., Spiral 4.xx User's Manual. 2006. http://www2.isye.gatech.edu/mgoelsch/~iral.html
[24] Qoss. D., and C M. Harris, Fundamentals of OJeueing Theory. New York: J>hn Wiley, 1985
[25] The Guiness Book of Records 1994, Peter Matthews, ed. New York: Banlam Books. 1994.
[26] Hahn, P. M., T. L Qant, and N. Hall, "A Branch and Bound Algorithm for the OJadratic Assignment A-oblem Based on the Hungarian Method:' European Journal of Operational Research Vol. 108, 1998, pp.629-640.
[27] Hahn, P. M., Bum-Jn Kim, M. GJignard, J Macgregor 9nith, and 'r1- Rlng Zhu, "An Algorithm for Generalized OJadralic Assgnmenl A'oblems" [working paper], Deparlmenl of 8eelrical and 3,lstems 81gineering, University of Pennsylvania, 2006.
[28] Hanna, S. R., and S. Konz, Facility Design & Engineering. Scottsdale, AZ: Haloomb Hathaway, Fublishers, Inc., 2004.
[29] Hassan, M. D., and G. D. Hogg, "Review of Graph Theory Applications to Ihe Facilities Layout Problem," 0\1EGi\. The Int. J Management Soi., Vol. 15, No.4, 1987, pp. 219-300.
[30] Heragu, S., Facilities Design. Boston: PWS Publis,ing Company, 1997.
[31J Hillier, f. s., And M. M. Connors, "Quadratic Graph Assignment Problem Algorithms and location of Indivisible Facilities," Mgmt ScL, Vol. 13, No.1, 1996, pp. 42-57.
[32] Jensen, Paul, Operations Management/Industrial Engineering. University of Texas. Internet, 2004.

[33] Karp, R "[»mbinatorics Cbmplexity and R3ndomness," Communications of the ACM, Vol. 29, No.2, 1986, pp. 98·109.
[34] koopmans, T, C, and M. Beckman, "Assiglment A'oblems and the location of Economic Aci.ivities, " Econometrica, Vol. 25, 1957, pp. 53- 76.
[35] Krejdrik, M., "Computer Aided Flant Layout," Cbmputer Aided Disign, Vol. 2, 1969, pp. 7-19.
[36] Kusiak, A, and S S, Heragu, "The Fedlity Layout A'oblem," European .burnal of Operational Research, Vol. 29, 1987, pp. 229-251.
[37] Lee, R C, and J M. Moore, "o::m..AP-Cbmputrized Relationship Layout Ranning," ..bur. Industrial Blgineering, Vol. 18, No.3, 1967, pp. 195-200.
[38] Levin, P. H., "Use of Graphs to Decide Optimum Layout of Building," Architeds.bur. Vol. 7, 1964.
[39] Li, Wu-J, "Deming's Methodology in Inspedion Oiteria,' Masier's A"ojed, Department of Industrial Blgineering and Operations Research, University of Massachusetts, Amherst, MA, 1988.
[40] Li, Wu-J, and J MacG-egor Snith, "An Algorithm for CkJadratic Assignment A"oblems," 8Jropean ..burnaI of Q>erational Feseard1 Vol. 31, 1995, pp. 205-216.
[41] Li, Wu-J, and J MacG-egor Snith, "Sar, G-id, and Rng Tcpologes in Facility location and network design," in Network Desigl: OJnnedivity and Facilities location, Panos Parados and D. Z OJ. eds. Dimecs !:eries in Discrete Mathematics and Theoretical OJmputer 3:ienre, Vol. 40, 1998, pp. 219-246
[42] Liggett, R., "Automated Facilities Layout: Past, Present, and Future," Automation in Construction, Vol. 9, 2000, pp. 197-215.
[43] Leung, J, "A New G-aph-Theoretic Heuristic for Fedlity Layout," Mgmt. 3:i., Vol. 38, No.4, 1992, pp. 594-605.
[44] Malasmas, Gen. Laura Wing, and Ferdian SJsanto, "MIE 373 Fedlity Ranning and Smulations Modeling," Department of Mechanical and Industrial Blgineering, University of Massachusetts, Amherst, MA, 1999.
[45] Moore, J M., "Cbmputer-Aided Fadlities Desigl: An Internationality SJrvey," Int. J A'od. Res, Vol. 12, No. I, 1974, pp. 21-40.
[46] Nugent, C E, T. E Vollman, and J RIml, "An Experimental Cbmparison of Teohniques for the Assessment of Fadlities to lDcations," Operations Research, Vol. 16, No.1, 1968, pp. 150-173.
[47] Paradalos, P. M., and H. Wolkowicz, eds., Quadratic Assignment and R!lated Problems, DlMACS ::eries in Discrete Mathematics and Theoretical Computer Science, Vol. 16, American Mathematical :::bdety, 1994.
[48] Paradalos, P. M., and H. Wolkowicz, eds., Quadratic Assignment A-oblems: Algorithms and Applications, DIMACS ::eries, Vol. 16, American Mathematical Society, 1994.
[49J Paradalos, P. M., M. G C R!send, and Y. U, "Algorithm 754: RJR1RAN Subroutines for Approximate SJlution of Dense OJadraticAssignment A-oblems Using Gf'I>S>," AQ,t Transactions on Mathematical Software, Vol. 22, No.1, pp.l04-118.
[SOJ Paradalos, P. M., M. G C R!send, and L Atsoulis, "Algorithm 769: FORTRtA Subroutines for Approximate SJlution of ~arse OJadratic Assignment Froblerns Using GfV\SJ," AOA Transactions on Mathematical :::bftware, Vol. 23, No.2, pp. 196-208.
[51J Paradalos, P. M., and L Atsoulis, eds., Nonlinear Assignment Problems; Algorithm and Applications. Kluwer Academic Publishers, 2000.
[52J Roucairol, c., "A Parallel Branch and Bound Algorithm for the Quadratic Assignment Problem, n Discrete Applied Mathematics, Vol. 18, 1987, pp.211-225.
[53J Sahni, S, and Gonzalez, T., "P-Complete Approximation A-oblems," J AQ,t, Vol. 23, 1976, pp. 555-565.
[54J 9aehofi, J M., and W. O. B-ans, "Automated layout De~gn A-ogram," .burnal of Industrial Eflgneering, Vol. 18, 1967, pp. 690-695.
[55] Sharpe, R, and J Brod1ie, "An Urban 9;stems Sudy," R Aust. Aan. Inst. J, Vol. 10, 1972, pp. 3-12.
[56J Snith, J MacQegor, and J S Uebman, "A Zero-One Integer A"ogramming Formulation of the A"oblem of land-Use Assignment and Transportation Formulation Network Design," 8lvirement and Aanning, Vol. B-5, 1978, pp. 101-115.
[57] Smith, J. M., and N. B. Rouse, "Application of Queuing Network Models to Optimization of Fesource .Allocation within Ubraries," .burnal of the American Society for Information Science, Vol. 30, No.5, 1978, pp. 250-263.
[58J Snith, J M., and d. Towsley, "The Use of OJeuing Networks in the B-aluations of Egess from EUildings," Eflvirement and Aanning, Vol. B-B, 1981, pp. 125-139.
[59] Smith, J. MacGregor, and R. R. Pelosi, "Conversational Optimization and Fadlity Layout Aanning." Eflvirement and Aanning, Vol. B-11, 1984, pp. 63-86.
[60] Snith, .I M., and R Macleod, "A R3laxed Assignment Algorithm for the OJadraticAssignment Problem," Information, Vol. 26, No.3, 1988.
[61] Smith, J. M., L. Seiford, and J. D. Smith, "Siting of Appropriated Fund Enlisted Dining Facilities," Natick Fesearch and Development laboratories Technical Report, Natick, MA, 1988.
[62] Snith, .I MacGO'egor, "Cellular Problems with Rlndom Rows," Engineering Optimization, Vol. 24, 1995, pp. 59-74.
[63] Seinberg, L, "The Backboard Wiring R-oblem: A Raoement Algorithm," SAM R3v .. Vol. 3,1961, pp. 37-50.
[63] Tompkins et al., Facilities Planning. New York: John Wiley, 2003.
[64] Tregenza, P. The Design of Interior Circulation. New York: Van Nostrand, R3inhold, 1976.

دانلود فرم های طرح ریزی و نرم افزارهای چیدمان این کتاب   Download Software

دانلود کتاب طرح ریزی در فرمت آکروبات  Download eBook Preview pdf

---

  مرافق التخطیط والتصمیم  Facilities planning and Design   設施規劃與設計  Услуги планирования и проектирования  सुविधाएं योजना और डिजाइन Instalaciones de planificación y diseño  سہولیات منصوبہ بندی اور ڈیزائن Faciliteiten planning en ontwerp Anlagenplanung und Design Tesisler planlama ve Tasarım La planification et la conception des installations תכנון מתקנים ועיצוב Fasilitas perencanaan dan Desain 시설 계획 및 설계 Servizi di pianificazione e progettazione施設の計画と設計 Kemudahan perancangan dan Reka Bentuk Байгууламж төлөвлөлт, зураг төсөл การวางแผนและการออกแบบสิ่งอำนวยความสะดวก Download Software FLAP v2.0 G-Maflad STEP

---