Show simple item record

dc.contributor.authorTra, Niem-Trung L.en_US
dc.date.accessioned2000-02-03en_US
dc.date.accessioned2014-03-14T20:31:04Z
dc.date.available2001-02-03en_US
dc.date.available2014-03-14T20:31:04Z
dc.date.issued2000-01-24en_US
dc.date.submitted2000-01-25en_US
dc.identifier.otheretd-01252000-11460050en_US
dc.identifier.urihttp://hdl.handle.net/10919/31036
dc.description.abstract

Despite recent advances in computer power and the development of better algorithms, theoretical scheduling methodologies developed for batch-chemical production are seldom applied in industry (Musier & Evans 1989 and Grossmann et al. 1992). Scheduling decisions may have significant impact on overall company profitability by defining how capital is utilized, the operating costs required, and the ability to meet due dates. The purpose of this research is to compare different production scheduling methods by applying them to a real-world multi-stage, multi-product, batch-chemical production line. This research addresses the problem that the theoretical algorithms are seldom applied in industry and allows for performance analysis of several theoretical algorithms.

The research presented in this thesis focuses on the development and comparison of several scheduling algorithms. The two objectives of this research are to: 1. modify different heuristic production scheduling algorithms to minimize tardiness for a multi-product batch plant involving multiple processing stages with several out-of-phase parallel machines in each stage; and 2. compare the robustness and performance of these production schedules using a stochastic discrete event simulation of a real-world production line. The following three scheduling algorithms are compared: 1. a modified Musier and Evans scheduling algorithm (1989); 2. a modified Ku and Karimi Sequence Building Algorithm (1991); and 3. a greedy heuristic based on an earliest-due-date (EDD) policy. Musier and Evans' heuristic improvement method (1989) is applied to the three algorithms. The computation times to determine the total tardiness of each schedule are compared. Finally, all the schedules are tested for robustness and performance in a stochastic setting with the use of a discrete event simulation (DES) model. Mignon, Honkomp, and Reklaitis' evaluation techniques (1995) and Multiple Comparison of the Best are used to help determine the best algorithm.

en_US
dc.publisherVirginia Techen_US
dc.relation.haspartVita.pdfen_US
dc.relation.haspartintro.pdfen_US
dc.relation.haspartcode.pdfen_US
dc.relation.haspartchp8b.pdfen_US
dc.relation.haspartchp6.pdfen_US
dc.relation.haspartchp5.pdfen_US
dc.rightsI hereby grant to Virginia Tech or its agents the right to archive and to make available my thesis or dissertation in whole or in part in the University Libraries in all forms of media, now or hereafter known. I retain all proprietary rights, such as patent rights. I also retain the right to use in future works (such as articles or books) all or part of this thesis or dissertation.en_US
dc.subjectgeneralized serial networken_US
dc.subjectscheduling algorithmsen_US
dc.subjectmultiproducten_US
dc.subjectmulti-producten_US
dc.subjectschedule evaluationen_US
dc.subjectchemical planten_US
dc.subjectbatch schedulingen_US
dc.titleComparison of Scheduling Algorithms for a Multi-Product Batch-Chemical Plant with a Generalized Serial Networken_US
dc.typethesisen_US
dc.contributor.departmentIndustrial and Systems Engineeringen_US
thesis.degree.nameMaster of Scienceen_US
thesis.degree.levelmastersen_US
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen_US
dc.contributor.committeememberEllis, Kimberly P.en_US
dc.contributor.committeememberBish, Ebru K.en_US
dc.identifier.sourceurlhttp://scholar.lib.vt.edu/theses/available/etd-01252000-11460050/en_US
dc.contributor.committeecochairKoelling, Charles Patricken_US
dc.contributor.committeecochairKobza, John E.en_US


Files in this item

Thumbnail
Thumbnail
Thumbnail
Thumbnail
Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record