Sequence-dependent flow shop scheduling problem minimising the number of tardy jobs

References

• Allahverdi , A and Soroush , HM . 2008 . The significance of reducing setup times/setup costs . European Journal of Operational Research , 187 ( 3 ) : 978 – 984 .
   Web of Science ®Google Scholar
• Allahverdi , A . 2008 . A survey of scheduling problems with setup times or costs . European Journal of Operational Research , 187 ( 3 ) : 985 – 1032 .
   Web of Science ®Google Scholar
• Atashpaz-Gargari , E and Lucas , C . 2007 . Imperialist Competitive Algorithm: An algorithm for optimization inspired by imperialistic competition . IEEE Congress on Evolutionary Computation , : 4661 – 4667 .
   Google Scholar
• Bulfin , RL and M’Hallah , R . 2003 . Minimizing the weighted number of tardy jobs on a two-machine flowshop . Computers & Operations Research , 30 ( 12 ) : 1887 – 1900 .
   Web of Science ®Google Scholar
• Campbell , HG , Dudek , RA and Smith , ML . 1970 . A heuristic algorithm for the n-job and m-machine sequencing problem . Management Science , 16 ( 10 ) : 630 – 637 .
   Web of Science ®Google Scholar
• Chen , CL and Chen , CL . 2008 . Bottleneck-based heuristic to minimize tardy jobs in flexible flow line with unrelated parallel machines . International Journal of Production Research , 46 ( 22 ) : 6415 – 6430 .
   Web of Science ®Google Scholar
• Della Croce , F , Gupta , JND and Tadei , R . 2000 . Minimizing tardy jobs in a flowshop with common due date . European Journal of Operational Research , 120 ( 2 ) : 375 – 381 .
   Web of Science ®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 , JND and Tunc , EA . 1998 . Minimizing tardy jobs in a two-stage hybrid flowshop . International Journal of Production Research , 36 ( 9 ) : 2397 – 2417 .
   Web of Science ®Google Scholar
• Hariri , AMA and Potts , CN . 1989 . A branch and bound algorithm to minimize the number of late jobs in a permutation flowshop . European Journal of Operational Research , 38 ( 2 ) : 228 – 237 .
   Web of Science ®Google Scholar
• Johnson , SM . 1954 . Optimal two-and three-stage production schedules with setup times included . Naval Research Logistics Quarterly , 1 ( 1 ) : 61 – 68 .
   Google Scholar
• Lenstra , JK , Rinnooy Kan , AHG and Brucker , P . 1977 . Complexity of machine scheduling . Annals of Discrete Mathematics , 1 : 343 – 62 .
   Google Scholar
• Montgomery , DC . 2009 . Design and analysis of experiments , New York : Wiley .
   Google Scholar
• Moore , JM . 1968 . An n job, one machine sequencing algorithm for minimizing the number of late . Management Science , 15 : 102 – 109 .
   Web of Science ®Google Scholar
• Naderi , B , Zandieh , M and Fatemi Ghomi , SMT . 2009 . Scheduling job shop problems with sequence-dependent setup times . International Journal of Production Research , 47 ( 21 ) : 5959 – 5976 .
   Web of Science ®Google Scholar
• Pinedo , ML . 2008 . Scheduling, theory, algorithms, and systems , New York : Prentice Hall .
   Google Scholar
• Ruiz-Torresa , AJ , Ablanedo-Rosasb , JH and Ho , JC . 2010 . Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility . Computers & Operations Research , 37 ( 2 ) : 282 – 291 .
   Web of Science ®Google Scholar
• Salmasi , N , Logendran , R and Skandari , MR . 2010 . Total flowtime minimization in a flowshop sequence-dependent group scheduling problem . Computers & Operations Research , 37 ( 1 ) : 199 – 212 .
   Web of Science ®Google Scholar
• Sung , CS and Kim , YH . 2003 . Minimizing due date related performance measures on two batch processing machines . European Journal of Operational Research , 147 ( 3 ) : 644 – 656 .
   Web of Science ®Google Scholar