Using simulation based approach to improve on the mean cycle time performance of dispatching rules

Proceedings - Winter Simulation Conference

Volumn 2005, Issue , 2005, Pages 2194-2202

  Chin, Soon Chong ^a   Low, Malcolm Yoke Hean ^a   Sivakumar, Appa Iyer ^b   Gay, Kheng Leng ^c  

^a SINGAPORE INSTITUTE OF MANUFACTURING TECHNOLOGY   (Singapore)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^c NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; HEURISTIC METHODS; PROBLEM SOLVING; PRODUCT DEVELOPMENT; PRODUCTION CONTROL;

DISPATCHING RULES; MEAN CYCLE TIME; TABU SEARCH;

DISTRIBUTION OF GOODS;

EID: 33846650723     PISSN: 08917736     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WSC.2005.1574506     Document Type: Conference Paper

References (35)

1. Adams, J., Balas, E. and Zawack, D. 1998. The Shifting Bottleneck Procedure for Job Shop Scheduling, Management Science, 34 (1): 391-401.
2. Armentano, V. A. and Scrich, C.R. 2000. Tabu Search for Minimizing Total Tardiness in a Job Shop, Interna tional Journal of Production Economics, 63 (1): 131-140.
3. Applegate, D. and Cook, W. 1991. A Computational Study of the Job Shop Scheduling Problem, ORSA Journal on Computing, 3 (2): 149-156.
4. Balas, E. and Vazacopoulos, A. 1998. Guided Local Search with Shifting Bottleneck for Job Shop Scheduling, Management Science, 44 (2): 262-275.
5. Blackstone, J. H., Philips, D. T. and Hogg, G. L. 1982. A State-of-the-art Survey of Dispatching Rules for Manufacturing Job Shop Operations, International Journal of Production Research, 20 (1): 27-45.
6. Blazewicz, J., Domschke, W. and Pesch, E. 1996. The Job Shop Scheduling Problem: Conventional and New Solution Techniques, European Journal of Operational Research, 93 (1): 1-33.
7. Brucker, P., Jurisch, B. and Sievers, B. 1994. A Branch and Bound Algorithm for the Job Shop Scheduling Problem, Discrete Applied Mathematics, 49 (1): 109-127.
8. Buffa, E. S., 1968. Operations Management: Problems and Models, New York: John Wiley & Sons. 454-460.
9. Chen, D., Turner, S. J., Cai, W. T., Gan, B. P. and Low, Y. H. 2004. Incremental HLA-based Distributed Simulation Cloning, In Proceedings of the 2004 Winter Simulation Conference, ed. R. G. Ingalls, M. D. Rossetti, J. S. Smith, and B. A. Peters, 386-394. Piscataway, NJ: Institute of Electrical and Electronics Engineers.
10. Conway, R. W. and Maxwell., W. L. 1962. Network Dispatching by Shortest Operation Discipline, Operations Research, 10 (1): 51-62.
11. Elvers, D. E. 1974. The Sensitivity of the Relative Effectiveness of Job Shop Dispatching Rules with Various Arrival Distributions, AIIE Transactions., 6 (1): 41-54.
12. Fisher, H. and Thompson G. L. 1963. Probabilistic Learning Combination of Local Job Shop Scheduling Rules, Industrial Scheduling, 225-251.
13. Ganesan, V. K., Sivakumar A. I., and Srinivasan G. 2004. Hierarchical Minimization of Completion Time Variance and Makespan in Jobshops, Computers & Operations Research, (In press.)
14. Gere, W. S., Jr. 1966. Heuristics in jobshop scheduling, Management Science, 13 (1): 167-175.
15. Gilmer, J. B. and Sullivan. F. J. 2000. Recursive Simulation to Aid Models of Decisionmaking, In Proceedings of the 2000 Winter Simulation Conference, ed. J. A. Joines, R. R. Barton, K. Kang and P. A. Fishwick. 958-963. Piscataway, New Jersey: Institute of Electrical and Electronics Engineers.
16. Gilmer, J. B. and Sullivan. F. J. 2003. The Use of Recursive Simulation to Support Decisionmaking, In Proceedings of the 2003 Winter Simulation Conference, ed. S. Chick, P. J. Sanchez, D. Ferrin, and D. J. Morrice. 1116-1121. Piscataway, New Jersey: Institute of Electrical and Electronics Engineers.
17. Gilmer, J. B. 2004. An Urban Terrain Abstraction to Support Decision Making Using Recursive Simulation," In Proceedings of the 2004 Winter Simulation Conference, ed. R. G. Ingalls, M. D. Rossetti, J. S. Smith, and B. A. Peters, 982-988. Piscataway, New Jersey: Institute of Electrical and Electronics Engineers.
18. Holthaus, O. and Rajendran, C. 1997. Efficient Dispatching Rules for Scheduling in a Job Shop, International Journal of Production Economics, 48 (1): 87-105.
19. Hopp, W. J. and Spearman. M. L. 1996. Factory Physics: Foundations of Manufacturing Systems, Irwin, USA: Times Mirror.
20. Jain. A. S. and Meeran. S. 1999. Deterministic Job Shop Scheduling: Past, Present and Future, European Journal of Operational Research, 113 (2): 390-434.
21. Jeong, K. C. and Kim, Y. D. 1998. A Real-time Scheduling Mechanism for a Flexible Manufacturing System: Using Simulation and Dispatching Rules, International Journal of Production Research, 36 (9): 2609-2626.
22. Law, A. M. and Kelton, W. D. 1991. Simulation Modeling and Analysis, New York: McGraw-Hill, 298-323.
23. Lawrence, S. 1984. Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques (Supplement), Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburg, 1984.
24. Lee, L. H., Tang, L. C. and Chan, S. C. 2001. Dispatching Heuristic for Wafer Fabrication, In Proceedings of the 2001 Winter Simulation Conference, e.d. B. A. Peters, J. S. Smith, D. J. Medeiros, and M. W. Rohrer. 1215-1219. Piscataway, New Jersey: Institute of Electrical and Electronics Engineers.
25. Low, Y. H., Lye, K. W., Lendermann, P., Turner, S. J., Leo, S. and Chin, R. 2005. An Agent-based Approach for Managing Symbiotic Simulation of Semiconductor Assembly and Test Operations, In Proceedings of the 2005 International Conference on Autonomous Agent and Multiagent Systems, Utrecht, The Netherlands.
26. Mazziotti, B. W., and Home, Jr., R. E. 1997. Creating a Flexible, Simulation-based Finite Scheduling Tools, In Proceedings of the 1997 Winter Simulation Conference, ed. S. Andradottir, K.J. Healy, D.H. Withers, and B.L. Nelson, 853-858. Piscataway, New Jersey: Institute of Electrical and Electronics Engineers.
27. Min, H. S. and Yih, Y. W. 2003. Development of a Real-time Multi-objective Scheduler for a Semiconductor Fabrication System, International Journal of Production Research, 41 (10): 2345-2364.
28. Morito, S. and Lee, K. H. 1997. Efficient Simulation / Optimization of Dispatching Priority with "Fake" Processing Time, In Proceedings of the 1997 Winter Simulation Conference, ed. S. Andradottir, K.J. Healy, D.H. Withers, and B.L. Nelson, 872-879. Piscataway, New Jersey: Institute of Electrical and Electronics Engineers.
29. Nanot, Y. R. 1963. An Experimental Investigation and Comparative Evaluation of Priority Disciplines in Job-shop Like Queuing Networks, Management Science Research Project, UCLA, Research report, No. 87.
30. Nowicki, E. and Smutnicki, C. 1996. A Fast Taboo Search Algorithm for the Job Shop Problem, Management Science, 42 (6): 797-813.
31. Rajendran, C. and Holthaus, O. 1999. A Comparative Study of Dispatching Rules in Dynamic Flowshops and Jobshops, European Journal of Operational Research, 116(1): 156-170.
32. Sivakumar, A. I. 1999. Optimization of Cycle Time and Utilization in Semiconductor Test Manufacturing Using Simulation Based, On-line Near-real-time Scheduling System, In Proceedings of the 1999 Winter Simulation Conference, ed. P.A. Farington, H.B. Nembhard, D.T. Sturrok, and G.W. Evans, 727-735. Piscataway, New Jersey: Institute of Electrical and Electronics Engineers.
33. Storer, R. H., Wu, S. D. and Vaccari, R. 1992. New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling, Management Science, 38 (1): 1495-1509.
34. Yang, Y. and Chang, T. S. 1998. Multiobjective Scheduling for IC Sort and Test with a Simulation Testbed, IEEE Transactions on Semiconductor Manufacturing, 11(1): 304-315.
35. Yoo, T. J., Kim, D. H. and Cho, H. B. 2004. A New Approach to Multi-pass Scheduling in Shop Floor Control, In Proceedings of the 2004 Winter Simulation Conference, ed. R. G. Ingalls, M. D. Rossetti, J. S. Smith, and B. A. Peters, 1109-1114. Piscataway, New Jersey: Institute of Electrical and Electronics Engineers.