Show simple item record

dc.contributor.advisorHogg, Gary L.
dc.contributor.advisorSmith, Donald R.
dc.creatorHassan, Mohsen Mohamed Darwis
dc.date.accessioned2020-09-02T21:07:35Z
dc.date.available2020-09-02T21:07:35Z
dc.date.issued1983
dc.identifier.urihttps://hdl.handle.net/1969.1/DISSERTATIONS-548521
dc.descriptionTypescript (photocopy).en
dc.description.abstractThis research presents a construction algorithm for solving the facilities design problem which is the joint solution of a plant layout problem and a materials handling equipment selection problem. The emphasis in this research is on solving each component subproblem rather than on resolving their dependency on one another. The plant layout problem is formulated as a generalized assignment problem whose objective is minimizing the movement cost. The solution algorithm is a heuristic that utilizes the solution procedure of locating one item in a warehouse repetitively in placing and constructing the departments, thus allowing the objective function of the model to affect departmental shapes, and vice versa. The main features of the plant layout algorithm are: (1) It selects the departments to enter the layout according to the sum of major flow values. (2) It eliminates the scale and its undesirable effects by expressing departmental areas as unit squares. (3) It provides, as much as possible, regular and near optimal shaped departments and layout outline without prespecifying any particular shapes. The materials handling equipment selection problem is formulated as integer program with the objective being to minimize the total operating and investment costs of the selected equipment. Each move is allowed to be performed by only one equipment type and the available operating time of each equipment type cannot be exceeded. The problem is solved by a heuristic algorithm that exploits, conceptually, its similarity to both the knapsack and the loading problems. The algorithm is computationally attractive and helps achieve other goals of the problem such as maximizing equipment utilization and minimizing the variations in their types. The algorithm is termed SHAPE (Selection of Materials Handling Equipment and Area Placement Evaluation) and is coded in FORTRAN-IV. The layout problem is first solved and the distances between the departments are utilized in calculating the operating times and costs of the moves. Finally, the selection of the equipment and their assignment to the moves are accomplished.en
dc.format.extentx, 215 leavesen
dc.format.mediumelectronicen
dc.format.mimetypeapplication/pdf
dc.language.isoeng
dc.rightsThis thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use.en
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/
dc.subjectIndustrial Engineeringen
dc.subject.classification1983 Dissertation H353
dc.subject.lcshMaterials handlingen
dc.subject.lcshEquipment and suppliesen
dc.subject.lcshData processingen
dc.subject.lcshPlant layouten
dc.subject.lcshData processingen
dc.titleA computerized model for the selection of materials handling equipment and area placement evaluation (SHAPE)en
dc.typeThesisen
thesis.degree.disciplinePhilosphyen
thesis.degree.grantorTexas A&M Universityen
thesis.degree.nameDoctor of Philosophyen
thesis.degree.namePh. D. in Philosphyen
thesis.degree.levelDoctorialen
dc.contributor.committeeMemberDas, Biman
dc.contributor.committeeMemberHocking, Ronald R.
dc.contributor.committeeMemberPhillips, Don T.
dc.type.genredissertationsen
dc.type.materialtexten
dc.format.digitalOriginreformatted digitalen
dc.publisher.digitalTexas A&M University. Libraries
dc.identifier.oclc11305743


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

This item and its contents are restricted. If this is your thesis or dissertation, you can make it open-access. This will allow all visitors to view the contents of the thesis.

Request Open Access