A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time
暂无分享,去创建一个
[1] M. S. Nagano,et al. Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times , 2022, J. Oper. Res. Soc..
[2] K. Allali,et al. Distributed no-wait flow shop problem with sequence dependent setup time: Optimization of makespan and maximum tardiness , 2021, Simul. Model. Pract. Theory.
[3] Shih-Wei Lin,et al. No-Idle Flowshop Scheduling for Energy-Efficient Production: An Improved Optimization Framework , 2021, Mathematics.
[4] Orhan Engin,et al. A hybrid genetic local and global search algorithm for solving no-wait flow shop problem with bi criteria , 2021, SN Applied Sciences.
[5] Marcelo Seido Nagano,et al. Heuristics and iterated greedy algorithms for the distributed mixed no-idle flowshop with sequence-dependent setup times , 2021, Comput. Ind. Eng..
[6] Marcelo Seido Nagano,et al. An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time , 2020 .
[7] Ada Che,et al. Energy-efficient no-wait permutation flow shop scheduling by adaptive multi-objective variable neighborhood search , 2020 .
[8] Marcelo Seido Nagano,et al. Heuristics and metaheuristics for the mixed no-idle flowshop with sequence-dependent setup times and total tardiness minimisation , 2020, Swarm Evol. Comput..
[9] Harpreet Singh,et al. Multi-objective permutation and non-permutation flow shop scheduling problems with no-wait: a systematic literature review , 2020, RAIRO Oper. Res..
[10] Fuqing Zhao,et al. A hybrid discrete water wave optimization algorithm for the no-idle flowshop scheduling problem with total tardiness criterion , 2020, Expert Syst. Appl..
[11] Barrie R. Nault,et al. Trade-off balancing between maximum and total completion times for no-wait flow shop production , 2020, Int. J. Prod. Res..
[12] Ali Allahverdi,et al. No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan , 2020, Appl. Math. Comput..
[13] Marcelo Seido Nagano,et al. Heuristics for the mixed no-idle flowshop with sequence-dependent setup times , 2019, J. Oper. Res. Soc..
[14] Said Aqil,et al. On a bi-criteria flow shop scheduling problem under constraints of blocking and sequence dependent setup time , 2019, Ann. Oper. Res..
[15] Ling Wang,et al. A collaborative optimization algorithm for energy-efficient multi-objective distributed no-idle flow-shop scheduling , 2019, Swarm Evol. Comput..
[16] Dechang Pi,et al. A novel multi-objective discrete water wave optimization for solving multi-objective blocking flow-shop scheduling problem , 2019, Knowl. Based Syst..
[17] Marcelo Seido Nagano,et al. High-performing heuristics to minimize flowtime in no-idle permutation flowshop , 2019 .
[18] Mariappan Kadarkarainadar Marichelvam,et al. A hybrid crow search algorithm to minimise the weighted sum of makespan and total flow time in a flow shop environment , 2018, Int. J. Comput. Aided Eng. Technol..
[19] Ali Allahverdi,et al. No-wait flowshop scheduling problem with two criteria; total tardiness and makespan , 2018, Eur. J. Oper. Res..
[20] Victor Fernandez-Viagas,et al. Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness , 2018, Expert Syst. Appl..
[21] Marcelo Seido Nagano,et al. A new efficient heuristic method for minimizing the total tardiness in a no-idle permutation flow shop , 2017, Prod. Eng..
[22] Xavier Tort-Martorell,et al. Efficient heuristics for the parallel blocking flow shop scheduling problem , 2017, Expert Syst. Appl..
[23] Dechang Pi,et al. Memetic algorithm with node and edge histogram for no-idle flow shop scheduling problem to minimize the makespan criterion , 2017, Appl. Soft Comput..
[24] In-Jae Jeong,et al. A two-level method of production planning and scheduling for bi-objective reentrant hybrid flow shops , 2017, Comput. Ind. Eng..
[25] Marcelo Seido Nagano,et al. An effective constructive heuristic for permutation flow shop scheduling problem with total flow time criterion , 2017 .
[26] Mariappan Kadarkarainadar Marichelvam,et al. A hybrid fruit fly optimisation algorithm to solve the flow shop scheduling problems with multi-objectives , 2017, Int. J. Adv. Intell. Paradigms.
[27] Quan-Ke Pan,et al. Energy-efficient permutation flow shop scheduling problem using a hybrid multi-objective backtracking search algorithm , 2017 .
[28] Ling Wang,et al. A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem , 2017, Swarm and Evolutionary Computation.
[29] Victor Fernandez-Viagas,et al. A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime , 2016, Expert Syst. Appl..
[30] Siti Zawiah Md Dawal,et al. Multi-objective adaptive large neighborhood search for distributed reentrant permutation flow shop scheduling , 2016, Appl. Soft Comput..
[31] Yan Jin,et al. A new Nawaz–Enscore–Ham-based heuristic for permutation flow-shop problems with bicriteria of makespan and machine idle time , 2016 .
[32] Marcelo Seido Nagano,et al. Evaluation of high performance constructive heuristics for the flow shop with makespan minimization , 2016 .
[33] Shiji Song,et al. Carbon-efficient scheduling of flow shops by multi-objective optimization , 2016, Eur. J. Oper. Res..
[34] Raymond Chiong,et al. An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem , 2015, Appl. Soft Comput..
[35] Yongquan Zhou,et al. Invasive weed optimization algorithm for optimization no-idle flow shop scheduling problem , 2014, Neurocomputing.
[36] Mehmet Mutlu Yenisey,et al. Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends , 2014 .
[37] Victor Fernandez-Viagas,et al. On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem , 2014, Comput. Oper. Res..
[38] Mehmet Fatih Tasgetiren,et al. A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem , 2013, Comput. Oper. Res..
[39] R. Tavakkoli-Moghaddam,et al. Optimizing a multi-objectives flow shop scheduling problem by a novel genetic algorithm , 2013 .
[40] Rubén Ruiz,et al. Multi-objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study , 2013, Eur. J. Oper. Res..
[41] Nasser Salmasi,et al. Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem , 2013, Comput. Ind. Eng..
[42] A. Allahverdi,et al. Algorithms for no-wait flowshops with total completion time subject to makespan , 2013 .
[43] Ali Allahverdi,et al. Heuristics for no-wait flowshops with makespan subject to mean completion time , 2012, Appl. Math. Comput..
[44] Xingsheng Gu,et al. A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion , 2012, Comput. Oper. Res..
[45] Rubén Ruiz,et al. Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems , 2011, Comput. Oper. Res..
[46] Thomas Stützle,et al. A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems , 2011, Comput. Oper. Res..
[47] Liang Gao,et al. Multi-objective optimization algorithms for flow shop scheduling problem: a review and prospects , 2011 .
[48] Xavier Tort-Martorell,et al. Comparing three-step heuristics for the permutation flow shop problem , 2010, Comput. Oper. Res..
[49] Quan-Ke Pan,et al. A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems , 2009, Comput. Oper. Res..
[50] A. Allahverdi,et al. New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness , 2009 .
[51] Sergey Sevastyanov,et al. The flow shop problem with no-idle constraints: A review and approximation , 2009, Eur. J. Oper. Res..
[52] Subhash C. Sarin,et al. A heuristic to minimize total flow time in permutation flow shop , 2009 .
[53] Rubén Ruiz,et al. New high performing heuristics for minimizing makespan in permutation flowshops , 2009 .
[54] Q. Wang,et al. Efficient composite heuristics for total flowtime minimization in permutation flow shops , 2009 .
[55] Ping Chen,et al. An improved NEH-based heuristic for the permutation flowshop problem , 2008, Comput. Oper. Res..
[56] Ling Wang,et al. No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm , 2008 .
[57] Jose M. Framiñan,et al. A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria , 2008, OR Spectr..
[58] Jerzy Kamburowski,et al. An improved NEH heuristic to minimize makespan in permutation flow shops , 2008, Comput. Oper. Res..
[59] Thomas Stützle,et al. An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives , 2008, Eur. J. Oper. Res..
[60] Mehmet Mutlu Yenisey,et al. Ant colony optimization for multi-objective flow shop scheduling problem , 2008, Comput. Ind. Eng..
[61] Quan-Ke Pan,et al. A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems , 2008 .
[62] R. Tavakkoli-Moghaddam,et al. A multi-objective scatter search for a bi-criteria no-wait flow shop scheduling problem , 2008 .
[63] Gur Mosheiov,et al. A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time , 2008, Eur. J. Oper. Res..
[64] Jerzy Kamburowski,et al. On no-wait and no-idle flow shops with makespan criterion , 2007, Eur. J. Oper. Res..
[65] Thomas Stützle,et al. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..
[66] Mehmet Fatih Tasgetiren,et al. A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..
[67] Rubén Ruiz,et al. TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM , 2006 .
[68] 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..
[69] Vinícius Amaral Armentano,et al. Genetic local search for multi-objective flowshop scheduling problems , 2005, Eur. J. Oper. Res..
[70] Jerzy Kamburowski,et al. A heuristic for minimizing the makespan in no-idle permutation flow shops , 2005, Comput. Ind. Eng..
[71] D. Ravindran,et al. Flow shop scheduling with multiple objective of minimizing makespan and total flow time , 2005 .
[72] Alain Guinet,et al. A travelling salesman approach to solve the F , 2005, Eur. J. Oper. Res..
[73] Jerzy Kamburowski,et al. More on three-machine no-idle flow shops , 2004, Comput. Ind. Eng..
[74] Ali Allahverdi,et al. A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness , 2004, Comput. Oper. Res..
[75] J. Framiñan,et al. An efficient constructive heuristic for flowtime minimisation in permutation flow shops , 2003 .
[76] Alain Guinet,et al. Three stage no-idle flow-shops , 2003 .
[77] Marcelo Seido Nagano,et al. A high quality solution constructive heuristic for flow shop sequencing , 2002, J. Oper. Res. Soc..
[78] Jean-Charles Billaut,et al. Multicriteria scheduling , 2005, Eur. J. Oper. Res..
[79] Kalyanmoy Deb,et al. A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..
[80] Jiyin Liu,et al. Constructive and composite heuristic solutions to the P// Sigma Ci scheduling problem , 2001, Eur. J. Oper. Res..
[81] C. Rajendran,et al. An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs , 1997 .
[82] C. Rajendran. Heuristics for scheduling in flowshop with multiple objectives , 1995 .
[83] Michael Pinedo. Scheduling: Theory, Algorithms, and Systems , 1994 .
[84] Yih-Long Chang,et al. A new heuristic for the n-job, M-machine flow-shop problem , 1991 .
[85] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[86] Xinyu Li,et al. A Variable Iterated Local Search Algorithm for Energy-Efficient No-idle Flowshop Scheduling Problem , 2019, Procedia Manufacturing.
[87] Mehmet Fatih Tasgetiren,et al. Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion , 2017, Comput. Oper. Res..
[88] Victor Fernandez-Viagas,et al. A new set of high-performing heuristics to minimise flowtime in permutation flowshops , 2015, Comput. Oper. Res..
[89] Shengyao Wang,et al. A bi-population EDA for solving the no-idle permutation flow-shop scheduling problem with the total tardiness criterion , 2015, Knowl. Based Syst..
[90] Rubén Ruiz,et al. A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..
[91] Dominik Zelazny,et al. Optimizing Bicriteria Flow Shop Scheduling Problem By Simulated Annealing Algorithm , 2013, ICCS.
[92] A. Allahverdi,et al. New Heuristics for No-Wait Flowshops with Performance Measures of Makespan and Mean Completion Time , 2013 .
[93] Rubén Ruiz,et al. Scheduling in Flowshops with No-Idle Machines , 2009 .
[94] 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 .
[95] Rainer Leisten,et al. A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness , 2006 .
[96] Jiyin Liu,et al. Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling , 1993 .
[97] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[98] Porpan Vachajitpan,et al. Job sequencing with continuous machine operation , 1982 .
[99] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .