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.
Some problems in sequencing and scheduling utilizing branch and bound algorithms
dc.contributor.advisor | Curry, Guy L. | |
dc.creator | Gim, Bongjin | |
dc.date.accessioned | 2020-09-02T21:11:09Z | |
dc.date.available | 2020-09-02T21:11:09Z | |
dc.date.issued | 1988 | |
dc.identifier.uri | https://hdl.handle.net/1969.1/DISSERTATIONS-770878 | |
dc.description | Typescript (photocopy). | en |
dc.description.abstract | This dissertation deals with branch and bound algorithms which are applied to the two-machine flow-shop problem with sparse precedence constraints and the optimal sequencing and scheduling of multiple feedstocks in a batch type digester problem . The common characteristic of these problems is that they are combinatorial optimization problems of the sequencing and scheduling class. Branch and bound methods are the natural approaches for these problems classes. The objective of this research is to derive efficient branch and bound algorithm s for these problems. An efficient solution of the problem with parallel-chain precedence constraints was developed by Kurisu in 1976. The problem studied here is to find a schedule which minimizes the maximum flowtime with the requirement that the schedule does not violate a set of sparse precedence constraints. This research provides a branch and bound algorithm which employs a lower bounding rule and is based on an adjustment of the sequence obtained by applying Johnson's algorithm. It is demonstrated that this lower bounding procedure in conjunction with Kurisu's branching rule is effective for the sparse precedence constraints problem class. Biomass to methane production systems have the potential of supplying 25% of the national gas demand. The production systems associated with this conversion process axe anaerobic digestion facilities. The economic viability of these systems depends a great deal on cost effective production methods and facilities. The optimal operation of a batch digester system requires the sequencing and scheduling of all batches from multiple feedstocks during a fixed time horizon. A significant characteristic of these systems is that the feedstock decays in storage before use in the digester system. The operational problem is to determine the time to allocate to each batch of several feedstocks and then sequence the individual batches so as to maximize biogas production for a single batch type digester over a fixed planning horizon. This research provides a branch and bound algorithm for sequencing and a two-step hierarchical dynamic programming procedure for time allocation scheduling. An efficient heuristic algorithm is developed for large problems and demonstrated to yield excellent results. | en |
dc.format.extent | x, 49 leaves | en |
dc.format.medium | electronic | en |
dc.format.mimetype | application/pdf | |
dc.language.iso | eng | |
dc.rights | This 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.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
dc.subject | Major industrial engineering | en |
dc.subject.classification | 1988 Dissertation G491 | |
dc.subject.lcsh | Production scheduling | en |
dc.subject.lcsh | Mathematical models | en |
dc.subject.lcsh | Combinatorial enumeration problems | en |
dc.subject.lcsh | Branch and bound algorithms | en |
dc.subject.lcsh | Biogas | en |
dc.title | Some problems in sequencing and scheduling utilizing branch and bound algorithms | en |
dc.type | Thesis | en |
thesis.degree.grantor | Texas A&M University | en |
thesis.degree.name | Doctor of Philosophy | en |
thesis.degree.name | Ph. D | en |
dc.contributor.committeeMember | Deuermeyer, Bryan L. | |
dc.contributor.committeeMember | Feldman, Richard M. | |
dc.contributor.committeeMember | Freund, Rudolf J. | |
dc.type.genre | dissertations | en |
dc.type.material | text | en |
dc.format.digitalOrigin | reformatted digital | en |
dc.publisher.digital | Texas A&M University. Libraries | |
dc.identifier.oclc | 19494513 |
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.