Using dispatching rules for job shop scheduling with due date-based objectives

International Journal of Production Research

Volumn 45, Issue 14, 2007, Pages 3245-3262

  Chiang, T C ^a   Fu, L C ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Dispatching rules; Due dates; Jop shop; Scheduling

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; PRODUCT DESIGN; SCHEDULING;

DISPATCHING RULES; DUE DATES; JOP SHOPS;

INDUSTRIAL RESEARCH;

EID: 34249341750     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540600786715     Document Type: Article

References (24)

1. Abu-Suleiman, A., Pratt, D.B. and Boardman, B., The modified critical ratio: towards sequencing with a continuous decision domain. Int. J. Prod. Res., 2005, 43(15), 3287-3296.
2. Anderson, E.J. and Nyirenda, J.C., Two new rules to minimize tardiness in a job shop. Int. J. Prod. Res., 1990, 28(3), 2277-2292.
3. Appleton-Day, K. and Shao, L., Real-time dispatch gets real-time results in AMD's Fab25, in Proceedings of the IEEE/SEMI Advanced Semiconductor Manufacturing Conference and Workshop, 1997, pp. 444-447.
4. Barman, S., Simple priority rule combinations: an approach to improve both flow time and tardiness. Int. J. Prod. Res., 1997, 35(10), 2857-2870.
5. Barman, S., The impact of priority rule combinations on lateness and tardiness. IIE Trans., 1998, 30, 495-504.
6. Chang, Y.-L., Sueyoshi, T. and Sullivan, R.S., Ranking dispatching rules by data envelopment analysis in a job shop environment. IIE Trans., 1996, 28, 631-642.
7. Chiang, T.-C. and Fu, L.-C., Solving the FMS scheduling problem by critical ratio-based heuristics and the genetic algorithm, in Proceedings of the IEEE Conference on Robotics and Automation, 2004, Vol. 3, pp. 3131-3136.
8. Deb, K., Pratap, A., Agarwal, S. and Meyarivan, T., A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. Evol. Computat., 2002, 6(2), 181-197.
9. Demirkol, E., Mehta, S. and Uzsoy, R., Benchmarks for shop scheduling problems. Eur. J. Oper. Res., 1998, 109, 137-141.
10. Giegandt, A. and Nicholson, G., Better dispatch application -a success story, in Proceedings of the IEEE/SEMI Advanced Semiconductor Manufacturing Conference and Workshop, 1998, pp. 396-399.
11. Jayamonhan, M.S. and Rajendran, C., New dispatching rules for shop scheduling: a step forward. Int. J. Prod. Res., 2000, 38(3), 563-586.
12. Jeong, K.-C. and Kim, Y.-D., A real-time scheduling mechanism for a flexible manufacturing system: using simulation and dispatching rules. Int. J. Prod. Res., 1998, 36(9), 2609-2626.
13. Kim, M.H. and Kim, Y.-D., Simulation-based real-time scheduling in a flexible manufacturing system. J. Manuf. Sys., 1994, 13(2), 85-93.
14. Kim, Y.-D., Shim, S.-O., Choi, B. and Hwang, H., Simplification methods for accelerating simulation-based real-time scheduling in a semiconductor wafer fabrication facility. IEEE Trans. Semiconduct. Manuf., 2003, 16(2), 290-298.
15. Lodree Jr, E., Jang, W. and Klein, C.M., A new rule for minimizing the number of tardy jobs in dynamic flow shops. Eur. J. Oper. Res., 2004, 159, 258-263.
16. Moser, M. and Engell, S., A survey of priority rules for FMS scheduling and their performance for the benchmark problem, in Proceedings of the 31st Conference on Decision and Control, 1992, pp. 392-397.
17. Pierreval, H. and Mebarki, N., Dynamic selection of dispatching rules for manufacturing system scheduling. Int. J. Prod. Res., 1997, 35, 1575-1591.
18. Raghu, T.S. and Rajendran, C., An efficient dynamic dispatching rule for scheduling in a job shop. Int. J. Prod. Econ., 1993, 32, 301-313.
19. Rajendran, C. and Holthaus, O., A comparative study of dispatching rules in dynamic flowshops and job shops. Eur. J. Oper. Res., 1999, 116, 156-170.
20. Rose, O., Some issues of the critical ratio dispatch rule in semiconductor manufacturing, in Proceedings of the 2002 Winter Simulation Conference, 2002, pp. 1401-1405.
21. Russell, R.S., Dar-El, E.M. and Taylor III, B.W., A comparative analysis of the COVERT job sequencing rule using various shop performance measures. Int. J. Prod. Res., 1987, 25(10), 1523-1540.
22. Shafaei, R. and Brunn, P., Workshop scheduling using practical (inaccurate) data -Part 2: an investigation of the robustness of scheduling rules in a dynamic and stochastic environment. Int. J. Prod. Res., 1999a, 37(18), 4105-4117.
23. Shafaei, R. and Brunn, P., Workshop scheduling using practical (inaccurate) data - Part 1: the performance of heuristic scheduling rules in a dynamic job shop environment using a rolling time horizon approach. Int. J. Prod. Res., 1999b, 37(17), 3913-3925.
24. Vepsalainen, A.P.J. and Morton, T.E., Priority rules for job shops with weighted tardiness costs. Manage. Sci., 1987, 33(8), 1035-1047.