An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem

References

• Allahverdi , A and Aydilek , H . 2010 . Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times . International Journal of Production Research , 48 ( 21 ) : 6367 – 6385 .
   Web of Science ®Google Scholar
• Armentano , V and Ronconi , D . 1999 . Tabu search for total tardiness minimisation in flow-shop scheduling problems . Computers & Operations Research , 26 ( 3 ) : 219 – 235 .
   Web of Science ®Google Scholar
• Campbell , HG , Dudek , RA and Smith , ML . 1970 . Heuristic algorithm for N-job, M-machine sequencing problem . Management Science Series B—Application , 16 ( 10 ) : 630 – 637 .
   Web of Science ®Google Scholar
• Chan , HK and Chan , FTS . 2010 . Comparative study of adaptability and flexibility in distributed manufacturing supply chains . Decision Support Systems , 48 ( 2 ) : 331 – 341 .
   Web of Science ®Google Scholar
• Chan , FTS , Chung , SH and Chan , PLY . 2005 . An adaptive genetic algorithm with dominated genes for distributed scheduling problems . Expert Systems Applications , 29 ( 2 ) : 364 – 371 .
   Web of Science ®Google Scholar
• Chandra , P , Mehta , P and Tirupati , D . 2009 . Permutation flow shop scheduling with earliness and tardiness penalties . International Journal of Production Research , 47 ( 20 ) : 5591 – 5610 .
   Web of Science ®Google Scholar
• Chung , SH , Chan , FTS and Chan , HK . 2009 . A modified genetic algorithm approach for scheduling of perfect maintenance in distributed production scheduling . Engineering Application of AI , 22 ( 7 ) : 1005 – 1014 .
   Web of Science ®Google Scholar
• Gao , J and Chen , R . 2011 . A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem . International Journal of Computational Intelligence Systems , 4 ( 4 ) : 497 – 508 .
   Web of Science ®Google Scholar
• Garey , MR , Johnson , DS and Sethi , R . 1976 . The complexity of flowshop and jobshop scheduling . Mathematics of Operations Research , 1 ( 2 ) : 117 – 129 .
   Google Scholar
• Glover , F . 1989 . Tabu search – part i . ORSA Journal on Computing , 1 ( 3 ) : 190 – 206 .
   Google Scholar
• Glover , F . 1990 . Tabu search – part ii . ORSA Journal on Computing , 2 ( 1 ) : 4 – 32 .
   Google Scholar
• Grabowski , J and Wodecki , M . 2004 . A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion . Computers & Operations Research , 31 ( 11 ) : 1891 – 1909 .
   Web of Science ®Google Scholar
• Jia , HZ . 2003 . A modified genetic algorithm for distributed scheduling problems . Journal of Intelligent Manufacturing , 14 ( 3–4 ) : 351 – 362 .
   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
• Kahraman , C . 2008 . An application of effective genetic algorithms for solving hybrid flow shop scheduling problems . International Journal of Computational Intelligence Systems , 1 ( 2 ) : 134 – 147 .
   Web of Science ®Google Scholar
• Kalczynski , PJ and Kamburowski , J . 2007 . On the NEH heuristic for minimising the makespan in permutation flow shops . Omega—International Journal of Management Science , 35 ( 1 ) : 53 – 60 .
   Web of Science ®Google Scholar
• Lei , D and Guo , XP . 2011 . Variable neighbourhood search for minimising tardiness objectives on flow shop with batch processing machines . International Journal of Production Research , 49 ( 2 ) : 519 – 529 .
   Web of Science ®Google Scholar
• Liu , B , Wang , L and Jin , Y . 2007 . An effective PSO-based memetic algorithm for flow shop scheduling . IEEE Transactions on Systems, Man, and Cybernetics, Part B , 37 ( 1 ) : 18 – 27 .
   PubMed Web of Science ®Google Scholar
• Naderi , B and Ruiz , R . 2010 . The distributed permutation flowshop scheduling problem . Computers & Operations Research , 37 ( 4 ) : 754 – 768 .
   Web of Science ®Google Scholar
• Nawaz , M , Enscore , EE Jr and Ham , I . 1983 . A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem . Omega—International Journal of Management Science , 11 ( 1 ) : 91 – 95 .
   Web of Science ®Google Scholar
• Nowicki , E and Smutnicki , C . 1996 . A fast tabu search algorithm for the permutation flowshop problem . European Journal of Operational Research , 91 ( 1 ) : 160 – 175 .
   Web of Science ®Google Scholar
• Nowicki , E and Smutnicki , C . 1998 . The flow shop with parallel machines: A tabu search approach . European Journal of Operational Research , 106 ( 2–3 ) : 226 – 253 .
   Web of Science ®Google Scholar
• Onwubolu , G and Davendra , D . 2006 . Scheduling flowshops using differential evolution algorithm . European Journal of Operational Research , 171 ( 2 ) : 674 – 692 .
   Web of Science ®Google Scholar
• Palmer , DS . 1965 . Sequencing jobs through a multi-stage process in the minimum total time: a quick method of obtaining a near optimum . Operational Research Quarterly , 16 ( 1 ) : 101 – 107 .
   Google Scholar
• Rad , S , Ruiz , FR and Boroojerdiana , N . 2009 . New high performing heuristics for minimising makespan in permutation flowshops . Omega—International Journal of Management Science , 37 ( 2 ) : 331 – 345 .
   Web of Science ®Google Scholar
• Rajendran , C and Ziegler , H . 2004 . Ant-colony algorithms for permutation flowshop scheduling to minimise makespan/total flowtime of jobs . European Journal of Operational Research , 155 ( 2 ) : 426 – 438 .
   Web of Science ®Google Scholar
• Reeves , CR . 1995 . A genetic algorithm for flowshop sequencing . Computers & Operations Research , 22 ( 1 ) : 5 – 13 .
   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 ) : 65 – 74 .
   Web of Science ®Google Scholar
• Vallada , E and Ruiz , R . 2009 . Cooperative metaheuristics for the permutation flowshop scheduling problem . European Journal of Operational Researchi , 193 ( 2 ) : 365 – 376 .
   Web of Science ®Google Scholar
• Vallada , E and Ruiz , R . 2010 . Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem . Omega—International Journal of Management Science , 38 ( 1 ) : 57 – 67 .
   Web of Science ®Google Scholar