NOTE: This item is not available outside the Texas A&M University network. Texas A&M affiliated users who are off campus can access the item through NetID and password authentication or by using TAMU VPN. Non-affiliated individuals should request a copy through their local library's interlibrary loan service.
Operations scheduling in job-shops
|dc.description||Due 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 email@example.com, referencing the URI of the item.||en_US|
|dc.description||Includes bibliographical references: p. 69-72.||en_US|
|dc.description||Issued also on microfiche from Lange Micrographics.||en_US|
|dc.description.abstract||This 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.publisher||Texas A&M University||en_US|
|dc.rights||This 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.subject||Major industrial engineering.||en_US|
|dc.title||Operations scheduling in job-shops||en_US|
Files in this item
This item appears in the following Collection(s)
Digitized Theses and Dissertations (1922–2004)
Texas A&M University Theses and Dissertations (1922–2004)
Request Open Access
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.