Generating dispatching rules for semiconductor manufacturing to minimize weighted tardiness

Proceedings - Winter Simulation Conference

Volumn , Issue , 2010, Pages 2504-2515

  Pickardt, Christoph ^a   Branke, Jürgen ^a   Hildebrandt, Torsten ^b   Heger, Jens ^b   Scholz Reiter, Bernd ^b  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX MANUFACTURING SYSTEMS; DISPATCHING RULES; METAHEURISTIC; SEMICONDUCTOR MANUFACTURING; WEIGHTED TARDINESS;

DISCRETE EVENT SIMULATION; GENETIC ALGORITHMS; GENETIC PROGRAMMING; GLOBAL OPTIMIZATION; HEURISTIC ALGORITHMS; MANUFACTURE; SEMICONDUCTOR DEVICE MANUFACTURE;

INDUSTRIAL APPLICATIONS;

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

References (30)

1. Ashlock, D. 2005. Evolutionary computation for modeling and optimization. Springer.
2. Baker, K. R. 1977. An experimental study of the effectiveness of rolling schedules in production planning. Decision Sciences 8 (1): 19-27.
3. Blackstone, J. H., D. T. Phillips, and G. L. Hogg. 1982. A state-of-the-art survey of dispatching rules for manufacturing job shop operations. International Journal of Production Research 20 (1): 27-45.
4. Boesel, J., B. L. Nelson, and S.-H. Kim. 2003. Using ranking and selection to "clean up" after simulation optimization. Operations Research 51 (5): 814-825.
5. Branke, J., and D. C. Mattfeld. 2005. Anticipation and flexibility in dynamic scheduling. International Journal of Production Research 43 (15): 3103-3129.
6. Burke, E. K., M. Hyde, G. Kendall, G. Ochoa, E. Ozcan, and J. Woodward. 2010. A classification of hyper-heuristics approaches. In Handbook of Meta-heuristics (2nd ed.)., ed. M. Gendreau and J.-Y. Potvin. Springer. Forthcoming.
7. Dimopoulos, C., and A. M. S. Zalzala. 2001. Investigating the use of genetic programming for a classic one-machine scheduling problem. Advances in Engineering Software 32 (6): 489-498.
8. ECJ 2009. A Java-based Evolutionary Computation Research System, project homepage. http://cs.gmu.edu/∼eclab/projects/ecj/, last accessed 15th January 2010.
9. Feigin, G., J. Fowler, and R. Leachman. 1996. Masm test data sets. http://www.eas.asu.edu/∼masmlab. Last accessed on 28th May 2009.
10. Fisher, H., and G. L. Thompson. 1963. Probabilistic learning combinations of local job-shop scheduling rules. In Industrial Scheduling, ed. J. F. Muth and G. L. Thompson, 225-251. Prentice-Hall.
11. Fu, M. 2001. Simulation optimization. In Winter Simulation Conference, 53-61: IEEE.
12. Geiger, C., R. Uzsoy, and H. Aytug. 2006. Rapid modeling and discovery of priority dispatching rules: an autonomous learning approach. Journal of Scheduling 9 (1): 7-34. (Pubitemid 43063747)
13. Geiger, C. D., and R. Uzsoy. 2008. Learning effective dispatching rules for batch processor scheduling. International Journal of Production Research 46 (6): 1431-1454. (Pubitemid 350157675)
14. Hart, E., P. Ross, and D. Corne. 2005. Evolutionary scheduling: A review. Genetic Programming and Evolvable Machines 6 (2): 191-220. (Pubitemid 40536281)
15. Haupt, R. 1989. A survey of priority rule-based scheduling. OR Spektrum 11 (1): 3-16.
16. Hildebrandt, T., J. Heger, and B. Scholz-Reiter. 2010. Towards improved dispatching rules for complex shop floor scenarios - a genetic programming approach. In Genetic and Evolutionary Computation Conference. (accepted paper, to appear).
17. Holthaus, O., and C. Rajendran. 2000. Efficient jobshop dispatching rules: further developments. Production Planning & Control 11 (2): 171-178. (Pubitemid 35394368)
18. Huffman, B. J. 2001. An object-oriented version of SIMLIB (a simple simulation package). INFORMS Transactions on Education 2 (1): 1-15.
19. Jayamohan, M. S., and C. Rajendran. 2000. New dispatching rules for shop scheduling: a step forward. International Journal of Production Research 38 (3): 563-586. (Pubitemid 35395465)
20. Kanet, J. J., and X. Li. 2004. A weighted modified due date rule for sequencing to minimize weighted tardiness. Journal of Scheduling 7:261-276.
21. Koza, J. R. 1992. Genetic programming: On the programming of computers by means of natural selection. Cambridge, MA, USA: MIT Press.
22. Law, A. M. 2007. Simulation modeling and analysis. 4. ed. Boston, USA et al.: McGraw-Hill.
23. Lee, Y. H., K. Bhaskaran, and M. Pinedo. 1997. A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transactions 29 (1): 45-52. (Pubitemid 127754351)
24. Mason, S. J., J. W. Fowler, W. M. Carlyle, and D. C. Montgomery. 2005. Heuristics for minimizing total weighted tardiness in complex job shops. International Journal of Production Research 43 (10): 1943-1963.
25. Panwalkar, S. S., and W. Iskander. 1977. A survey of scheduling rules. Operations Research 25 (1): 45-61.
26. Pfund, M. E., S. J. Mason, and J. W. Fowler. 2006. Handbook of production scheduling, Volume 89, Chapter Semiconductor manufacturing scheduling and dispatching, 213-241. Springer US.
27. Rajendran, C., and O. Holthaus. 1999, July. A comparative study of dispatching rules in dynamic flowshops and jobshops. European Journal of Operational Research 116 (1): 156-170.
28. Tay, J. C., and N. B. Ho. 2008. Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Computers & Industrial Engineering 54 (3): 453-473.
29. Uzsoy, R., C. Y. Lee, and L. A. Martin-Vega. 1992. A review of production planning and scheduling models in the semiconductor industry part i: system characteristics, performance evaluation, and production planning. IIE Transactions 24:47-60.
30. Vepsalainen, A. P. J., and T. E. Morton. 1987, Aug., 1987. Priority rules for job shops with weighted tardiness costs. Management Science 33 (8): 1035-1047.