A genetic algorithm with sub-indexed partitioning genes and its application to production scheduling of parallel machines

Computers and Industrial Engineering

Volumn 48, Issue 1 SPEC. ISS., 2005, Pages 39-54

  Jou, Chichang ^a  

^a TAMKANG UNIVERSITY   (Taiwan)

Author keywords

Flow shop; Genetic algorithms; Parallel machines; Production scheduling

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL OPERATORS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SCHEDULING;

FLOW SHOP; PARALLEL MACHINES; PARTITIONING GENES; PRODUCTION SCHEDULING;

GENETIC ALGORITHMS;

EID: 10844245552     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2004.07.007     Document Type: Article

References (32)

1. Aarts, E., & Korst, J. (1989). Simulated annealing and Boltzmann machines: A stochastic approach to combinatorial optimization and neural computing. New York: Wiley.
2. Adamopoulos, G. I., & Pappis, C. P. (1996). Scheduling jobs with different, job-dependent carliness and tardiness penalties using the SLK method. European Journal of Operational Research, 88(2), 336-344.
3. Ahmed, M. U., & Sundararaghavan, P. S. (1990). Minimizing the weighted sum of late and early completion penalties in a single machine. IIE Transaction, 22(3), 288-290.
4. Armentano, V. A., & Ronconi, D. P. (1999). Tabu search for total tardiness minimization in flowshop scheduling problems. Computers and Operations Research, 26(3), 219-235.
5. Bean, J. (1994). Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing, 6(2), 154-160.
6. Ben-Daya, M., & Al-Fawzan, M. (1998). A Tabu search approach for the flow shop scheduling problem. European Journal of Operational Research, 109(1), 88-95.
7. Bonet, B., & Geffner, H. (1999). Planning as heuristic search: New results. In S. Biundo, & M. Fox (Eds.), Proceedings of the fifth European conference on planning, Durham, UK, 359-371.
8. Brandimarte, P., & Calderini, M. (1995). A heuristic bicriterion approach to integrated process plan selection and job shop scheduling. International Journal of Production Research, 22(1), 161-181.
9. Cheng, T. C. E. (1989). A heuristic for common due-date assignment and job scheduling on parallel machines. Journal of the Operational Research Society, 40(12), 1129-1135.
10. Cheng, T. C. E., & Chen, Z. L. (1994). Parallel-machine scheduling problem with earliness and tardiness penalties. Journal of the Operational Research Society, 45(6), 685-695.
11. Cheng, R., Gen, M., & Tozawa, T. (1995). Minmax earliness/tardiness scheduling in identical parallel machine system using genetic algorithms. Computers and Industrial Engineering, 29(1-4), 513-517.
12. Cheng, T. C. E., & Sin, C. C. S. (1990). A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research, 47(3), 271-292.
13. De, P., Ghosh, J. B., & Wells, C. E. (1991). Scheduling to minimize weighted earliness and tardiness about a common due date. Computers and Operations Research, 18(5), 465-475.
14. Gao, L., Wang, C., Wang, D., Yin, Z., & Wang, S. (1998). A production scheduling system for parallel machine in an electrical appliance plant. Computers and Industrial Engineering, 35(1-2), 105-108.
15. Gen, M., & Cheng, R. (1997). Genetic algorithms and engineering design. New York: Wiley.
16. Goldberg, D. (1989). Genetic algorithms in search, optimization, and machine learning. New York: Addison-Wesley.
17. Graves, S. C. (1981). A review of production scheduling. Operations Research, 29(4), 646-675.
18. Hall, N. G., & Posner, M. E. (1991). Earliness-tardiness scheduling problems I: Weighted deviation of completion times about a common due date. Operations Research, 39(5), 836-846.
19. Haq, A. N., Karthikeyan, T., & Dinesh, M. (2003). Scheduling decisions in FMS using a heuristic approach. International Journal of Advanced Manufacturing Technology, 22(5), 374-379.
20. Holland, J. H. (1975). Adaptation in natural and artificial systems. Ann Arbor: University of Michigan Press.
21. Kacem, I. (2003). Genetic algorithm for the flexible job-shop scheduling problem. Proceedings of IEEE international conference on systems, man and cybernetics, 4, 3464-3469.
22. Lee, C. Y., Danusaputro, S. L., & Lin, C. S. (1991). Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date. Computers and Operations Research, 18(4), 379-389.
23. Lee, Y. H., Jeong, C. S., & Moon, C. (2002). Advanced planning and scheduling with outsourcing in manufacturing supply chain. Computers and Industrial Engineering, 43(2), 351-374.
24. Li, C., & Cheng, T. C. E. (1993). The parallel min-max weighted absolute lateness scheduling problem. Naval Research Logistics, 41, 33-46.
25. Liu, J., & Tang, L. (1999). A modified genetic algorithm for single machine scheduling. Computers and Industrial Engineering, 37(1), 43-46.
26. Palmer, G. J. (1996). A simulated annealing approach to integrated production scheduling. Journal of Intelligent Manufacturing, 7, 163-176.
27. Rinnooy Kan, A. H. G. (1976). Machine scheduling problems: Classification, complexity, and computations. The Hagues: Martinus Nijhoff.
28. Sankar, A. S., Ponnanbalam, S. G., & Rajendran, C. (2003). A multiobjective genetic algorithm for scheduling a flexible manufacturing system. International Journal of Advanced Manufacturing Technology, 22(3), 229-236.
29. Sridharan, V., & Zhou, Z. (1996). Dynamic non-preemptive single machine scheduling. Computers and Operations Research, 23(12), 1183-1190.
30. van Laarhoven, P. J. M., & Aarts, E. H. L. (1987). Simulated annealing: Theory and applications. Reidel: Dordrecht.
31. Webster, S., Jog, P. D., & Gupta, A. (1998). A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date. International Journal of Production Research, 36(9), 2543-2551.
32. Yun, Y., Gen, M., & Seo, S. (2003). Various hybrid methods based on genetic algorithms with fuzzy logic controller. Journal of Intelligent Manufacturing, 14(4), 401-419.