Show simple item record

dc.creatorSrinivasan, Ananden_US
dc.date.accessioned2012-06-07T22:46:56Z
dc.date.available2012-06-07T22:46:56Z
dc.date.created1996en_US
dc.date.issued1996
dc.identifier.urihttp://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-S734en_US
dc.descriptionDue to the character of the original source materials and the nature of batch digitization, quality control issues may be present in this document. Please report any quality issues you encounter to digital@library.tamu.edu, referencing the URI of the item.en_US
dc.descriptionIncludes bibliographical references: p. 69-72.en_US
dc.descriptionIssued also on microfiche from Lange Micrographics.en_US
dc.description.abstractThis thesis is in the area of operations scheduling in an automated or semi-automated job-shop system, where parts with various routings contend for service on the resources in the system. The classical job-shop scheduling problem has usually been solved in literature as a machine scheduling problem, neglecting the material handling tasks that effect transfer from one processing machine to another. This has helped in reducing the size of the problem and in decreasing the solution computing time, or in producing a better solution in a given time. In this thesis the complete operations schedule for a job-shop scheduling problem is generated by two approaches in the same solution computing time- (1) by solving the complete scheduling problem directly, and (2) by solving the simplified machine scheduling problem and using its solution to generate the solution to the complete scheduling problem by "adding-on" the material handling activities. The relative performance of the two approaches is studied by testing a suitable hypothesis using results from various experiments. It is concluded that the approach of solving the complete scheduling problem including material handling appears to be better (on average) than solving the truncated problem and generating a solution for the complete problem.en_US
dc.format.mediumelectronicen_US
dc.format.mimetypeapplication/pdfen_US
dc.language.isoen_USen_US
dc.publisherTexas A&M Universityen_US
dc.rightsThis thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries in 2008. 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_US
dc.subjectindustrial engineering.en_US
dc.subjectMajor industrial engineering.en_US
dc.titleOperations scheduling in job-shopsen_US
dc.typeThesisen_US
thesis.degree.disciplineindustrial engineeringen_US
thesis.degree.nameM.S.en_US
thesis.degree.levelMastersen_US
dc.type.genrethesis
dc.type.materialtexten_US
dc.format.digitalOriginreformatted digitalen_US


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