Affiliation:
1. Rajamangala University of Technology Rattanakosin
Abstract
This paper considers two stage hybrid flow shop with identical parallel machine and evaluate performance of common dispatching rules; shortage processing time (SPT) longest processing time (LPT) earliness due date (EDD) and first in first out (FIFO). The objectives are to determine makespan and total tardiness have been minimized. To evaluated performance of dispatching rules, the results have been compared on each criterion. The experimental results show that SPT outperform than other rules with minimizes makespan as an objective function for all problems. On the other hand, for minimize total tardiness as an objective. The EDD rule outperform than other rules.
Publisher
Trans Tech Publications, Ltd.
Reference8 articles.
1. M. L. Pinedo. Scheduling: Theory, Algorithm, and System 3rd Edition. New York: Springer Science and Business Media. (2008).
2. M. S. Salvador. A solution to a special case of flow shop scheduling problems. In symposium of the theory of scheduling and applications, (eds. ) SE Elmaghraby, Springer-Verlag, New York. (1973). pp.83-91.
3. W. P. Syam and I. M. Al-Harkan. Comparison of Three Meta Heuristic to Optimize Hybrid Flow Shop Scheduling Problem with Parallel Machines. World Academy of Science, Engineering and Technology. Vol. 62 (2010), pp.271-278.
4. J. Chang, W. Yan, H. Shao. Scheduling a two-stage no-wait hybrid flow shop with separated setup and removal times. Proc. of the 2004 American Control Conference. Boston. (2004), pp.1412-1416.
5. N. Grangeon, A. Tanguy, N. Tchernev. Generic Simulation Model for Hybrid Flow-Shop. Computer & Industrial Engineering. Vol. 37 (1999), pp.207-210.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献