Evaluation Dispatching Rules for Two-Stage Hybrid Flow Shop Scheduling with Parallel Machines

Article Preview

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.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1487-1491

Citation:

Online since:

January 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] M. L. Pinedo. Scheduling: Theory, Algorithm, and System 3rd Edition. New York: Springer Science and Business Media. (2008).

Google Scholar

[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.

DOI: 10.1007/978-3-642-80784-8_7

Google Scholar

[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.

Google Scholar

[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.

DOI: 10.23919/acc.2004.1386773

Google Scholar

[5] N. Grangeon, A. Tanguy, N. Tchernev. Generic Simulation Model for Hybrid Flow-Shop. Computer & Industrial Engineering. Vol. 37 (1999), pp.207-210.

DOI: 10.1016/s0360-8352(99)00056-x

Google Scholar

[6] P. D. D. Dominic, S. Kaliyamoorthy. M. S. Kumar. Efficient dispatching rules for dynamic job shop scheduling. Int. J. Adv. Manuf. Technol. Vol. 24 (2004), pp.70-75.

Google Scholar

[7] P. Parthanadee, J. Buddhakulsomsiri. Simulation modeling and analysis for production scheduling using real time dispatching rules: A case study in canned fruit industry. Computer and Electronic in Agriculture. Vol. 70 (2010), pp.245-255.

DOI: 10.1016/j.compag.2009.11.002

Google Scholar

[8] B. Scholz-Reiter, J. Heger and T. Hildebrandt. Analysis and comparison of dispatching rule-based scheduling in dual-resource constrained shop-floor scenarios. Proceedings of the World Congress on Engineering and Computer Science 2009 Vol. 2 WCECS 2009, October 20-22, (2009).

DOI: 10.1007/978-90-481-9419-3_21

Google Scholar