Scheduling Problems of Flexible Manufacturing Systems: Review, Classification and Opportunities
暂无分享,去创建一个
Abdellah El Barkany | Abdelouahhab Jabri | Ghita Lebbar | A. Jabri | G. Lebbar | A. El Barkany | Ghita Lebbar
[1] P. Asokan,et al. A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness , 2007, Int. J. Comput. Math..
[2] Tadeusz Sawik,et al. Optimal versus heuristic scheduling of surface mount technology lines , 2004 .
[3] Yi-Chih Hsieh,et al. A hybrid algorithm for the multi-stage flow shop group scheduling with sequence-dependent setup and transportation times , 2015 .
[4] Mohammad Mesgarpour,et al. Bicriteria Scheduling Problem on the Two-Machine Flowshop Using Simulated Annealing , 2010, EvoCOP.
[5] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[6] Rasaratnam Logendran,et al. Group scheduling in flexible flow shops , 2005 .
[7] B. Lina,et al. Development of new features of ant colony optimization for flowshop scheduling $ , 2008 .
[8] Chandrasekharan Rajendran,et al. Scheduling in flowshop and cellular manufacturing systems with multiple objectives— a genetic algorithmic approach , 1996 .
[9] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[10] Pin Luarn,et al. A discrete version of particle swarm optimization for flowshop scheduling problems , 2007, Comput. Oper. Res..
[11] Ahmad Rabanimotlagh,et al. An Efficient Ant Colony Optimization Algorithm for Multiobjective Flow Shop Scheduling Problem , 2011 .
[12] Michael Pinedo,et al. Optimization and heuristic algorithms for flexible flow shop scheduling , 1998 .
[13] Mohamed Haouari,et al. Optimal Scheduling of a Two-stage Hybrid Flow Shop , 2006, Math. Methods Oper. Res..
[14] Fawaz S. Al-Anzi,et al. Scheduling multi-stage parallel-processor services to minimize average response time , 2006, J. Oper. Res. Soc..
[15] Mostafa Zandieh,et al. Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness , 2009 .
[16] Jean-Charles Billaut,et al. Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art , 1999, RAIRO Oper. Res..
[17] Kuo-Ching Ying,et al. Minimising makespan for multistage hybrid flowshop scheduling problems with multiprocessor tasks by a hybrid immune algorithm , 2012 .
[18] Javad Rezaeian,et al. Two meta-heuristic algorithms for flexible flow shop scheduling problem with robotic transportation and release time , 2016, Appl. Soft Comput..
[19] Pierre Dejax,et al. An integrated approach for modeling and solving the scheduling problem of container handling systems , 2006 .
[20] Philippe Baptiste,et al. Solving hybrid flow shop problem using energetic reasoning and global operations , 2001 .
[21] P. Shahabudeen,et al. Bi-criteria improved genetic algorithm for scheduling in flowshops to minimise makespan and total flowtime of jobs , 2009, Int. J. Comput. Integr. Manuf..
[22] Jacques Teghem,et al. Scheduling hybrid flow shop problem with non-fixed availability constraints , 2010 .
[23] M AnthonyXavior,et al. A Genetic Algorithm Applied Heuristic to Minimize the Makespan in a Flow Shop , 2014 .
[24] W. Yeh. An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem , 2001 .
[25] Jatinder N. D. Gupta,et al. Two-machine flowshop scheduling with a secondary criterion , 2003, Comput. Oper. Res..
[26] Chandrasekharan Rajendran,et al. A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization , 1999 .
[27] Boris Detienne,et al. The two-machine flowshop total completion time problem: A branch-and-bound based on Network-flow formulation , 2015 .
[28] Michael J. Shaw,et al. Decision support system for scheduling a Flexible Flow System: Incorporation of feature construction , 1998, Ann. Oper. Res..
[29] Shih-Wei Lin,et al. Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems , 2009 .
[30] Chandrasekharan Rajendran,et al. Branch-and-bound algorithms for scheduling in an m-machine permutation flowshop with a single objective and with multiple objectives , 2011 .
[31] T. C. Edwin Cheng,et al. Two-agent two-machine flowshop scheduling with learning effects to minimize the total completion time , 2015, Comput. Ind. Eng..
[32] Ronald G. Askin,et al. Scheduling flexible flow lines with sequence-dependent setup times , 2004, Eur. J. Oper. Res..
[33] Fardin Ahmadizar,et al. A new ant colony algorithm for makespan minimization in permutation flow shops , 2012, Comput. Ind. Eng..
[34] R. Suresh,et al. Pareto archived simulated annealing for permutation flow shop scheduling with multiple objectives , 2004, IEEE Conference on Cybernetics and Intelligent Systems, 2004..
[35] Mitsuo Gen,et al. Specification of Genetic Search Directions in Cellular Multi-objective Genetic Algorithms , 2001, EMO.
[36] Jyh-Horng Chou,et al. Hybrid sliding level Taguchi-based particle swarm optimization for flowshop scheduling problems , 2014, Appl. Soft Comput..
[37] Ceyda Oguz,et al. Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion , 2007 .
[38] Mohammad Bagher Fakhrzad,et al. Solving flexible flow-shop problem with a hybrid genetic algorithm and data mining: A fuzzy approach , 2011, Expert Syst. Appl..
[39] C. Rajendran,et al. A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs , 2006 .
[40] J. Gupta,et al. Schedules for a two-stage hybrid flowshop with parallel machines at the second stage , 1991 .
[41] Babak Abbasi,et al. An efficient tabu search algorithm for flexible flow shop sequence-dependent group scheduling problems , 2012 .
[42] Mehmet Mutlu Yenisey,et al. A multi-objective ant colony system algorithm for flow shop scheduling problem , 2010, Expert Syst. Appl..
[43] Magdalene Marinaki,et al. Particle swarm optimization with expanding neighborhood topology for the permutation flowshop scheduling problem , 2013, Soft Computing.
[44] C. Proust,et al. New lower bound for the hybrid flowshop scheduling problem , 1997, 1997 IEEE 6th International Conference on Emerging Technologies and Factory Automation Proceedings, EFTA '97.
[45] Nicolas Monmarché,et al. An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem , 2002, Eur. J. Oper. Res..
[46] Jiyin Liu,et al. Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling , 1993 .
[47] S. H. Choi,et al. Flexible flow shop scheduling with stochastic processing times: A decomposition-based approach , 2012, Comput. Ind. Eng..
[48] Wendong Xiao,et al. Hybrid flow shop scheduling using genetic algorithms , 2000, Proceedings of the 3rd World Congress on Intelligent Control and Automation (Cat. No.00EX393).
[49] Vinícius Amaral Armentano,et al. Genetic local search for multi-objective flowshop scheduling problems , 2005, Eur. J. Oper. Res..
[50] H. Ishibuchi,et al. Multi-objective genetic algorithm and its applications to flowshop scheduling , 1996 .
[51] Quang-Chieu Ta. Matheuristic algorithms for minimizing total tardiness in flow shop scheduling problems , 2015 .
[52] Chandrasekharan Rajendran,et al. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs , 2004, Eur. J. Oper. Res..
[53] Yahya Fathi,et al. Abstract Discrete Optimization , 2000 .
[54] Ceyda Oguz,et al. Hybrid flow-shop scheduling problems with multiprocessor task systems , 2004, Eur. J. Oper. Res..
[55] Kouassi Hilaire Edi. Affectation flexible des ressources dans la planification des activités industrielles : prise en compte de la modulation d'horaires et de la polyvalence , 2007 .
[56] Chris N. Potts,et al. Scheduling a two-stage hybrid flow shop with parallel machines at the first stage , 1997, Ann. Oper. Res..
[57] Imed Kacem,et al. Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates , 2012, Comput. Oper. Res..
[58] Eliana María González-Neira,et al. GRASP to minimize total weighted tardiness in a permutation flow shop environment , 2016 .
[59] C.-J. Liao,et al. Bicriterion scheduling in the two-machine flowshop , 1997 .
[60] Antony Vignier,et al. A branch and bound approach to minimize the total completion time in a k-stage hybrid flowshop , 1996, Proceedings 1996 IEEE Conference on Emerging Technologies and Factory Automation. ETFA '96.
[61] Wojciech Bozejko,et al. Parallel tabu search algorithm for the hybrid flow shop problem , 2013, Comput. Ind. Eng..
[62] R. A. Dudek,et al. A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .
[63] P. Chang,et al. The development of gradual-priority weighting approach for the multi-objective flowshop scheduling problem , 2002 .
[64] Martin Josef Geiger,et al. On operators and search space topology in multi-objective flow shop scheduling , 2007, Eur. J. Oper. Res..
[65] Shijin Wang,et al. A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling , 2015 .
[66] Mitsuo Gen,et al. Metaheuristics optimization approaches for two-stage reentrant flexible flow shop with blocking constraint , 2015, Expert Syst. Appl..
[67] Rong-Hwa Huang,et al. Solving a multi-objective overlapping flow-shop scheduling , 2008 .
[68] D. Chaudhuri,et al. An efficient heuristic approach to the scheduling of jobs in a flowshop , 1992 .
[69] Hiroshi Morita,et al. Hybrid Branch and Bound Method with Genetic Algorithm for Flexible Flowshop Scheduling Problem , 2005 .
[70] Hiroyuki Tamura,et al. A new multiobjective genetic algorithm with heterogeneous population for solving flowshop scheduling problems , 2007, Int. J. Comput. Integr. Manuf..
[71] Tapan P. Bagchi,et al. Multiobjective Flowshop Scheduling , 1999 .
[72] Purushothaman Damodaran,et al. Particle swarm optimization for scheduling batch processing machines in a permutation flowshop , 2013 .
[73] Reha Uzsoy,et al. Efficient Algorithms for Scheduling Semiconductor Burn-In Operations , 1992, Oper. Res..
[74] Suna Kondakci Köksalan,et al. Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan , 2004, Eur. J. Oper. Res..
[75] Richard D. Smith,et al. A General Algorithm for Solution of the n-Job, M-Machine Sequencing Problem of the Flow Shop , 1967, Oper. Res..
[76] Quan-Ke Pan,et al. An estimation of distribution algorithm for lot-streaming flow shop problems with setup times , 2012 .
[77] José Elias Claudio Arroyo,et al. A GRASP heuristic for the multi-objective permutation flowshop scheduling problem , 2011 .
[78] Mostafa Zandieh,et al. An improved hybrid multi-objective parallel genetic algorithm for hybrid flow shop scheduling with unrelated parallel machines , 2010 .
[79] I. Osman,et al. Simulated annealing for permutation flow-shop scheduling , 1989 .
[80] Jean-Charles Billaut,et al. Production , Manufacturing and Logistics A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation , 2004 .
[81] Chandrasekharan Rajendran,et al. Two-Stage Flowshop Scheduling Problem with Bicriteria , 1992 .
[82] Kannan Govindan,et al. A multi-objective simulated annealing algorithm for permutation flow shop scheduling problem , 2011, Int. J. Adv. Oper. Manag..
[83] Chung-Cheng Lu,et al. Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates , 2011, Comput. Oper. Res..
[84] Somnuk Phon-Amnuaisuk,et al. Metaheuristic methods in hybrid flow shop scheduling problem , 2011, Expert Syst. Appl..
[85] Chung-Yang Liu,et al. Scheduling flexible flow shops with sequence-dependent setup effect , 1996, Proceedings of 35th IEEE Conference on Decision and Control.
[86] Reza Tavakkoli-Moghaddam,et al. An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports , 2009, Comput. Ind. Eng..
[87] Chinyao Low,et al. Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines , 2005, Comput. Oper. Res..
[88] Jatinder N. D. Gupta,et al. Local search heuristics for two-stage flow shop problems with secondary criterion , 2002, Comput. Oper. Res..
[89] Rasaratnam Logendran,et al. Sequence-dependent group scheduling problems in flexible flow shops , 2006 .
[90] Yogesh Kumar Dwivedi,et al. A profile of OR research and practice published in the Journal of the Operational Research Society , 2010, J. Oper. Res. Soc..
[91] B. Lin,et al. Bicriteria scheduling in a two-machine permutation flowshop , 2006 .
[92] Zhihong Jin,et al. Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem , 2006 .
[93] Lin Lin,et al. A Local Search Algorithm for the Flow Shop Scheduling Problem with Release Dates , 2015 .
[94] Martin Josef Geiger,et al. Decision support for multi-objective flow shop scheduling by the Pareto Iterated Local Search methodology , 2011, Comput. Ind. Eng..
[95] J. Hunsucker,et al. BRANCH AND BOUND ALGORITHM FOR THE FLOW SHOP WITH MULTIPLE PROCESSORS , 1991 .
[96] Ebbe G. Negenman,et al. Local search algorithms for the multiprocessor flow shop scheduling problem , 2001, Eur. J. Oper. Res..
[97] El Awady Attia,et al. Flexible resources allocation techniques: characteristics and modelling , 2012 .
[98] Chandrasekharan Rajendran,et al. A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs , 2005, Eur. J. Oper. Res..
[99] Mehmet Mutlu Yenisey,et al. Ant colony optimization for multi-objective flow shop scheduling problem , 2008, Comput. Ind. Eng..
[100] Jen-Shiang Chen,et al. Minimising mean tardiness with alternative operations in two-machine flow-shop scheduling , 2005, Int. J. Syst. Sci..
[101] S.M.T. Fatemi Ghomi,et al. Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates , 2014 .
[102] David S. Johnson,et al. Two-Processor Scheduling with Start-Times and Deadlines , 1977, SIAM J. Comput..
[103] Chandrasekharan Rajendran,et al. Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs , 2009, J. Oper. Res. Soc..
[104] Yves Pochet,et al. A branch-and-bound algorithm for the hybrid flowshop , 2000 .
[105] Sunderesh S. Heragu,et al. A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem , 1995 .
[106] Abdellah Salhi,et al. Performance of single stage representation genetic algorithms in scheduling flexible flow shops , 2005, 2005 IEEE Congress on Evolutionary Computation.
[107] J E C Arroyo,et al. A partial enumeration heuristic for multi-objective flowshop scheduling problems , 2004, J. Oper. Res. Soc..
[108] G.-C. Lee,et al. A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness , 2004 .
[109] Günther R. Raidl,et al. Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification , 2005, IWINAC.
[110] Jacques Carlier,et al. An Exact Method for Solving the Multi-Processor Flow-Shop , 2000, RAIRO Oper. Res..
[111] Bertrand M. T. Lin,et al. A branch-and-bound algorithm for makespan minimization in differentiation flow shops , 2013 .
[112] Jean-Charles Billaut,et al. Multicriteria scheduling , 2005, Eur. J. Oper. Res..
[113] Mohamed Haouari,et al. A branch-and-bound-based local search method for the flow shop problem , 2003, J. Oper. Res. Soc..
[114] Wen-Chiung Lee,et al. Minimizing the total flow time and the tardiness in a two-machine flow shop , 2001, Int. J. Syst. Sci..
[115] Mehmet Fatih Tasgetiren,et al. A populated local search with differential evolution for blocking flowshop scheduling problem , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).
[116] Jatinder N. D. Gupta,et al. Genetic algorithms for the two-stage bicriteria flowshop problem , 1996 .
[117] Ghasem Moslehi,et al. Optimizing blocking flow shop scheduling problem with total completion time criterion , 2013, Comput. Oper. Res..
[118] Jen-Shiang Chen,et al. Minimizing tardiness in a two-machine flow-shop , 2002, Comput. Oper. Res..
[119] Mohammad Taghi Rezvan,et al. A branch-and-bound algorithm for minimising the number of tardy jobs in a two-machine flow-shop problem with release dates , 2014, Int. J. Comput. Integr. Manuf..
[120] Thomas Stützle,et al. A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems , 2011, Comput. Oper. Res..
[121] Ahmet Bolat,et al. Flow-shop scheduling for three serial stations with the last two duplicate , 2005, Comput. Oper. Res..
[122] Abdelhakim Artiba,et al. Scheduling two-stage hybrid flow shop with availability constraints , 2006, Comput. Oper. Res..
[123] J. Framiñan,et al. A fitness-based weighting mechanism for multicriteria flowshop scheduling using genetic algorithms , 2009 .
[124] Dong-Ho Lee,et al. Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops , 2009, Comput. Ind. Eng..
[125] Yi Wu,et al. A genetic algorithm for solving flow shop scheduling problems with parallel machine and special procedure constraints , 2003, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).
[126] Mohamed Haouari,et al. Heuristic algorithms for the two-stage hybrid flowshop problem , 1997, Oper. Res. Lett..
[127] 李世銓,et al. 具等候時間限制下極小化總延遲時間之雙機流水排程問題; Minimizing tardiness in a two-machine flows-shop with limited waiting time constraint , 2003 .
[128] 陳春龍,et al. Designing a tabu search algorithm for the two-stage flow shop problem with secondary criterion , 1999 .
[129] Reza Tavakkoli-Moghaddam,et al. A memetic algorithm for the flexible flow line scheduling problem with processor blocking , 2009, Comput. Oper. Res..