References

• Baker , K. R. (1974) . Introduction to Sequencing and Scheduling , New York : Wiley .
   Google Scholar
• Baker , K. R. and Su , Z. S. (1974) . Sequencing with due dates and early start times to minimize maximum tardiness . Naval Research Logistics Quarterly , 21 : 171 – 176 .
   Google Scholar
• Bernardo , J. J. and K.-S. Lin . (1994) . An interactive procedure for bi-criteria production scheduling . Computers and Operational Research , 21 : 677 – 688 .
   Web of Science ®Google Scholar
• Cheng , T. C. E. and Sin , C. C. S. (1990) . A state-of-the-art review of parallel-machine scheduling research . European Journal of Operational Research , 4 : 271 – 292 .
   Web of Science ®Google Scholar
• Davies , R. and O'Keefe , R. (1989) . Simulation Modelling with Pascal , Prentice Hall .
   Google Scholar
• Driscoll , W. and Emmons , H. (1977) . Scheduling production on one machine machine with changeover costs . AIIE Transactions , 9 : 388 – 395 .
   Google Scholar
• Emmons , H. (1975) . One machine sequencing to minimize meari flowtime with minimum number tardy . Naval Research Logistics Quarterly , 22 : 585 – 592 .
   Google Scholar
• Flynn , B. B. (1987) . Repetitive lots: the use of a sequencedependent set-up time scheduling procedure in group technology and traditional shops . Journal of Operations Management , 7 : 203 – 216 .
   Google Scholar
• Fry , T. D. , Armstrong , R. D. and Blackstone , J. H. (1987) . Minimizing weighted absolute deviation in single machine scheduling . HE Transactions , 19 : 445 – 450 .
   Google Scholar
• Gangadharan , R. and Rajendran , C. (1994) . A simulated annealing heuristic for scheduling in a flowshop with bicriteria . Computers and Industrial Engineering , 27 : 473 – 476 .
   Web of Science ®Google Scholar
• Carey , M. R. and Johnson , D. S. (1979) . Computers and Intractability: a guide to the theory of NP-completeness , W. H. Freeman .
   Google Scholar
• Glassey , C. R. (1968) . Minimum changeover scheduling of several products on one machine . Operations Research , 16 : 342 – 342 .
   Web of Science ®Google Scholar
• Gonzalez , T. and Johnson , D. B. (1980) . A new algorithm for preemptive scheduling of trees . Journal of ACM , 27 : 287 – 312 .
   Web of Science ®Google Scholar
• Grabot , B. and Geneste , L. (1994) . Dispatching rules in scheduling: a fuzzy approach . International Journal of Production Research , 32 : 903 – 915 .
   Web of Science ®Google Scholar
• Graves , S. C. (1981) . A review of production scheduling . Operations Research , 29 : 646 – 675 .
   Web of Science ®Google Scholar
• Iio , J. C. and Chang , Y.-L. (1995) . Minimizing the number of tardy jobs for m parallel machines . European Journal of Operational Research , 84 : 343 – 355 .
   Web of Science ®Google Scholar
• Kim , S. C. and Bobrowski , P. M. (1994) . Impact of sequencedependent setup time on job shop scheduling performance . International Journal of Production Research , 32 : 1503 – 1520 .
   Web of Science ®Google Scholar
• Lee , C. Y. and Choi , J. Y. (1995) . A genetic algorithm for job shop sequencing problems with distinct due date and general early-tardy penalty weights . Computers and Operations. Research , 22 : 857 – 869 .
   Web of Science ®Google Scholar
• Lee , C. Y. and Kim , S. J. (1995) . Parallel genetic algorithms for the earliness-tardiness job scheduling problem with general penalty weights . Computers and Industrial Engineering , 28 : 231 – 243 .
   Web of Science ®Google Scholar
• Lin , J. T. and Lee , C. -C. (1996) . Three-phase discrete event simulation of timed Petri nets . Journal of the Chinese Institute of Industrial Engineers , 13 : 11 – 22 .
   Google Scholar
• Lin , J. T and -C. Huang , S. (1996) . “ A computer aided scheduler for wafer probe center in semiconductor manufacturing ” . In The 4th International Conference on Automation Technology 1 57 – 64 . Taiwan
   Google Scholar
• Maccarthy , B. L. and Liu , J. (1993) . Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling . International Journal of Production Research , 31 : 59 – 79 .
   Web of Science ®Google Scholar
• Moore , J. (1975) . An algorithm for a single machine scheduling problem with sequence dependent setup times and scheduling windows . AIIE Transactions , 7 : 35 – 41 .
   Google Scholar
• Nakamura , N. and Salvendy , G. (1988) . An experimental study of human decision-making in computer-based scheduling of flexible manufacturing system . International Journal of Production Research , 20 : 567 – 583 .
   Web of Science ®Google Scholar
• Ovacik , I. M. and Uzsoy , R. (1993) . Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times . Operations Research Letters , 14 : 251 – 256 .
   Web of Science ®Google Scholar
• Ovacik , I. M. and Uzsoy , R. (1994a) . Exploiting shop floor status information to schedule complex job shops . Journal of Manufacturing Systesm , 12 : 73 – 84 .
   Web of Science ®Google Scholar
• Ovacik , I. M. and Uzsoy , R. (1994b) . Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times . International Journal of Production Research , 32 : 1243 – 1263 .
   Web of Science ®Google Scholar
• Ovacik , I. M. and Uzsoy , R. (1995) . Rolling horizon procedures for dynamic parallel machine scheduling with sequencedependent setup times . International Journal of Production Research , 33 : 3173 – 3192 .
   Web of Science ®Google Scholar
• Ramesh , R. and Cary , J. M. (1989) . Multicriteria job shop schedul ing . Computers and Industrial Engineering , 17 : 597 – 602 .
   Web of Science ®Google Scholar
• Randhawa , S. U. and Smith , T. A. (1995) . An experimental investigation of scheduling non-identical parallel, processors with sequence-dependent set-up times and due dates . at]In ternational Journal of Production Research , 33 : 59 – 69 .
   Web of Science ®Google Scholar
• Sen , T. , Raiszadeh , F. M. E. and Dilleepan , P. (1988) . A branchand-bound approach to the bicriterion scheduling problem involving total ffowtime and range of lateness . Management Science , 34 : 254 – 260 .
   Web of Science ®Google Scholar
• Sen , T. and Gupta , S. K. (1983) . A branch and bound procedure to solve a bicriterion scheduling problem . HE Transactions , 15 : 84 – 88 .
   Google Scholar
• Sidney , J. B. (1977) . Optimal single machine scheduling with earliness and tardiness penalties . Operations Research , 25 : 62 – 69 .
   Web of Science ®Google Scholar
• Uzsoy , R. , Church , L. K. , Ovacik , I. M. and llinchman , J. (1993) . Performance evaluation of dispatching rules for semiconductor testing operations . Journal of Electronics Manufacturing , 3 : 95 – 105 .
   Google Scholar
• Van Wamenhove , L. N and Gelders , L. I. (1980) . Solving a bicriterion scheduling problem . European Journal of Operational Research , 4 : 42 – 48 .
   Web of Science ®Google Scholar
• Van Wassenhove , L. N. and Baker , K. B. (1982) . A bicriterion approach to time/cost trade-offs in sequencing . European Journal of Operational Research , 11 : 48 – 54 .
   Web of Science ®Google Scholar
• Wilbrecht , J. K. and Prescott , I. (1969) . The influence of set-up time on job shop performance . Management Science , 16 : B274 – B280 .
   Web of Science ®Google Scholar
• Wroblewski , K. and Krawczynski , R. (1985) . Priority rules in production flow control . Material Flow , 2 : 167 – 177 .
   Google Scholar
• Zhou , C. and Egbelu , P. J. (1989) . Scheduling in a manufacturing shop with sequence-dependent setups . Robotics and Computer-Integrated Manufacturing , 5 : 73 – 81 .
   Web of Science ®Google Scholar