Scheduling in Flowshops with No-Idle Machines
暂无分享,去创建一个
Rubén Ruiz | Eva Vallada | Carlos Fernández-Martínez | Rubén Ruiz | Eva Vallada | Carlos Fernández-Martínez
[1] Jerzy Kamburowski,et al. On no-wait and no-idle flow shops with makespan criterion , 2007, Eur. J. Oper. Res..
[2] Ling Wang,et al. No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm , 2008 .
[3] Colin R. Reeves,et al. A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..
[4] E. S. Page. An Approach to the Scheduling of Jobs on Machines , 1961 .
[5] D. Pohoryles,et al. Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times , 1982 .
[6] C. Rajendran,et al. Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem , 2003 .
[7] Rubén Ruiz,et al. TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM , 2006 .
[8] Christos Koulamas,et al. A new constructive heuristic for the flowshop scheduling problem , 1998, Eur. J. Oper. Res..
[9] Ulrich Dorndorf,et al. A Branch-and-Bound Algorithm , 2002 .
[10] S.M.A. Suliman,et al. A two-phase heuristic approach to the permutation flow-shop scheduling problem , 2000 .
[11] Ravi Sethi,et al. The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..
[12] Teofilo F. Gonzalez,et al. Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..
[13] Jose M. Framiñan,et al. A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria , 2008, OR Spectr..
[14] I. Osman,et al. Simulated annealing for permutation flow-shop scheduling , 1989 .
[15] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .
[16] Seetharama L. Narasimhan,et al. A COMPARISON OF SEQUENCING RULES FOR A TWO‐STATE HYBRID FLOW SHOP , 1987 .
[17] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[18] Alain Guinet,et al. Three stage no-idle flow-shops , 2003 .
[19] Fengshan Bai,et al. No-wait flexible flowshop scheduling with no-idle machines , 2005, Oper. Res. Lett..
[20] Margaret J. Robertson,et al. Design and Analysis of Experiments , 2006, Handbook of statistics.
[21] P. C. Bagga,et al. Flowshop/No-idle Scheduling to Minimize Total Elapsed Time , 2005, J. Glob. Optim..
[22] P. C. Bagga,et al. Flowshop/no-idle scheduling to minimise the mean flowtime , 2005, The ANZIAM Journal.
[23] Jerzy Kamburowski,et al. More on three-machine no-idle flow shops , 2004, Comput. Ind. Eng..
[24] Rubén Ruiz,et al. Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics , 2008, Comput. Oper. Res..
[25] David G. Dannenbring,et al. An Evaluation of Flow Shop Sequencing Heuristics , 1977 .
[26] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[27] Porpan Vachajitpan,et al. Job sequencing with continuous machine operation , 1982 .
[28] Joseph Y.-T. Leung,et al. Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..
[29] Jerzy Kamburowski,et al. A heuristic for minimizing the makespan in no-idle permutation flow shops , 2005, Comput. Ind. Eng..
[30] Quan-Ke Pan,et al. An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion , 2008 .
[31] Rubén Ruiz,et al. A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem , 2008, INFORMS J. Comput..
[32] C. R. Woollam. Flowshop with no idle machine time allowed , 1986 .
[33] Nour El Houda Saadani,et al. Relaxation of the no-idle constraint in the flow-shop problem , 2001 .
[34] Shijie Sun,et al. Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines , 2007, Eur. J. Oper. Res..
[35] Geoffrey I. Webb,et al. PRICAI 2006: Trends in Artificial Intelligence, 9th Pacific Rim International Conference on Artificial Intelligence, Guilin, China, August 7-11, 2006, Proceedings , 2006, PRICAI.
[36] Melvin E. Salveson,et al. ON A QUANTITATIVE METHOD IN PRODUCTION PLANNING AND SCHEDULING , 1952 .
[37] 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..
[38] Toàn Phan Huy,et al. A Branch-and-Bound Algorithm , 2000 .
[39] Scott Turner,et al. Comparison of heuristics for flow shop sequencing , 1987 .
[40] Krzysztof Giaro. NP-hardness of compact scheduling in simplified open and flow shops , 2001, Eur. J. Oper. Res..
[41] Thomas Stützle,et al. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..
[42] D. S. Palmer. Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .
[43] Quan-Ke Pan,et al. A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems , 2008 .
[44] Ching-Jong Liao. Minimizing the Number of Machine Idle Intervals with Minimum Makespan in a Flow-Shop , 1993 .
[45] Milan Vlach,et al. Note: On the two-machine no-idle flowshop problem , 2000 .
[46] É. Taillard. Some efficient heuristic methods for the flow shop sequencing problem , 1990 .
[47] K.-C. Ying,et al. An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks , 2009, J. Oper. Res. Soc..
[48] Shijie Sun,et al. A note on flow shop scheduling problems with a learning effect on no-idle dominant machines , 2007, Appl. Math. Comput..
[49] Jung Woo Jung,et al. Flowshop-scheduling problems with makespan criterion: a review , 2005 .
[50] Rubén Ruiz,et al. A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..
[51] Alain Guinet,et al. A travelling salesman approach to solve the F , 2005, Eur. J. Oper. Res..
[52] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[53] Rubén Ruiz,et al. Cooperative metaheuristics for the permutation flowshop scheduling problem , 2009, Eur. J. Oper. Res..
[54] Jose M. Framiñan,et al. A review and classification of heuristics for permutation flow-shop scheduling with makespan objective , 2004, J. Oper. Res. Soc..
[55] Rubén Ruiz,et al. New high performing heuristics for minimizing makespan in permutation flowshops , 2009 .
[56] Qun Niu,et al. An Improved Genetic-Based Particle Swarm Optimization for No-Idle Permutation Flow Shops with Fuzzy Processing Time , 2006, PRICAI.
[57] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .
[58] Yih-Long Chang,et al. A new heuristic for the n-job, M-machine flow-shop problem , 1991 .
[59] R. A. Dudek,et al. A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .
[60] V. S. Tanaev,et al. Scheduling Theory: Multi-Stage Systems , 1994 .
[61] 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..
[62] Seetuarma L. Narastmhan,et al. Scheduling in a two-stage manufacturing process , 1984 .