A note on 'Efficient facility layout planning in a maximally planar graph model'

DOI10.1080/00207540010023006zbMATH Open1060.90527OpenAlexW2161121208MaRDI QIDQ4679999FDOQ4679999

Authors: Latif A. al-Hakim 

Publication date: 31 May 2005

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: http://eprints.usq.edu.au/3139/1/Al-Hakim_2001_IJPR_Permanent_restriction.pdf

Recommendations

• scientific article; zbMATH DE number 91049
• Efficient facility layout planning in a maximally planar graph model
• Maximally weighted graph theoretic facilities design planning
• Planarizing graphs---a survey and annotated bibliography
• A note on 'Maximally weighted graph theoretic facilities design planning'

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Production models (90B30) Discrete location and assignment (90B80)

Cited In (4)

• A connectivity graph generation approach for Manhattan path calculation in detailed facility layout
• A note on 'Maximally weighted graph theoretic facilities design planning'
• A fast algorithm to generate feasible solution of production facilities layout based on plane segmentation
• A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem

This page was built for publication: A note on 'Efficient facility layout planning in a maximally planar graph model'

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4679999)