A meta-heuristic approach for solving the no-wait flow-shop problem

References

• Akkan , C and Karabati , S . 2004 . The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm . European Journal of Operational Research , 159 ( 2 ) : 420 – 429 .
   Web of Science ®Google Scholar
• Aldowaisan , T . 2001 . A new heuristic and dominance relations for no-wait flowshops with setups . Computers & Operations Research , 28 ( 6 ) : 563 – 584 .
   Web of Science ®Google Scholar
• Aldowaisan , T and Allahverdi , A . 1998 . Total flowtime in no-wait flowshops with separated setup times . Computers & Operations Research , 25 ( 9 ) : 757 – 765 .
   Web of Science ®Google Scholar
• Aldowaisan , T and Allahverdi , A . 2004 . New heuristics for m-machine no-wait flowshop to minimize total completion time . Omega , 5 : 345 – 352 .
   Web of Science ®Google Scholar
• Beasley , JE . 2009. OR-Library: distributing test problems by electronic mail. Available from: http://people.brunel.ac.uk/~mastjjb/jeb/info.html [accessed 10 November 2011]
   Google Scholar
• Bianco , L , Dell''Olmo , P and Giordani , S . 1999 . Flow shop no-wait scheduling with sequence dependent setup times and release dates . INFOR , 37 ( 1 ) : 3 – 20 .
   Web of Science ®Google Scholar
• Bonney , M and Gundry , S . 1976 . Solutions to the constrained flowshop sequencing problem . Operational Research Quarterly , 24 ( 4 ) : 869 – 883 .
   Google Scholar
• Cadambi , B and Sathe , Y . 1993 . Two-machine flowshop scheduling to minimize mean flow time . Operational Research Society of India , 30 ( 1 ) : 35 – 41 .
   Google Scholar
• Carlier , J . 1978 . Ordonnancements a contraintes disjonctives . RAIRO Recherche Operationnelle , 12 ( 4 ) : 333 – 351 .
   Web of Science ®Google Scholar
• Chan , D . 1993 . Precence constraint TSP applied to circuit board assembly and no wait flowshop . International Journal of Production Research , 31 ( 9 ) : 2171 – 2177 .
   Web of Science ®Google Scholar
• Chen , C , Neppalli , R and Ajaber , N . 1996 . Genetic algorithms applied to the continuous flow shop problem . Computers & Industrial Engineering , 30 ( 4 ) : 919 – 929 .
   Web of Science ®Google Scholar
• Cheng , TCE , Wang , G and Sriskandarajah , C . 1999 . One-operator-two-machine flowshop scheduling with setup and dismounting times . Computers and Operations Research , 26 ( 7 ) : 715 – 730 .
   Web of Science ®Google Scholar
• DellaCroce , F , Ghirardi , M and Tadei , R . 2002 . An improved branch-and-bound algorithm for the two machine total completion time flow shop problem . European Journal of Operational Research , 139 ( 2 ) : 293 – 301 .
   Web of Science ®Google Scholar
• Doliskani , JN , Malekian , E and Zakerolhosseini , A . 2008 . A cryptosystem based on the symmetric group Sn . International Journal of Computer Science and Network Security , 8 ( 2 ) : 226 – 234 .
   Google Scholar
• Eberhart , RC and Kennedy , J . 1995 . “ A new optimizer using particle swarm theory ” . In Sixth International Symposium on Micro Machine and Human Science , Nagoya : Japan .
   Google Scholar
• Finke , DA , Medeiros , DJ and Traband , MT . 2007 . Multiple machine JIT scheduling: a tabu search approach . International Journal of Production Research , 45 ( 21 ) : 4899 – 4915 .
   Web of Science ®Google Scholar
• Franc , PM , Tin , G and Buriol , LS . 2006 . Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions . International Journal of Production Research , 44 ( 5 ) : 939 – 957 .
   Web of Science ®Google Scholar
• Francis , RL , McGinnis , F and White , JA . 1998 . Facility layout and location: an analytical approach , Englewood Cliffs, NJ : Prentice-Hall Professional Technical Reference .
   Google Scholar
• Gangadharan , R and Rajedran , C . 1993 . Heuristic algorithms for scheduling in no-wait flowshop . International Journal of Production Economics , 32 ( 3 ) : 285 – 290 .
   Web of Science ®Google Scholar
• Garey , M , Johnson , D and Sethi , R . 1976 . The complexity of flowshop and jobshop scheduling . Mathematics of Operations Research , 1 ( 2 ) : 117 – 129 .
   Google Scholar
• Glass , C , Gupta , J and Potts , C . 1999 . Two-machine no-wait flow shop scheduling with missing operations . Mathematics of Operations Research , 24 ( 4 ) : 911 – 924 .
   Web of Science ®Google Scholar
• Glover , F . 1986 . Future paths for integer programming and links to artificial intelligence . Computers & Operations Research , 13 ( 5 ) : 533 – 549 .
   Web of Science ®Google Scholar
• Goyal , S and Sriskandarajah , C . 1988 . No-wait shop scheduling: computational complexity and approximate algorithms . Opsearch , 25 : 220 – 244 .
   Google Scholar
• Goyal , SK . 1975 . Job-shop sequencing problem with no wait in process . International Journal of Production Research , 13 ( 2 ) : 197 – 206 .
   Google Scholar
• Grabowski , J and Pempera , J . 2000 . Sequencing of jobs in some production system . European Journal of Operational Research , 125 ( 3 ) : 535 – 550 .
   Web of Science ®Google Scholar
• Grabowski , J and Pempera , J . 2005 . Some local search algorithms for no-wait flow-shop problem with makespan criterion . Computers & Operations Research , 32 ( 8 ) : 2197 – 2212 .
   Web of Science ®Google Scholar
• Grabowski , J and Syslo , M . 1973 . On some machine Sequencing problems (I) . Applications of Mathematicae , 13 : 340 – 345 .
   Google Scholar
• Guirchoun , S , Martineau , P and Billaut , JC . 2005 . Total completion time minimization in a computer system with a server and two parallel processors . Computers & Operations Research , 32 ( 3 ) : 599 – 611 .
   Web of Science ®Google Scholar
• Gupta , JND , Strusevich , VA and Zwaneveld , CM . 1997 . Two-stage no-wait scheduling models with setup and removal times separated . Computers & Operations Research , 24 ( 1 ) : 1025 – 1031 .
   Web of Science ®Google Scholar
• Hall , N and Sriskandarajah , C . 1996 . A survey of machine scheduling problems with blocking and no-wait in process . Operations Research , 44 ( 3 ) : 510 – 525 .
   Web of Science ®Google Scholar
• Huang , RH , Yang , C-L and Huang , Y-C . 2009 . No-wait two-stage multiprocessor flow shop scheduling with unit setup . The International Journal of Advanced Manufacturing Technology , 44 ( 9 ) : 921 – 927 .
   Web of Science ®Google Scholar
• Kennedy , J and Eberhart , RC . 1997 . “ A discrete binary version of the particle swarm algorithm ” . In IEEE International Conference on Systems, Man, and Cybernetics
   Google Scholar
• King , J and Spachis , A . 1980 . Heuristics for flowshop scheduling . International Journal of Production Research , 18 ( 3 ) : 343 – 357 .
   Web of Science ®Google Scholar
• Knuth , D . 1997 . Seminumerical algorithms , Boston : Addison-Wesley Longman .
   Google Scholar
• Kusiak , A and Heragu , SS . 1987 . The facility layout problem . European Journal of Operational Research , 29 ( 3 ) : 229 – 251 .
   Web of Science ®Google Scholar
• Laha , D and Chakraborty , UK . 2009 . A constructive heuristic for minimizing makespan in no-wait flow shop scheduling . International Journal of Advanced Manufacturing Technology , 41 ( 1 ) : 97 – 109 .
   Web of Science ®Google Scholar
• Lawler , EL . 1993 . “ Sequencing and scheduling: algorithms and complexity ” . In Handbooks in operations research and management science , Edited by: Graves , SC , Kan , AHGR and Zipkin , P . 445 – 522 . Amsterdam : North-Holland .
   Google Scholar
• Li , X , Wang , Q and Wu , C . 2008 . Heuristic for no-wait flow shops with makespan minimization . International Journal of Production Research , 46 ( 9 ) : 2519 – 2530 .
   Web of Science ®Google Scholar
• Liaw , CF . 2008 . An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops . Computers and Operations Research , 35 ( 10 ) : 3276 – 3283 .
   Web of Science ®Google Scholar
• Lina , SW and Ying , KC . 2009 . Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems . International Journal of Production Research , 47 ( 5 ) : 1411 – 1424 .
   Web of Science ®Google Scholar
• Liu , B , Wang , L and Jin , Y-H . 2007 . An effective hybrid particle swarm optimization for no-wait flow shop scheduling . International Journal of Advanced Manufacturing Technology , 31 ( 9 ) : 1001 – 1011 .
   Web of Science ®Google Scholar
• Macchiaroli , R , Molea , S and Riemma , S . 1999 . Modelling and optimization of industrial manufacturing processes subject to no-wait constraints . International Journal of Production Research , 37 ( 11 ) : 2585 – 2607 .
   Web of Science ®Google Scholar
• McCaffrey , J . 2003. Using permutations in. NET for improved systems security. Available from: http://msdn.microsoft.com/en-us/library/aa302371.aspx [accessed 10 November 2011]
   Google Scholar
• Pitts , RA Jr and Ventura , JA . 2009 . Scheduling flexible manufacturing cells using Tabu Search . International Journal of Production Research , 47 ( 24 ) : 6907 – 6928 .
   Web of Science ®Google Scholar
• Pranzo , M . 2004 . Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times . European Journal of Operational Research , 153 ( 3 ) : 581 – 592 .
   Web of Science ®Google Scholar
• Raaymakers , W and Hoogeveen , J . 2000 . Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing . European Journal of Operational Research , 126 ( 1 ) : 131 – 151 .
   Web of Science ®Google Scholar
• Rajendran , C . 1994 . A no-wait fowshop scheduling heuristic to minimize makespan . Journal of the Operational Research Society , 45 ( 4 ) : 472 – 478 .
   Web of Science ®Google Scholar
• Rajendran , C and Chaudhuri , D . 1990 . Heuristic algorithms for continuous flow-shop problem . Naval Research Logistics , 37 ( 5 ) : 695 – 705 .
   Web of Science ®Google Scholar
• Reddi , S and Ramamoorthy , C . 1972 . On the flowshop sequencing problem with no-wait in process . Operational Research Quarterly , 23 ( 3 ) : 323 – 331 .
   Google Scholar
• Reeves , C . 1995 . A genetic algorithm for flowshop sequencing . Computers and Operations Research , 22 : 5 – 13 .
   Web of Science ®Google Scholar
• Rochat , Y and Taillard , E . 1995 . Probabilistic diversification and intensification in local search for vehicle routing . Journal of Heuristics , 1 ( 1 ) : 147 – 167 .
   Google Scholar
• Röck , H . 1984 . Some new results in flow shop scheduling . Zeitschrift für Operations Research , 28 ( 1 ) : 1 – 16 .
   Google Scholar
• Ruiza , R and Allahverdi , A . 2009 . New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness . International Journal of Production Research , 47 ( 20 ) : 5717 – 5738 .
   Web of Science ®Google Scholar
• Sahin , R and Turkbey , O . 2009 . A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem . International Journal of Production Research , 4 ( 24 ) : 6855 – 6873 .
   Web of Science ®Google Scholar
• Samarghandi , H and ElMekkawy , TY . 2011 . An efficient hybrid algorithm for the two-machine no-wait flow shop problem with separable setup times and single server . European Journal of Industrial Engineering , 5 ( 2 ) : 111 – 131 .
   Web of Science ®Google Scholar
• Schuster , C and Framinan , J . 2003 . Approximative procedures for no-wait job shop scheduling . Operations Research Letters , 31 ( 4 ) : 308 – 318 .
   Web of Science ®Google Scholar
• Sidney , J , Potts , C and Sriskandarayah , C . 2000 . Heuristic for scheduling two-machine no-wait flow shops with anticipatory setups . Operations Research Letters , 26 ( 4 ) : 165 – 173 .
   Web of Science ®Google Scholar
• Su , LH and Lee , YY . 2008 . The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time . Computers & Operations Research , 35 ( 9 ) : 2952 – 2963 .
   Web of Science ®Google Scholar
• Svirenko , M . 2003 . Makespan minimization in no-wait flow shops: a polynomial time approximation scheme . SIAM Journal on Discrete Mathematics , 16 ( 2 ) : 313 – 322 .
   Web of Science ®Google Scholar
• Tasgetiren , M . 2004 . Particle swarm optimization algorithm for permutation flowshop sequencing problem . Lecture Notes on Computer Science , 3172 : 382 – 389 .
   Google Scholar
• Wismer , D . 1972 . Solution of the flowshop-scheduling with no intermediate queues . Operations Research , 20 ( 3 ) : 689 – 697 .
   Web of Science ®Google Scholar
• Zhu , W , Curry , J and Marquez , A . 2010 . SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration . International Journal of Production Research , 48 ( 4 ) : 1035 – 1047 .
   Web of Science ®Google Scholar