Anomalies in Special Permutation Flow Shop Scheduling Problems
暂无分享,去创建一个
[1] Yu-gui Qu,et al. Heuristics for the No-Wait Flow Shop Problem with Makespan Criterion: Heuristics for the No-Wait Flow Shop Problem with Makespan Criterion , 2009 .
[2] D. Robb. The “More for Less” Paradox in Distribution Models: An Intuitive Explanation , 1990 .
[3] Raymond Chiong,et al. A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion , 2020, Comput. Oper. Res..
[4] M. A. Hakim Newton,et al. Makespan preserving flowshop reengineering via blocking constraints , 2019, Comput. Oper. Res..
[5] Yi Zhang,et al. A discrete Water Wave Optimization algorithm for no-wait flow shop scheduling problem , 2018, Expert Syst. Appl..
[6] Victor Fernandez-Viagas,et al. Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling , 2020, Eur. J. Oper. Res..
[7] Tim Roughgarden,et al. How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[8] Chelliah Sriskandarajah,et al. Minimizing Cycle Time in a Blocking Flowshop , 2000, Oper. Res..
[9] 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..
[10] Mariano Frutos,et al. The Non-Permutation Flow-Shop scheduling problem: A literature review , 2017, Omega.
[11] Ali Allahverdi,et al. No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan , 2020, Appl. Math. Comput..
[12] Christos Koulamas,et al. The evolution of schematic representations of flow shop scheduling problems , 2018, Journal of Scheduling.
[13] Ada Che,et al. Energy-efficient no-wait permutation flow shop scheduling by adaptive multi-objective variable neighborhood search , 2020 .
[14] Nouredine Melab,et al. A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem , 2020, Eur. J. Oper. Res..
[15] Liang Gao,et al. An Effective Hybrid Algorithm for Permutation Flow Shop Scheduling Problem with Setup Time , 2018 .
[16] 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..
[17] Pan Quan. Heuristics for the No-Wait Flow Shop Problem with Makespan Criterion , 2008 .
[18] Frits C. R. Spieksma,et al. The no-wait flow-shop paradox , 2005, Oper. Res. Lett..
[19] Javad Rezaeian,et al. Minimizing makespan for flow shop scheduling problem with intermediate buffers by using hybrid approach of artificial immune system , 2015, Appl. Soft Comput..
[20] Sigrid Knust,et al. Synchronous flow shop scheduling with pliable jobs , 2018, Eur. J. Oper. Res..
[21] Tim Roughgarden,et al. How bad is selfish routing? , 2002, JACM.
[22] Gautam Appa,et al. The Transportation Problem and its Variants , 1973 .
[23] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.
[24] Wlodzimierz Szwarc,et al. The Transportation Paradox. , 1971 .
[25] Christos Koulamas,et al. Analysis of flow shop scheduling anomalies , 2020, Eur. J. Oper. Res..
[26] Min Dai,et al. Energy-efficient approach to minimizing the energy consumption in an extended job-shop scheduling problem , 2015 .
[27] Ling Wang,et al. An improved multi-objective evolutionary algorithm based on decomposition for energy-efficient permutation flow shop scheduling problem with sequence-dependent setup time , 2018, Int. J. Prod. Res..
[28] Ning Zhao,et al. Effective Iterated Greedy Algorithm for Flow-Shop Scheduling Problems with Time lags , 2017, Chinese Journal of Mechanical Engineering.
[29] Sigrid Knust,et al. Complexity results for flow shop problems with synchronous movement , 2015, Eur. J. Oper. Res..
[30] Sigrid Knust,et al. Decomposition algorithms for synchronous flow shop problems with additional resources and setup times , 2017, Eur. J. Oper. Res..
[31] Jerzy Kamburowski,et al. On no-wait and no-idle flow shops with makespan criterion , 2007, Eur. J. Oper. Res..
[32] Aya Ishigaki,et al. Effective Neighborhood Generation Method in Search Algorithm for Flexible Job Shop Scheduling Problem , 2019, Int. J. Autom. Technol..
[33] Laszlo A. Belady,et al. An anomaly in space-time characteristics of certain programs running in a paging machine , 1969, CACM.
[34] Sigrid Knust,et al. Synchronous flow shop problems: How much can we gain by leaving machines idle?☆☆☆ , 2017 .