Bi-objective partial flexible job shop scheduling problem: NSGA-II, NRGA, MOGA and PAES approaches

References

• Ahn , CW . 2006 . Advances in evolutionary algorithms: Theory, design and practice , New York : Springer .
   Google Scholar
• Al Jaddan , O , Rajamani , L and Rao , CR . 2008 . Non-dominated ranked genetic algorithm for solving multi-objective optimization problem: NRGA . Journal of Theoretical and Applied Information Technology , 4 ( 1 ) : 61 – 68 .
   Google Scholar
• Amin , GR . 2009 . Comments on finding the most efficient DMUs in DEA: An improved integrated model . Computers & Industrial Engineering , 56 ( 4 ) : 1701 – 1702 .
   Web of Science ®Google Scholar
• Amiri , M . 2010 . A variable neighbourhood search algorithm for the flexible job-shop scheduling problem . International Journal of Production Research , 48 ( 19 ) : 5671 – 5689 .
   Web of Science ®Google Scholar
• Anagnostopoulos , KP and Mamanis , G . 2010 . A portfolio optimization model with three objectives and discrete variables . Computers & Operations Research , 37 ( 7 ) : 1285 – 1297 .
   Web of Science ®Google Scholar
• Bäck , T . Hoffmeister, F. and Schwefel, H.-P., 1991. A survey of evolution strategies. In: R.K. Belew and L.B. Booker, eds. Proceedings of the Fourth International Conference on Genetic Algorithms, Morgan Kaufmann
   Google Scholar
• Bagheri , A and Zandieh , M . 2011 . Bi-criteria flexible job-shop scheduling with sequence-dependent setup times – variable neighborhood search approach . Journal of Manufacturing Systems , 30 ( 1 ) : 8 – 15 .
   Web of Science ®Google Scholar
• Bagheri , A . 2010 . An artificial immune algorithm for the flexible job-shop scheduling problem . Future Generation Computer Systems , 26 ( 4 ) : 533 – 541 .
   Web of Science ®Google Scholar
• Brandimarte , P . 1993 . Routing and scheduling in a flexible job shop by taboo search . Annals of Operations Research , 41 : 157 – 183 .
   Google Scholar
• Brucker , P and Neyer , J . 1998 . Tabu search for the multi-mode jobshop problem . OR Spektrum , 20 ( 1 ) : 21 – 28 .
   Google Scholar
• Brucker , P and Schlie , R . 1990 . Job-shop scheduling with multipurpose machines . Computing , 45 ( 4 ) : 369 – 375 .
   Web of Science ®Google Scholar
• Brucker , P and Jurisch , B . 1993 . A new lower bound for job-shop scheduling problem . European Journal of Operational Research , 64 ( 2 ) : 156 – 167 .
   Web of Science ®Google Scholar
• Chen , H . Ihlow, J., and Lehmann, C., 1999. A genetic algorithm for flexible job-shop scheduling. IEEE international conference on robotics and automation, Detroit, 1120–1125
   Google Scholar
• Chen , H and Luh , PB . 2003 . An alternative framework to Lagrangian relaxation approach for job shop scheduling . European Journal of Operational Research , 149 ( 3 ) : 499 – 512 .
   Web of Science ®Google Scholar
• Cheng , F and Ye , F . 2011. A two objective optimisation model for order splitting among parallel suppliers. International Journal of Production Research, 49 (10), 2759–2769
   Google Scholar
• Coello Coello , CA , Van Veldhuisen , DA and Lamont , GB . 2002 . Evolutionary algorithms for solving multi-objective problems , Singapore : Kluwer Academic .
   Google Scholar
• Dauzére-Pérés , S and Paulli , J . 1997 . An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search . Annals of Operations Research , 70 ( 1 ) : 281 – 306 .
   Web of Science ®Google Scholar
• Deb , K . 2002 . A fast and elitist multiobjective genetic algorithm: NSGA-II . IEEE Transactions on Evolutionary Computation , 6 ( 2 ) : 182 – 197 .
   Web of Science ®Google Scholar
• Dimopoulos , C . 2006 . Multi-objective optimization of manufacturing cell design . International Journal of Production Research , 44 ( 22 ) : 4855 – 4875 .
   Web of Science ®Google Scholar
• Eiben , AE and Smith , JE . 2003 . Introduction to evolutionary computing , 1st , Springer .
   Google Scholar
• Fangqi , C and Feifan , Y . 2011 . A two objective optimization model for order splitting among parallel suppliers . International Journal of Production Research , 49 ( 10 ) : 2759 – 2769 .
   Web of Science ®Google Scholar
• Frutos , M , Olivera , AC and Tohmé , F . 2010 . A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem . Annals of Operation Researches , 181 ( 1 ) : 745 – 765 .
   Web of Science ®Google Scholar
• Garey , MR , Johmson , DS and Sethi , R . 1976 . The complexity of flow shop and job shop scheduling . Mathematics of Operational , 1 ( 2 ) : 117 – 29 .
   Google Scholar
• Hammadi , S . Kacem, I., and Borne, P., 2001. Approche évolutionniste modulaire controlée pour le problème du type job shop flexible. Journées doctorales d’Automatique, 25–27 septembre, Toulouse, France
   Google Scholar
• Horn , J , Nafploitis , N and Goldberg , DE . 1994 . “ A niched Pareto genetic algorithm for multiobjective optimization ” . In Proceedings of the 1st IEEE conference on evolutionary computation , Edited by: Michalewicz , Z . 82 – 87 . Piscataway , NJ : IEEE Press .
   Google Scholar
• Hurink , J . Jurisch, B. and Thole, M., 1994. Tabu search for the job-shop scheduling problem with multi-purpose machines. OR Spectrum, 15, 4 , 205–215
   Google Scholar
• Hwang , C and Yoon , K . 1981 . Multiple attribute decision making: methods and applications , Berlin : Springer .
   Google Scholar
• Jensen , MT . 2003 . Generating robust and flexible job shop schedules using genetic algorithms . IEEE Transactions on Evolutionary Computation , 7 ( 3 ) : 275 – 288 .
   Web of Science ®Google Scholar
• Jeong , B , Lee , J and Cho , H . 2005 . Efficient optimization of process parameters in shadow mask manufacturing using NNPLS and genetic algorithm . International Journal of Production Research , 43 ( 15 ) : 3209 – 3230 .
   Web of Science ®Google Scholar
• Jun-Qing , L . Pan, Q.K. and Xie, S.X., 2010. A hybrid variable neighborhood search algorithm for solving multi-objective flexible job shop problems. Computer Science and Information Systems/ComSIS, 7, 4 , 907–930
   Google Scholar
• Kacem , I , Hammadi , S and Borne , P . 2002a . Pareto-optimality approach for flexible job-shop scheduling problems: hybridisation of evolutionary algorithms and fuzzy logic . Mathematics and Computers in Simulation , 60 ( 3 ) : 245 – 276 .
   Web of Science ®Google Scholar
• Kacem , I , Hammadi , S and Borne , P . 2002b . Approach by localisation and multi-objective evolutionary optimisation for flexible job-shop scheduling problems . IEEE Transactions on Systems, Man and Cybernetics, Part C , 32 ( 1 ) : 408 – 419 .
   PubMed Web of Science ®Google Scholar
• Kim , YK , Park , K and Ko , J . 2003 . A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling . Computers & Operations Research , 30 ( 8 ) : 1151 – 1171 .
   Web of Science ®Google Scholar
• Kis , T . 2003 . Job-shop scheduling with processing alternatives . European Journal of Operational Research , 151 ( 2 ) : 307 – 332 .
   Web of Science ®Google Scholar
• Knowles , JD and Corne , DW . 2000 . Approximating the non-dominated front using the Pareto archived evolution strategy . Evolutionary Computation , 8 ( 2 ) : 149 – 172 .
   PubMed Web of Science ®Google Scholar
• Knowles , JD and Corne , DW . 1999. The Pareto archived evolution strategy: A new baseline algorithm for multiobjective optimisation. 1999 congress on evolutionary computation, July, Piscataway, NJ. Washington, DC, USA: IEEE Service Center, 98–105
   Google Scholar
• Liouane , N . 2007 . Ant systems and local search optimization for flexible job-shop scheduling production . International Journal of Computers, Communications & Control , 2 ( 2 ) : 2174 – 2184 .
   Web of Science ®Google Scholar
• Liu , HB . 2006 . Variable neighborhood particle swarm optimization for multi-objective flexible job-shop scheduling problems . Lecture Notes Computer Science , 4247 ( 1 ) : 197 – 204 .
   Google Scholar
• Mastrolilli , M and Gambardella , LM . 2000 . Effective neighbourhood functions for the flexible job shop problem . Journal of Scheduling , 3 ( 1 ) : 3 – 20 .
   Google Scholar
• Mokeddem , D and Khellaf , A . 2010 . Optimal feeding profile in fed-batch bioreactors using a genetic algorithm . International Journal of Production Research , 48 ( 20 ) : 6125 – 6135 .
   Web of Science ®Google Scholar
• Moon , I , Lee , S and Bae , H . 2008 . Genetic algorithms for job shop scheduling problems with alternative routings . International Journal of Production Research , 46 ( 10 ) : 2695 – 2705 .
   Web of Science ®Google Scholar
• Moradi , H . 12 . Zandieh, M. and Mahdavi, I., 2011. Non-dominated ranked genetic algorithm for a multi-objective mixed-model assembly line sequencing problem. International Journal of Production Research, 49 , 3479–3499
   Google Scholar
• Moslehi , G and Mahnam , M . 2010 . A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search . International Journal of Production Economics , 129 ( 1 ) : 14 – 22 .
   Web of Science ®Google Scholar
• Naderi , B and Ruiz , R . 2010 . The distributed permutation flow shop scheduling problem . Computers & Operations Research , 37 ( 4 ) : 754 – 768 .
   Web of Science ®Google Scholar
• Najid , N . Dauzere-Peres, S. and Zaidat, A., 2002. A modified simulated annealing method for flexible job shop scheduling problem. IEEE International Conference, Nantes, France, DOI: 10.1109/ICSMC.2002.1176334
   Google Scholar
• Nowicki , E and Smutnicki , C . 1996. A fast taboo search algorithm for the job shop problem. Management Science, 42 (6), 797–813
   Google Scholar
• Paulli , J . 1995 . A hierarchical approach for the FMS scheduling problem . European Journal of Operation Research , 86 : 32 – 42 .
   Web of Science ®Google Scholar
• Pezzella , F , Morganti , G and Ciaschetti , G . 2008 . A genetic algorithm for the flexible job-shop scheduling problem . Computers and Operations Research , 35 ( 10 ) : 3202 – 3212 .
   Web of Science ®Google Scholar
• Qing , LJ , Pan , QK and Xian , XS . 2010 . A hybrid variable neighbourhood search algorithm for solving multi-objective flexible job shop problems . Computer Science and Information Systems , 7 ( 4 ) : 907 – 930 .
   Web of Science ®Google Scholar
• Saidi-mehrabad , M and Fattahi , P . 2007 . Flexible job shop scheduling with tabu search algorithms . International Journal of Advanced Manufacturing Technology , 32 ( 5 ) : 563 – 570 .
   Web of Science ®Google Scholar
• Steuer , RE . 1986 . Multiple criteria optimisation: Theory, computation, and application , New York : John Wiley and Sons, Inc .
   Google Scholar
• Van Laarhoven , PJM , Aarts , EHL and Lenstra , JK . 1992 . Job shop scheduling by simulated annealing . Operations Research , 40 ( 1 ) : 113 – 125 .
   Web of Science ®Google Scholar
• Wang , S and Yu , J . 2010 . An effective heuristic for flexible job-shop scheduling problem with maintenance activities . Computers & Industrial Engineering , 59 ( 3 ) : 436 – 447 .
   Web of Science ®Google Scholar
• Wu , T and Blackhurst , J . 2009 . Supplier evaluation and selection: an augmented DEA approach . International Journal of Production Research , 47 ( 16 ) : 4593 – 4608 .
   Web of Science ®Google Scholar
• Xia , WJ and Wu , ZM . 2005 . An effective hybrid optimisation approach for multiobjective flexible job-shop scheduling problems . Computers and Industrial Engineering , 48 ( 2 ) : 409 – 425 .
   Web of Science ®Google Scholar
• Yazdani , M , Zandieh , M and Amiri , M . 2009 . Flexible job-shop scheduling with parallel variable neighborhood search algorithm . Expert Systems with Applications , 37 ( 1 ) : 678 – 687 .
   Web of Science ®Google Scholar
• Zhaoliang , J . 2011 . Inventory-shortage driven optimisation for product configuration variation . International Journal of Production Research , 49 ( 4 ) : 1045 – 1060 .
   Web of Science ®Google Scholar
• Zhou , G , Min , H and Gen , M . 2003 . A genetic algorithm approach to the bi criteria allocation of customers to warehouses . International Journal of Production Economics , 86 ( 1 ) : 35 – 45 .
   Web of Science ®Google Scholar
• Zitzler , E . 1999. Evolutionary algorithms for multiobjective optimisation: methods and applications. Thesis (Doctoral dissertation ETH 13398). Swiss Federal Institute of Technology (ETH), Zurich, Switzerland
   Google Scholar
• Zitzler , E . Laumanns, M. and Thiele, L., 2001. SPEA2: improving the performance of the strength Pareto evolutionary algorithm. Technical report
   Google Scholar