A COMPARISON OF SEQUENCING RULES FOR A TWO-STATE HYBRID FLOW SHOP |
| |
Authors: | Seetharama L. Narasimhan Paul M. Mangiameli |
| |
Affiliation: | Department of Management Science, College of Business Administration, University of Rhode Island, Kingston, RI 02881 |
| |
Abstract: | ![]() A common manufacturing environment in many industries (such as the glass, steel, paper, costume jewelry, and textile industries) is a hybrid flow shop. This system has continuous-process machinery in the fist state of manufacturing and repetitive-batch equipment in the second. Little research has investigated this type system. Scheduling managers of hybrid flow shops tend either to use existing job-shop rules or to devise their own rules. These approaches often are less than adequate for efficient scheduling. In this paper we extend the rule presented by Narasimhan and Panwalker [4] to include a general class of hybrid flow shops. This extenstion, called the generalized cumulative minimum-deviation (GCMD) rule, is compared under various operation conditions to three other sequencing rules: shortest processing time, longest processing time, and minimum deviation. The operating conditions are determined by the number of machines at both stages. The results of 7200 simulation runs demonstrate that the GCMD rule is better than the other rules in minimizing each of five chosen criteria. Thus, the GCMD rule can help managers to schedule hybrid flow shops efficiently to achieve various corporate objectives. |
| |
Keywords: | Heuristics Production/Operations Management Scheduling Simulation |
|
|