A rule-centric memetic algorithm to minimize the number of tardy jobs in the job shop

International Journal of Production Research

Volumn 46, Issue 24, 2008, Pages 6913-6931

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

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Job shop scheduling; Memetic algorithm; Priority rules

Indexed keywords

ANNEALING; SCHEDULING;

JOB SHOP-SCHEDULING; JOB SHOPS; LOCAL SEARCH PROCEDURES; MEMETIC ALGORITHM; MEMETIC ALGORITHMS; NUMBER OF TARDY JOBS; PAPER ADDRESSES; PRIORITY RULES; SCHEDULING PROBLEMS; SEQUENCING PROBLEMS;

SIMULATED ANNEALING;

EID: 55349112552     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540701420578     Document Type: Article

References (42)

1. Adenso-Diaz, B., An SA/TS mixture algorithm for the scheduling tardiness problem. Eur. J. Oper. Res., 1996, 88, 516-524.
2. Anderson, E.J. and Nyirenda, J.C., Two new rules to minimize tardiness in a job shop. Int. J. Prod. Res., 1990, 28, 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. Armentano, V.A. and Ronconi, D.P., Tabu search for total tardiness minimization in flowshop scheduling problems. Comput. Oper. Res., 1999, 26, 219-235.
5. Cai, L.W., Wu, Q.H. and Yong, Z.Z., A genetic algorithm with local search for solving job problems. Lecture Notes Comput. Sci., 2000, 1803, 107-116.
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. Cheng, R., Gen, M. and Tsujimura, Y., A tutorial survey of job-shop scheduling problems using genetic algorithms -I. Representation. Comput. Ind. Eng., 1996, 30, 983-997.
8. Cheng, R., Gen, M. and Tsujimura, Y., A tutorial survey of job-shop scheduling using genetic algorithms -II. Hybrid genetic search strategies. Comput. Ind. Eng., 1999, 36, 343-364.
9. 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, pp. 3131-3136.
10. Chiang, T.-C. and Fu, L.-C., A virtual pre-emption paradigm for using priority rules for solve job shop-scheduling problems, in Proceedings of the IEEE Conference on Robotics and Automation, 2005, pp. 3714-3719.
11. Costa, M.T. and Ferreira, J.S., A simulation analysis of sequencing rules in a flexible flowline. Eur. J. Oper. Res., 1999, 119, 440-450.
12. Crauwels, H.A.J., Potts, C.N. and Van Wassehnhove, L.N., Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs. Eur. J. Oper. Res., 1996, 90, 200-213.
13. Croce, F.D., Generalized pairwise interchanges and machine scheduling. Eur. J. Oper. Res., 1995, 83, 310-319.
14. Dorn, J., Girsch, M., Skele, G. and Slany, W., Comparison of iterative improvement techniques for schedule optimization. Eur. J. Oper. Res., 1996, 94, 349-361.
15. Duvivier, D., Preux, Ph., Fonlupt, C., Robilliard, D. and Talbi, E.-G., The fitness function and its impact on local search methods, in Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 1998, Vol. 3, pp. 11-14.
16. Franca, P.M., Mendes, A. and Moscato, P., A memetic algorithm for the total tardiness single machine scheduling problem. Eur. J. Oper. Res., 2001, 132, 224-242.
17. 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.
18. Glover, F., Tabu search - part I. ORSA J. Comput., 1989a, 1, 190-206.
19. Glover, F., Tabu search - part II. ORSA J. Comput., 1989b, 2, 4-32.
20. Goldberg, D.E., Genetic Algorithms in Search, Optimization and Machine Learning, 1989 (Addison-Wesley: Reading, MA).
21. Goncalves, J.F., Mendes, J.J. de M. and Resende, M.G.C., A hybrid genetic algorithm for the job shop-scheduling problem. Eur. J. Oper. Res., 2005, 167, 77-95.
22. He, Z., Yang, T. and Tiger, A., An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling. Eur. J. Oper. Res., 1996, 91, 99-117.
23. Hertz, A. and Widmer, M., Guidelines for the use of meta-heuristics in combinatorial optimization. Eur. J. Oper. Res., 2003, 151, 247-252.
24. Hsieh, J.-C., Chang, P.-C. and Hsu, L.-C., Scheduling of drilling operations in printed circuit board factory. Comput. Ind. Eng., 2003, 44, 461-473.
25. Hsu, K.H. and Lan, C.C., Photolithography area dispatching scheme for advanced technology in foundry fabs, in Proceedings of the Semiconductor Manufacturing Technology Workshop, 2000, pp. 211-216.
26. Kim, M.H. and Kim, Y.-D., Simulation-based real-time scheduling in a flexible manufacturing system. J. Mcmuf. Sys., 1994, 13, 85-93.
27. Kim, Y.-D., Kim, J.G., Choi, B. and Kim, H.-U., Production scheduling in a semiconductor wafer fabrication facility producing multiple product types with distinct due dates. IEEE Trans. Robot. Automat., 2001, 17, 589-598.
28. Kreipl, S., A large step random walk for minimizing total weighted tardiness in a job shop. J. Schedul., 2000, 3, 125-138.
29. Mattfeld, D.C. and Bierwirth, C., An efficient genetic algorithm for job shop-scheduling with tardiness objectives. Eur. J. Oper. Res., 2004, 155, 616-630.
30. Moscato, P., On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms, 1989. Caltech Concurrent Computation Program, C3P Report No. 826.
31. Murata, T., Ishibuchi, H. and Gen, M., Neighbourhood structures for genetic local search algorithms, in Proceedings of the International Conference on Knowledge-based Intelligent Electronic Systems, 1998, pp. 259-263.
32. Panwalkar, S.S., A survey of scheduling rules. Oper. Res., 1977, 25, 45-61.
33. Raghu, T.S. and Rajendran, C., An efficient dynamic dispatching rule for scheduling in a job shop. Int. J. Prod. Econ., 1993, 32, 30-313.
34. Rajendran, C. and Ziegler, H., Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent set-up times. Eur. J. Oper. Res., 2003, 149, 513-522.
35. Sabuncuoglu, I., A study of scheduling rules of flexible manufacturing systems: a simulation approach. Int. J. Prod. Res., 1998, 36, 527-546.
36. Sevaux, M. and Dauzere-Peres, S., Genetic algorithms to minimize the weighted number of late jobs on a single machine. Eur. J. Oper. Res., 2003, 151, 296-306.
37. Taillard, E.D., Gambardella, L.M., Gendreau, M. and Potvin, J.-Y., Adaptive memory programming: a unified view of metaheuristics. Eur. J. Oper. Res., 2001, 135, 1-16.
38. Vaessens, R.J.M., Aarts, E.H.L. and Lenstra, J.K., Job shop-scheduling by local search. INFORMS J. Comput., 1996, 8, 302-317.
39. Van Laarhoven, P.J.M. and Aarts, E.H.L., Simulated Annealing: Theory and Applications, 1987 (Reidel: Dordrecht).
40. Vepsalainen, A.P.J. and Morton, T.E., Priority rules for job shops with weighted tardiness costs. Manag. Sci., 1987, 33, 1035-1047.
41. Wang, L. and Zheng, D.-Z., An effective hybrid optimization strategy for job-shop scheduling problems. Comput. Oper. Res., 2001, 28, 585-596.
42. Yang, T., Kuo, Y. and Chang, I., Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors - a case study. Int. J. Prod. Res., 2004, 42, 4015-4030.