A hybrid of genetic algorithm and bottleneck shifting for flexible job shop scheduling problem

GECCO 2006 - Genetic and Evolutionary Computation Conference

Volumn 2, Issue , 2006, Pages 1157-1164

  Gao, Jie ^a   Gen, Mitsuo ^b   Sun, Linyan ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

^b WASEDA UNIVERSITY   (Japan)

Author keywords

Bottleneck shifting; Flexible job shop scheduling problem; Genetic algorithms; Neighborhood structure

Indexed keywords

APPROXIMATION THEORY; NUMERICAL METHODS; PROBLEM SOLVING; REAL TIME SYSTEMS; SCHEDULING;

BOTTLENECK SHIFTING; FLEXIBLE JOB SHOP SCHEDULING PROBLEM; NEIGHBORHOOD STRUCTURE;

GENETIC ALGORITHMS;

EID: 33750253979     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Bruker, P. and Schlie, R., Job-shop scheduling with multipurpose machines. Computing, 45, 369-375, 1990.
2. Chambers, J. B., Classical and Flexible Job Shop Scheduling by Tabu Search. PhD thesis, University of Texas at Austin, Austin, U.S.A., 1996.
3. Mastrolilli, M. and Gambardella, L. M., Effective neighborhood functions for the flexible job shop problem. J. Sched., 3, 3-20, 2000.
4. Yang, J.-B., GA-based discrete dynamic programming approach for scheduling in FMS environments. IEEE Trans. Systems, Man, and Cybernetics - Part B, 31 (5), 824-835, 2001.
5. Kacem, I., hammadi, S. and Borne, P., Approach by localization and multiobjectiye evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans. Systems, Man, and Cybernetics - Part C, 32(1), 1-13, 2002.
6. Wu, Z. and Weng, M. X., Multiagent scheduling method with earliness and tardiness objectives in flexible job shops. IEEE Trans. System, Man, and Cybernetics - Part B, 35(2), 293-301, 2005.
7. Xia, W. and Wu, Z., An effective hybrid optimization approach for muti-objective flexible job-shop scheduling problem. Computers & Industrial Engineering, 48, 409-425, 2005.
8. Zhang, H. and Gen, M., Multistage-based genetic algorithm for flexible job-shop scheduling problem. Journal of Complexity International, 11, 223-232, 2005.
9. Cheng, R., Gen, M. and Tsujimura, Y., A tutorial survey of job-shop scheduling problems using genetic algorithms-I. Representation. Computers & Industrial Engineering, 30(4), 983-997, 1996.
10. 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 & Industrial Engineering, 36(2), 343-364, 1999.
11. Gen, M. and Cheng, R., Genetic Algorithms & Engineering Design, New York: Wiley, 1997.
12. Gen, M. and Cheng, R., Genetic Algorithms & Engineering Optimization, New York: Wiley, 2000.
13. Adams, J., Balas, E. and Zawack, D., The shifting bottleneck procedure for job shop scheduling. Management Science, 34(3), 391-401, 1988.
14. Balas, E. and Vazacopoulos, A., Guided local search with shifting bottleneck for job shop scheduling. Management Science, 44(2), 262-275, 1998.
15. Gpricalves, J. F., Mendes, J. J. M., Resende, M. G. C., A hybrid genetic algorithm for the job shop scheduling problem. European Journal of Operational Research, 167, 77-95, 2005
16. Kacem, I., Hammadi, S. and Borne, P., Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic. Mathematics and Computers in Simulation, 60, 245-276, 2002.