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.
Application of the genetic algorithm for global scheduling and a single machine scheduling problem with periodic maintenance and semiresumable jobs
| dc.creator | Graves, Gregory Howard | |
| dc.date.accessioned | 2012-06-07T22:52:27Z | |
| dc.date.available | 2012-06-07T22:52:27Z | |
| dc.date.created | 1998 | |
| dc.date.issued | 1998 | |
| dc.identifier.uri | https://hdl.handle.net/1969.1/ETD-TAMU-1998-THESIS-G73 | |
| 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 digital@library.tamu.edu, referencing the URI of the item. | en |
| dc.description | Includes bibliographical references: p.58-60. | en |
| dc.description | Issued also on microfiche from Lange Micrographics. | en |
| dc.description.abstract | This thesis considers two different scheduling problems in industrial settings. The first problem consists of minimizing the total completion time of jobs scheduled on a single machine that must undergo periodic maintenance. Additionally, if a job is not processed until completion before the machine is stopped for maintenance, an additional setup is necessary before processing on the job may be resumed. In this thesis, this problem is proved to be NP-complete in the strong sense. Additionally, a special case of the problem is presented where only two production periods and one maintenance period may occur. This special case is proved to be NP-hard, and a pseudopolynomial time dynamic programming algorithm to solve the special case is presented. The second problem considered here is the job shop scheduling problem where the objective is to minimize the makespan. Local search techniques which have been applied to this problem are discussed with the emphasis being on genetic algorithms. A genetic algorithm and a scheduling model for an actual industrial job shop are developed and combined to provide a search algorithm which finds good schedules for the job shop. This algorithm is compared to the scheduling procedure currently in use by the management of the modeled shop, and results are presented. | en |
| dc.format.medium | electronic | en |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | |
| dc.publisher | Texas A&M University | |
| 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 |
| dc.subject | industrial engineering. | en |
| dc.subject | Major industrial engineering. | en |
| dc.title | Application of the genetic algorithm for global scheduling and a single machine scheduling problem with periodic maintenance and semiresumable jobs | en |
| dc.type | Thesis | en |
| thesis.degree.discipline | industrial engineering | en |
| thesis.degree.name | M.S. | en |
| thesis.degree.level | Masters | en |
| dc.type.genre | thesis | en |
| dc.type.material | text | en |
| dc.format.digitalOrigin | reformatted digital | en |
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.