A case-injected genetic algorithm for single machine scheduling problems with release time

International Journal of Production Economics

Volumn 103, Issue 2, 2006, Pages 551-564

  Chang, Pei Chann ^a   Hsieh, Jih Chang ^b   Liu, Chen Hao ^a  

^a YUAN ZE UNIVERSITY   (Taiwan)

^b VANUNG UNIVERSITY   (Taiwan)

Author keywords

Case based reasoning; Genetic algorithm; Single machine scheduling

Indexed keywords

PROBLEM SOLVING; SCHEDULING; SET THEORY;

CASE-BASED REASONING; GENETIC ALGORITHM; SINGLE-MACHINE SCHEDULING;

GENETIC ALGORITHMS;

EID: 33745846840     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2005.11.003     Document Type: Article

References (28)

1. Baker K.R. Introduction to Sequence and Scheduling (1974), Wiley, New York
2. Bianco L., Ricciardelli S., Rinaldi G., and Sassano A. Scheduling tasks with sequence-dependent processing times. Naval Research Logistics 35 (1988) 177-184
3. Biskup D., and Piewitt W. A note on 'An efficient algorithm for the single-machine tardiness problem'. International Journal of Production Economics 66 (2000) 287-292
4. Chand S., Traub R., and Uzsoy R. An iterative heuristic for the single machine dynamic total completion time scheduling problem. Computers and Operations Research 23 (1996) 641-651
5. Chang P.C., Hsieh J.C., and Lin S.G. The development of gradual priority weighting approach for the multi-objective flowshop scheduling problem. International Journal of Production Economics 79 3 (2002) 171-181
6. Chang P.C., Hsieh J.C., and Wang Y.W. Genetic algorithms applied in BOPP film scheduling problems. Applied Soft Computing 3 (2003) 139-148
7. Cheng R., Gen M., and Tsujimura Y. A tutorial survey of job-shop scheduling problems using genetic algorithms-I. Representation. Computers and Industrial Engineering 30 (1996) 983-997
8. Cheng R., Gen M., and Tsujimura Y. A tutorial survey of job-shop scheduling problems using genetic algorithms: Part II. Hybrid genetic search strategies. Computers and Industrial Engineering 37 (1999) 51-55
9. Chu C. A branch-and-bound algorithm to minimize total flow time with unequal release dates. Naval Research Logistics 39 (1992) 859-875
10. Della Croce F., and T'Kindt V. A recovering beam search algorithm for the one-machine dynamic total completion time scheduling problem. Journal of the Operational Research Society 53 (2002) 1275-1280
11. Deogun J.S. On scheduling with ready times to minimize mean flow time. The Computer Journal 26 (1983) 320-328
12. Dessouky M.I., and Deogun J.S. Sequencing jobs with unequal ready times to minimize mean flow time. SIAM Journal on Computing 10 (1981) 192-202
13. Goldberg D.E. Genetic Algorithms in Search, Optimization, and Machine Learning (1989), Addison-Wesley Publishing Company, Inc., Reading, MA
14. Hariri A.M.A., and Potts C.N. An algorithm for single machine sequencing with release dates to minimize total weighted completion time. Discrete Applied Mathematics 5 (1983) 99-109
15. Koh S.G., Koo P.H., Kim D.C., and Hur W.S. Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families. International Journal of Production Economics 98 (2005) 81-96
16. Koton, P., 1989. SMART plan: A case-based resource allocation and scheduling system. In: Proceedings of the Case-Based Reasoning Workshop, Pensacola, FL, pp. 285-294.
17. Lee C.K.M., Lau H.C.W., Yu K.M., and Fung R.Y.K. Development of a dynamic data interchange scheme to support product design in agile manufacturing. International Journal of Production Economics 87 (2004) 295-308
18. Liu J., and MacCarthy B.L. Effective heuristics for the single machine sequencing problem with ready times. International Journal of Production Research 29 (1991) 1521-1533
19. Louis, S.J., Xu, Z., 1996. Genetic algorithms for open shop scheduling and re-scheduling. In: Proceedings of the ISCA 11th International Conference on Computers and their Applications, pp. 99-102.
20. Melouk S., Damodaran P., and Chang P.Y. Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing. International Journal of Production Economics 87 (2004) 141-147
21. Miyashita K. Case-based knowledge acquisition for schedule optimization. Artificial Intelligence in Engineering 9 (1995) 277-287
22. Oman S., and Cunningham P. Using case retrieval to seed genetic algorithms. International Journal of Computational Intelligence and Applications 1 (2001) 71-82
23. Ramsey, C., Grefensttete, J., 1993. Case-based initialization of genetic algorithms. In: Proceedings of the Fifth International Conference on Genetic Algorithms, San Mateo.
24. Reeves C. Heuristics for scheduling a single machine subject to unequal job release times. European Journal of Operational Research 80 (1995) 397-403
25. Schmidt G. Modeling production scheduling systems. International Journal of Production Economics 46-47 (1996) 109-118
26. Schmidt G. Case-based reasoning for production scheduling. International Journal of Production Economics 56-57 (1998) 537-546
27. Sheppard, J.W., Sakzburg, S.L., 1995. Combining genetic algorithms with memory based reasoning. In: Proceedings of the Sixth International Conference on Genetic Algorithms, San Mateo, CA.
28. Süer, G.A., Vazquez, R., Santos, J., 1999. Evolutionary programming for minimizing the average flow time in the presence of non-zero ready times. In: Proceedings of the 25th International Conference on Computers and Industrial Engineering, New Orleans, LA, March.