Bi-criteria improved genetic algorithm for scheduling in flowshops to minimise makespan and total flowtime of jobs

References

• Amit , N. , Haddock , J. and Heragu , S. 1995 . Multiple and bicriteria scheduling: A literature survey . European Journal of Operational Research , 81 : 88 – 104 .
   Web of Science ®Google Scholar
• Baker , K. R. 1974 . Introduction to sequencing and scheduling , New York : Wiley .
   Google Scholar
• Ben-Daya , M. and Al-Fawzan , M. 1998 . A tabu search approach for the flow shop scheduling problem . European Journal of Operational Research , 109 : 88 – 95 .
   Web of Science ®Google Scholar
• Campbell , H. G. , Dudek , R. A. and Smith , M. L. 1970 . A heuristic algorithm for the n-job, m-machine sequencing problem . Management Science , 16/B : 630 – 637 .
   Web of Science ®Google Scholar
• Dannenbring , D. G. 1977 . An evaluation of flow-shop sequencing heuristics . Management Science , 23 : 1174 – 1182 .
   Web of Science ®Google Scholar
• Garey , M. R. , Johnson , D. S. and Sethi , R. 1976 . Complexity of flowshop and jobshop scheduling . Mathematics of Operations Research , 1 : 117 – 129 .
   Google Scholar
• Goldberg , D. E. 1989 . Genetic algorithms in search, optimization and machine learning , Reading, MA : Addison Wesley .
   Google Scholar
• Ignall , E. and Schrage , L. 1965 . Application of the branch-and-bound technique to some flowshop scheduling problems . Operations Research , 13 : 400 – 412 .
   Web of Science ®Google Scholar
• Ishibuchi , H. , Misaki , S. and Tanaka , H. 1995 . Modified simulated annealing algorithms for the flow shop sequencing problems . European Journal of Operational Research , 81 : 388 – 398 .
   Web of Science ®Google Scholar
• Johnson , S. M. 1954 . Optimal two and three-stage production schedules with setup times included . Naval Research Logistics , 1 : 61 – 68 .
   Google Scholar
• King , J. R. and Spachis , A. S. 1980 . Heuristics for flow-shop scheduling . International Journal of Production Research , 18 : 345 – 357 .
   Web of Science ®Google Scholar
• Leung , Y. , Gao , Y. and Xu , Z. B. 1997 . Degree of population diversity – a perspective on premature convergence in genetic algorithms and its Markov-chain analysis . IEEE Transaction Neural Networks , 8 ( 5 ) : 1165 – 1176 .
   PubMed Web of Science ®Google Scholar
• Logendran , R. and Nudtasomboon , N. 1991 . Minimizing the makespan of a group scheduling problem: a new heuristic . International Journal of Production Research , 22 : 217 – 230 .
   Google Scholar
• Nawaz , M. , Enscore , E. and Ham , I. 1983 . A heuristic algorithm for the m-machine, n-machine flow shop sequencing problem . Omega , 11 ( 1 ) : 91 – 95 .
   Web of Science ®Google Scholar
• Ogbu , F. A. and Smith , D. K. 1990 . The applications of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem . Computers and Operations Research , 17 ( 3 ) : 243 – 253 .
   Web of Science ®Google Scholar
• Osman , I. and Potts , C. 1989 . Simulated annealing for permutation flow-shop scheduling. OMEGA . The International Journal of Management Science , 17 ( 6 ) : 551 – 557 .
   Google Scholar
• Rajendran , C. 1995 . Heuristic for scheduling in flow shop with multiple objectives . European Journal of operational Research , 82 : 540 – 555 .
   Web of Science ®Google Scholar
• Rajkumar , R. and Shahabudeen , P. 2009 . An improved genetic algorithm for the flowshop scheduling problem . International Journal of Production Research , 47 ( 1 ) : 233 – 249 .
   Web of Science ®Google Scholar
• Ravindran , D. , Noorul Haq , A. , Selvakumar , S. J. and Sivaraman , R. 2005 . Flow shop scheduling with multiple objective of minimizing makespan and total flow time . International Journal of Advanced Manufacturing Technology , 25 : 1007 – 1012 .
   Web of Science ®Google Scholar
• Sridhar , J. and Rajendran , C. 1993 . Scheduling in a cellular manufacturing system - a simulated annealing approach . International Journal of Production Research , 31 : 2927 – 2945 .
   Web of Science ®Google Scholar
• Taillard , E. 1990 . Some efficient heuristic methods for the flow shop sequencing problem . European Journal of Operational Research , 47 ( 1 ) : 67 – 74 .
   Web of Science ®Google Scholar
• Taillard , E. 1993 . Benchmarks of basic scheduling problems . European Journal of Operational Research , 64 : 278 – 285 .
   Web of Science ®Google Scholar
• Neppalli , V. R. , Chen , C.-L. and Gupta , J. N.D. 1996 . “Genetic algorithms for the two-stage bicriteria flowshop problem . European Journal of Operational Research , 95 : 356 – 373 .
   Web of Science ®Google Scholar
• Widmer , M. and Hertz , A. 1989 . A new heuristic method for the flow shop sequencing problem . European Journal of Operational Research , 41 ( 2 ) : 186 – 193 .
   Web of Science ®Google Scholar
• Yeh , W. C. 1999 . A new branch-and-bound approach for the n/2/flowshop/αF + βCmax flowshop scheduling problem . Computers and Operations Research , 26 : 1293 – 1310 .
   Web of Science ®Google Scholar