APPLICATION OF GENETIC ALGORITHM TO THE UNRELATED PARALLEL MACHINE SCHEDULING PROBLEM

7.

•  Google Scholar
•  Google Scholar
•  Google Scholar
• Allahverdi , A. and Mittenthal , J. 1994 . Scheduling on M parallel machines subject to random breakdowns to minimize expected mean flow time . Naval Research Logistics Quarterly , 41 : 677 – 682 .
   Google Scholar
• Chen , T. C. E. and Gupta , M. 1989 . Survey of scheduling research involving due date determination decisions . European Journal of Operational Research , 138 : 156 – 166 .
   Google Scholar
• Cheng , R. and Gen , M. 1997 . Parallel machine scheduling problems using memetic algorithms . Computers and Industrial Engineering , 33 : 761 – 764 .
   Web of Science ®Google Scholar
• Cheng , T. C. E. , Chen , Z. L. , Kovalyov , M. Y. and Lin , B. M. T. 1996 . Parallel machine batching and scheduling to minimize total completion time . IIE Transactions , 28 : 953 – 956 .
   Web of Science ®Google Scholar
• Class , C. A. , Potts , C. N. and Shade , P. 1994 . Unrelated parallel machine scheduling using local search . Mathematics and Computer Modeling , 20 : 41 – 52 .
   Google Scholar
• Colin , R. R. 1995 . A genetic algorithm for flow shop sequencing . Computers and Operations Research , 122 : 5 – 13 .
   Google Scholar
• Croce , D. , Federico , R. , Tadei , R. and Giuseppe , V. 1995 . A genetic algorithm for the job shop problem . Computers and Operations Research , 122 : 15 – 24 .
   Google Scholar
• Emmons , H. 1987 . Scheduling to a common due date on parallel uniform processors . Naval Research Logistics , 34 : 803 – 810 .
   Web of Science ®Google Scholar
• Falkenaurer , E. and Bouffouix , S. 1991 . “ A genetic algorithm for job shop scheduling ” . In Proceedings of the IEEE International Conference on Robitcs and Automaion Sacramento 824 – 829 . Los Alamitos, California
   Google Scholar
• Funda , S. and Ulusoy , G. 1999 . Parallel machine scheduling with earliness and tardiness penalties . Computers and Operations Research , 26 : 773 – 787 .
   Web of Science ®Google Scholar
• Garey , M. and Johnson , D. 1978 . Strong NP-completeness results motivation, examples and implications . Journal of ACM , 25 : 499 – 508 .
   Web of Science ®Google Scholar
• Glover , F. and Laguna , M. 1993 . Tabu Search Oxford : Blackwell Scientific Publications .
   Google Scholar
• Goldberg , D. and Alleles , R. 1985 . “ Loci and the traveling salesman problem ” . In Proceedings of the International Conference on Genetic Algorithms and Their Applications 154 – 159 . Pittsburgh, Pennsylvania
   Google Scholar
• Grefenstette , J. J. 1986 . Optimization of control parameters for genetic algorithms . IEEE Transactions on Systems, Man and Cybernetics , 16 ( 1 ) : 122 – 128 .
   Web of Science ®Google Scholar
• Guinet , A. 1995 . Scheduling independent jobs on uniform parallel machines to minimize tardiness criteria . Journal of Inteligent Manufacturing , 6 : 95 – 103 .
   Web of Science ®Google Scholar
• Gupta , J. N. D. 1988 . Two—stage hybrid flowshop scheduling problem . Journal of the Operational Research Society , 39 : 359 – 364 .
   Web of Science ®Google Scholar
• Holland , J. 1975 . Adaption in Natural and Artificial System Michigan : MIT Press .
   Google Scholar
• Kanet , J. J. , Balakrishnan , N. and Sridharan , S. V. 1999 . Early/Tardy scheduling with sequence dependent setup on uniform parallel machines . Computers and Operations Research , 26 : 127 – 141 .
   Google Scholar
• Karp , R. M. 1972 . Reducible among Combinatorial Problems in Complexity of Computer Computations New York : Plenum press .
   Google Scholar
• Kumar , N. , Hemant , S. and Srinivasan , G. 1996 . A genetic algorithm for job shop scheduling—a case study . Computer in Industry , 31 : 155 – 160 .
   Google Scholar
• Lawer , E. L. and Labetoulle , J. 1978 . On preemptive scheduling of unrelated parallel processors . Journal of ACM , 25 : 612 – 619 .
   Google Scholar
• Mandel , M. and Mosheiov , G. 2001 . Minimizing maximum earliness on parallel identical machines . Computers and Operations Research , 28 : 317 – 327 .
   Google Scholar
• Mingail , H. 1995 . Generic algorithm gaining faster results . Computing Canade , 21 : 18 – 25 .
   Google Scholar
• Murata , T. , Ishibuchi , H. and Tanaka , H. 1996 . Genetic algorithms for flowshop scheduling problems . Computers and Industrial Engineering , 30 : 1061 – 1071 .
   Web of Science ®Google Scholar
• Nakano , R. and Yamada , T. 1991 . “ Conventional genetic algorithm for job shop problem ” . In Proceedings of 4th International Conference on Genetic Algorithm and Their Applications 474 – 479 . San Diego, California
   Google Scholar
• Piersam , N. and Dijk , W. V. 1996 . A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search . Mathematics and Computer Modeling , 24 : 11 – 19 .
   Google Scholar
• Sahni , S. and Cho , Y. 1980 . Scheduling independent takes with due time on a uniform processor system . Journal of ACM , 27 : 550 – 563 .
   Web of Science ®Google Scholar
• Srivastava , B. 1998 . An effective heuristic for minimizing makespan on unrelated parallel machines . Journal of the Operational Research Society , 49 : 886 – 894 .
   Web of Science ®Google Scholar