References

• Anderson , E. J. and Nyirenda , J. C. (1990) . Two New Rules to Minimize Tardiness in a Job Shop . International Journal of Production Research , 28 (12) : 2277 – 2292 .
   Web of Science ®Google Scholar
• Applegate , D. and Cook , W. (1991) . A computational study of the job shop scheduling problem . ORSA Journal Computing , 3 : 149 – 156 .
   Google Scholar
• Barnes , J. W. and Laguna , M. (1993) . Solving the Multiple Machine Weighted Flow Time Problem Using Tabu Search . IIE Transactions , 25 (2) : 121 – 128 .
   Web of Science ®Google Scholar
• Barnes , J. W. and Chambers , J. B. (1995) . Solving the Job Shop Scheduling Problems with Tabu Search . IIE Transactions , 27 (2) : 257 – 263 .
   Web of Science ®Google Scholar
• Blazewicz , Jacek , Dror , Moshe and Weglarz , Jan . (1991) . Mathematical programming formulations for machine scheduling : a survey . European Journal of Operational Research , 51 : 283 – 300 .
   Web of Science ®Google Scholar
• Blazewicz , Jacek , Domschke , Wolfgang and Pesch , Erwin . (1996) . The job shop scheduling problem : convention and new solution techniques . European Journal of Operational Research , 93 : 1 – 33 .
   Web of Science ®Google Scholar
• Chen , Chuen-Lung , Vempati , Venkateswara S. and Nasser , A. (1995) . An Application of Genetic Algorithms for Flow Shop Problems . European Journal of Operational Research , 80 : 389 – 396 .
   Web of Science ®Google Scholar
• Chen , Zhi-Long . (1997) . Scheduling with batch setup times and earliness-tardiness penalties . European Journal of Operational Research , 96 : 518 – 537 .
   Web of Science ®Google Scholar
• Demeulemeester , Erik L. and Herroelen , Willy S. (1996) . Modeling Setup Times, Process Batches and Transfer Batches Using Activity Network Logic Vol. 89 , 355 – 365 .
   Google Scholar
• Dell'Amico , M. and Trubian , M. (1993) . Applying Tabu Search to the Job Shop Scheduling Problem . Annals of Operational Research , 41 (2) : 231 – 252 .
   Google Scholar
• Glover , F. (1977) . Heuristics for Integer Programming Using Surrogate Constraints . Decision Sciences , 8 (1) : 156 – 166 .
   Google Scholar
• Glover , F. (1989) . Tabu Search - Part I . ORSA Journal on Computing , 1 : 190 – 206 .
   Google Scholar
• Glover , F. (1990) . Tabu Search - Part II . ORSA Journal on Computing , 2 : 4 – 32 .
   Google Scholar
• Gupta , J. N. D. and Tunc , E. A. (1994) . Scheduling a twostage hybrid flow shop with separable setup and removal times . European Journal of Operational Research , 77 : 415 – 428 .
   Web of Science ®Google Scholar
• Han , Wenxue and Dejax , Pierre . (1994) . An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal . Annals of Operations Research , 50 : 263 – 279 .
   Google Scholar
• He , Zesheng , Yang , Taeyong and Tiger , Andy . (1996) . An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling . European Journal of Operational Research , 91 : 99 – 117 .
   Web of Science ®Google Scholar
• Hou , Edwin S. H. , Nirwan , A. and Hong , R. (1994) . A Genetic Algorithms for Multiprocessor Scheduling . IEEE Transaction on Parallel and Distributed System , 15 (2) : 113 – 120 .
   Web of Science ®Google Scholar
• Hutchison , J. , Leong , K. , Snyder , D. and Ward , P. (1991) . Scheduling Approaches for Random Job Shop Flexible Manufacturing Systems . International Journal of Production Economics , 29 sn(5) : 1053 – 1067 .
   Web of Science ®Google Scholar
• Jiang , J. C. and Hsiao , W. J. (1991) . “ Mathematical Programming ror the Scheduling with Alternate Process Plans in FMS ” . In Proceeding of 16th International Conference on Computer & Industrial Engineering 368 – 371 .
   Google Scholar
• Moser , M. and Engell , S. (1992) . A Survey of Priority Rules ror FMS Scheduling and Their Performance for the Denchmark Problem . Proceedings of the 31st Conference on Decision and Control , : 392 – 397 .
   Google Scholar
• Kim , S. C. and P. M. , Bobrowski . (1991) . Impact or sequence-dependent setup time on job shop scheduling performance . International Journal of Production Research , 32 (7) : 1503 – 1520 .
   Google Scholar
• Kolahan , F. M. and Liang , M. Z. (1995) . Solving the Combined Pan Sequencing and Tool Replacement Center: A Tabu Search Approach . Computers Industrial Engineering , 28 (4) : 731 – 743 .
   Web of Science ®Google Scholar
• Krishan , K. , Ganeshan , K. and Ram , D. J. (1995) . Distributed Simulated Annealing Algorithm for Job Shop Scheduling . IEEE Transaction on Systems, Man and Cybernetics , 25 (7) : 1102 – 1109 .
   Web of Science ®Google Scholar
• Tadahiko , Murata and Hisao , Ishibuchi . (1991) . Performance Evaluation of Genetic Algorithm for Flow Shop Scheduling Problem . IEEE Transaction on Engineering Management , 22 (2) : 812 – 817 .
   Google Scholar
• Raghu , T. S. and Rajendran , C. (1995) . Due-Date Setting Methodologies Based on Simulaled Annealing-an Experimental Study in a Real-life Job Shop . International Journal of Production Research , 33 (9) : 235 – 2554 .
   Web of Science ®Google Scholar
• Song , Ju-Seog and Lee , T. E. (1996) . A Tabu Search Procedure for Periodic Job Shop Scheduling . Computers Industrial Engineering , 30 (3) : 433 – 4 .
   Web of Science ®Google Scholar
• Sridhar , J. and Rajendran , C. (1993) . Scheduling in a Cellular Manufacturing System: A Simulaled Annealing Approach . International Journal of Production Research , 31 (12) : 2927 – 2945 .
   Web of Science ®Google Scholar
• Swiake , Kathryn I. and Narayan , Raman . (1990) . FMS planning decision, operating flexibilities, and system performance . Transaction on Engineering Management , 42 (1) : 82 – 89 .
   Google Scholar
• Swiak , Tadcusz . (1990) . Modeling and Scheduling of Flexible Manufacturing System . European Journal of Operational Research , 45 : 177 – 190 .
   Web of Science ®Google Scholar
• Wen , Ue-Pyng and Yeh , Ching-I . (1997) . Tabu Search Methods for the Flow Shop Sequencing Problem . Journal of the Chinese Institute of Engineering , 20 (4) : 465 – 470 .
   Web of Science ®Google Scholar
• Widmer , M. and Hertz. , A. (1989) . A New Heuristie Method for the Flow Shop Sequencing Problem . European Journal of Operational Research , 41 : 186 – 193 .
   Web of Science ®Google Scholar
• Zdrzalka , Stanislaw . (l991) . Preemptive scheduling with release dates, delivery times and sequence independent setup times . European Journal of Operational Research , 76 : 60 – 71 .
   Web of Science ®Google Scholar