A performance evaluation of permutation vs. non-permutation schedules in a flowshop

References

• Armentano , VA and Ronconi , DP . 1999 . Tabu search for total tardiness minimization in flowshop scheduling problems . Comput. Oper. Res. , 26 : 219 – 235 .
   Web of Science ®Google Scholar
• Ben-Daya , M and Al-Fawzan , M . 1998 . A tabu search approach for the flow shop scheduling problem . Eur. J. Oper. Res. , 109 : 88 – 95 .
   Web of Science ®Google Scholar
• Crainic , TG , Gendreau , M and Farvolden , JM . 2000 . Simplex-based tabu search for the multicommodity capacitated fixed charge network design problem . INFORMS J. Comput. , 12 : 223 – 236 .
   Web of Science ®Google Scholar
• Framinan , JM and Leisten , R . 2003 . An efficient constructive heuristic for flowtime minimisation in permutation flow shops . Omega , 31 : 311 – 317 .
   Web of Science ®Google Scholar
• Gendreau , M , Guertin , F , Potvin , J-Y and Taillard , ÉD . 1999 . Parallel tabu search for real-time vehicle routing and dispatching . Transport. Sci. , 33 : 381 – 390 .
   Web of Science ®Google Scholar
• Glover , F . 1986 . Future paths for integer programming and links to artificial intelligence . Comput. Oper. Res. , 13 : 533 – 549 .
   Web of Science ®Google Scholar
• Glover , F . 1993 . A user's guide tabu search . Ann. Oper. Res. , 41 : 3 – 28 .
   Google Scholar
• Grabowski , J and Wodecki , M . 2004 . A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion . Comput. Oper. Res. , 10 : 281 – 284 .
   Google Scholar
• Hao , Q , Yang , Z , Wang , D and Li , Z . 1996 . Common due-date determination and sequencing using tabu search . Comput. Oper. Res. , 23 : 409 – 417 .
   Web of Science ®Google Scholar
• Koulamas , C . 1998 . A new constructive heuristic for the flowshop scheduling problem . Eur. J. Oper. Res. , 105 : 66 – 71 .
   Web of Science ®Google Scholar
• Nawaz , M , Encore , EE and Ham , I . 1983 . A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem . Omega , 11 : 91 – 95 .
   Web of Science ®Google Scholar
• Pinedo , M . 2002 . Scheduling: Theory, Algorithms and Systems, , 2nd , Englewood Cliffs, NJ : NJ: Prentice-Hall .
   Google Scholar
• Potts , CN , Shmoys , DB and Williamson , DP . 1991 . Permutation vs. non-permutation flow shop schedules . Oper. Res. Lett. , 10 : 281 – 284 .
   Web of Science ®Google Scholar
• Potts , CN and Van Wassenhove , LN . 1982 . A decomposition algorithm for the single machine total tardiness problem . Oper. Res. Lett. , 1 : 177 – 181 .
   Google Scholar
• Pugazhendhi , S , Thiagarajan , S , Rajendran , C and Anantharaman , N . 2002 . Performance enhancement by using non-permutation schedules in flowline-based manufacturing systems . Comput. Ind. Eng. , 44 : 133 – 157 .
   Web of Science ®Google Scholar
• Pugazhendhi , S , Thiagarajan , S , Rajendran , C and Anantharaman , N . 2004a . Relative performance evaluation of permutation and non-permutation schedules in flowline-based manufacturing systems with flowtime objective . Int. J. Adv. Manuf. Technol. , 23 : 820 – 830 .
   Web of Science ®Google Scholar
• Pugazhendhi , S , Thiagarajan , S , Rajendran , C and Anantharaman , N . 2004b . Generating non-permutation schedules in flowline-based manufacturing systems with sequence-dependent setup times of jobs: a heuristic approach . Int. J. Adv. Manuf. Technol. , 23 : 64 – 78 .
   Web of Science ®Google Scholar
• Rajendran , C and Ziegler , H . 2001 . A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs . Eur. J. Oper. Res. , 131 : 622 – 634 .
   Web of Science ®Google Scholar
• Rebaine , D . 2005 . Flow shop vs. permutation shop with time delays . Comput. Ind. Eng. , 48 : 357 – 362 .
   Web of Science ®Google Scholar
• Reeves , CR . 1995 . A genetic algorithm for flowshop sequencing . Comput. Oper. Res. , 22 : 5 – 13 .
   Web of Science ®Google Scholar
• Ruiz , R and Maroto , C . 2005 . A comprehensive review and evaluation of permutation flowshop heuristics . Eur. J. Oper. Res. , 165 : 479 – 494 .
   Web of Science ®Google Scholar
• Skorin-Kapov , J . 1990 . Tabu search applied to the quadratic assignment problem . ORSA J. Comput. , 2 : 33 – 45 .
   Google Scholar
• Sridhar , J and Rajendran , C . 1996 . Scheduling in flowshop and cellular manufacturing systems with multiple objectives—a genetic algorithmic approach . Prod. Plan. Control , 7 : 374 – 382 .
   Web of Science ®Google Scholar
• Stützle , T . 1998 . Applying iterated local search to the permutation flow shop problem . 1998 , TH Darmstadt, Germany. Technical Report AIDA-98–04 , FG Intellektik .
   Google Scholar
• Taillard , E . 1990 . Some efficient heuristic methods for the flow shop sequencing problem . Eur. J. Oper. Res. , 47 : 65 – 74 .
   Web of Science ®Google Scholar
• Taillard , E . 1993 . Benchmarks for basic scheduling problems . Eur. J. Oper. Res. , 64 : 278 – 285 .
   Web of Science ®Google Scholar
• Tandon , M , Cummings , PT and LeVan , MD . 1991 . Flowshop sequencing with non-permutation schedules . Comput. Chem. Eng. , 15 : 601 – 607 .
   Web of Science ®Google Scholar