Hybrid genetic algorithms for minimizing the maximum completion time for the wafer probing scheduling problem

Journal of the Chinese Institute of Industrial Engineers

Volumn 22, Issue 3, 2005, Pages 218-225

  Yang, Ming Hsien ^a   Lo, Chien Chung ^a   Chen, Hsin Min ^a   Huang, Hau Lieng ^a  

^a NATIONAL UNITED UNIVERSITY   (Taiwan)

Author keywords

Due dates; Hybrid genetic algorithms; Initial population; Minimum make span; Sequence dependent setup time

Indexed keywords

COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SCHEDULING; SIMULATED ANNEALING;

DUE DATES; HYBRID GENETIC ALGORITHMS; INITIAL POPULATION; MINIMUM MAKE SPAN; SEQUENCE DEPENDENT SETUP TIME; VEHICLE ROUTING PROBLEM; WAFER PROBING SCHEDULING PROBLEM (WPSP); WEIGHTED TARDINESS;

GENETIC ALGORITHMS;

EID: 21244500228     PISSN: 10170669     EISSN: 21517606     Source Type: Journal    
DOI: 10.1080/10170660509509291     Document Type: Article

References (21)

1. Pearn, W. L., Chung, S. H., and Yang, M. H., 2002. Minimizing the total machine work load for the wafer probing scheduling problem (WPSP). IIE transactions, 34:211–220.
2. Pearn, W. L., Chung, S. H., and Yang, M. H., 2002. The wafer probing scheduling problem (WPSP). Journal of the Operational Research Society, 53:864–874.
3. Yang, M. H., Pearn, W. L., Chung, S. H., and Huang, J. Y., “ Minimizing the maximum completion time for the wafer probing scheduling problem ”. In The 2003 Annual Meeting and Conference of Chinese Institute of Industrial Engineers
4. Sethi, R., 1977. On the complexity of mean flow time scheduling. Mathematics of Operations Research, 2 (4):320–330.
5. Garey, M. R., and Johnson, D. S., 1979. Computer And Intractability:A Guide to the Theory of NP-Completeness San Francisco:W H Freeman.
6. Min, L., and Cheng, W., 1999. A genetic algorithm for minimizing makespan in the case of scheduling identical parallel machines. Artificial Intelligence Engineering, 13:399–403.
7. Gupta, J. N. D., and Ruiz-Torres, J., 2001. A listfit heuristic for minimizing makespan on identical parallel machines. Production Planning & Control, 12 (1):28–36.
8. Azizoglu, M., and Kirca, O., 1998. Tradiness minimization on parallel machines. International Journal of Production Economics, 55:163–168.
9. Lee, Y. H., and Pinedo, M., 1997. Scheduling jobs on parallel machines with sequence-dependent setup times. European Journal of Operational Research, 100:464–474.
10. Park, Y. G., Kim, S. Y., and Lee, Y. H., 2000. Scheduling jobs on parallel machines applying neural network and heuristic rules. Computers & Industrial Engineering, 38:189–202.
11. Zomaya, A. Y., and The, Y. H., 2001. Observation on Using Genetic Algorithms for Dynamic Load-Balancing. IEEE, 12 (9):899–911.
12. Cheng, R., Gen, M., and Tosawa, T., 1995. Minmax Earliness/Tardiness Scheduling In Identical Parallel Machine System Using Genetic Algorithms. Computers & Industrial Engineering, 29 (1-4):513–517.
13. Min, L., and Cheng, W., 1999. A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines. Artificial Intelligence in Engineering, 13:399–403.
14. Cochran, J. K., Horng, S. M., and Fowler, J. W., 2003. A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines. Computers & Operations Research, 30:1087–1102.
15. Cheng, R., and Gen, M., 1997. Parallel Machine Scheduling Problems Using Memetic Algorithms. Computers & Industrial Engineering, 33 (3-4):761–764.
16. Serifoglu, F. S., and Ulusoy, G., 1999. Parallel machine scheduling with earliness and tardiness penalties. Computers & Operations Research, 26:773–787.
17. Herrmann, J. W., 1999. A Genetic Algorithm for Minimax Optimization Problems. Proceedings of the Congress of Evolutionary Computation,:1099–1103.
18. Tamaki, H., Nishino, E., and Abe, S., 1999. A Genetic Algorithm Approach to Multi-Objective Scheduling Problems with Earliness and Tardiness Penalties. Proceedings of the Congress of Evolutionary Computation,:46–52.
19. Viginer, A., Sonntag, B., and Portmann, M. C., 1999. A hybrid method for a parallel-machine scheduling problem. International Conference on Emerging Technologies and Factory Automation,:671–678.
20. Lin, C. C., 2001. A Genetic Algorithm for Unrelated Parallel-Machine Scheduling Problems Taichung:Chaoyang University of Technology. Master. Thesis
21. Tsai, Y. L., 2004. Improving heuristics and genetic algorithms for minimizing the maximum completion time for the wafer probing scheduling problem (WPSP) Hsinchu:National Chiao Tung University. Master. Thesis