Show simple item record

dc.contributor.advisorHasenbein, John J.en
dc.contributor.advisorBarnes, J. Wesley.en
dc.creatorZoghby, Jeriad Marcusen
dc.date.accessioned2008-08-28T22:10:28Zen
dc.date.available2008-08-28T22:10:28Zen
dc.date.issued2002en
dc.identifierb5997395xen
dc.identifier.urihttp://hdl.handle.net/2152/1656en
dc.descriptiontexten
dc.description.abstractThis thesis presents the Critical Arc Strategies for solving the reentrant job shop scheduling problem with setups. These metaheuristic strategies use combinations of critical path characteristics to gauge which heuristic decisions will have the greatest impact on reducing the average delay of the schedule. This research also investigates feasibility in light of iterative searches for the disjunctive graph of the reentrant job shop scheduling problem with sequence dependent setups. The class of strategies investigated in this thesis is problem specific and uses the inherent properties of the disjunctive graph to develop critical arc weights for prioritizing the candidate list for arc reversals. There are 3 subclasses of Critical Arc Strategies presented in this thesis. The Delay Weighted Critical Arc (DWCA) strategy uses linear combinations of a critical arc’s operation delay and the job delays for which it is a member of the job’s specific critical path. The viii Sequentially Weighted Critical Arc (SWCA) strategies rank the candidates based on the number of critical paths, critical arcs, or accumulated operation delays they influence based on critical path membership. The Exponentially Weighted Critical Arc (EWCA) strategy uses an exponentially weighted average of the critical arc operation delays the candidate influences, which are also based on critical path membership. These strategies aid the metaheuristic in identifying the most significant critical arcs in the graph, allowing it to find improvements faster than traditional tabu search methodologies. An elite candidate list strategy is applied to the candidates, which dynamically restricts the candidate list size based on search performance. Benchmarking experiments show that the Critical Arc Strategies outperform traditional tabu search candidate list strategies. Additional experiments show the value of applying the metaheuristic strategies to “best” policy generated solutions to minimize average delay in a schedule. These results show the value of applying the Critical Arc Strategies on realistic sized complex problems, such as semiconductor manufacturing facilities.
dc.format.mediumelectronicen
dc.language.isoengen
dc.rightsCopyright is held by the author. Presentation of this material on the Libraries' web site by University Libraries, The University of Texas at Austin was made possible under a limited license grant from the author who has retained all copyrights in the works.en
dc.subject.lcshProduction schedulingen
dc.titleCritical arc strategies for the reentrant job shop scheduling problem with setupsen
dc.description.departmentMechanical Engineeringen
dc.identifier.oclc61503018en
dc.identifier.proqst3115513en
dc.type.genreThesisen
thesis.degree.departmentMechanical Engineeringen
thesis.degree.disciplineMechanical Engineering.en
thesis.degree.grantorThe University of Texas at Austinen
thesis.degree.levelDoctoralen
thesis.degree.nameDoctor of Philosophyen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record