325
Views
25
CrossRef citations to date
0
Altmetric
Original Articles

Multi-objective biased randomised iterated greedy for robust permutation flow shop scheduling problem under disturbances

ORCID Icon, ORCID Icon & ORCID Icon
Pages 1847-1859 | Received 08 Aug 2018, Accepted 02 Jun 2019, Published online: 12 Jul 2019

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (2)

Qihao Liu, Xinyu Li, Liang Gao & Jiaxin Fan. (2023) Two novel MILP models with different flexibilities for solving integrated process planning and scheduling problems. Journal of the Operational Research Society 74:9, pages 1955-1967.
Read now
Reza Gharoie Ahangar, Robert Pavur & Hani Gharavi. (2022) A global optima search field division method for evolutionary algorithms. Journal of the Operational Research Society 73:5, pages 1085-1104.
Read now

Articles from other publishers (23)

Qiurui Liu, Yanfang Ma, Lin Chen, Witold Pedrycz, Mirosław J. Skibniewski & Zhen-Song Chen. (2024) Artificial intelligence for production, operations and logistics management in modular construction industry: A systematic literature review. Information Fusion 109, pages 102423.
Crossref
Amir M. Fathollahi-Fard, Lyne Woodward & Ouassima Akhrif. (2024) A distributed permutation flow-shop considering sustainability criteria and real-time scheduling. Journal of Industrial Information Integration 39, pages 100598.
Crossref
Amir M. Fathollahi-Fard, Lyne Woodward & Ouassima Akhrif. (2024) A scenario-based robust optimization model for the sustainable distributed permutation flow-shop scheduling problem. Annals of Operations Research.
Crossref
Felix Grumbach, Anna Müller, Pascal Reusch & Sebastian Trojahn. (2022) Robust-stable scheduling in dynamic flow shops based on deep reinforcement learning. Journal of Intelligent Manufacturing 35:2, pages 667-686.
Crossref
Beren Gürsoy Yılmaz, Ömer Faruk Yılmaz & Fatma Betül Yeni. (2024) Comparison of lot streaming division methodologies for multi-objective hybrid flowshop scheduling problem by considering limited waiting time. Journal of Industrial and Management Optimization 0:0, pages 0-0.
Crossref
Amir M. Fathollahi-Fard, Lyne Woodward & Ouassima Akhrif. (2024) An Optimization Model for Smart and Sustainable Distributed Permutation Flow Shop Scheduling. Procedia Computer Science 232, pages 21-31.
Crossref
Lei Zhu, Yusheng Zhou, Ronghang Jiang & Qiang Su. (2024) Surgical cases assignment problem using a multi-objective squirrel search algorithm. Expert Systems with Applications 235, pages 121217.
Crossref
Jiepin Ding, Mingsong Chen, Ting Wang, Junlong Zhou, Xin Fu & Keqin Li. (2023) A Survey of AI-enabled Dynamic Manufacturing Scheduling: From Directed Heuristics to Autonomous Learning. ACM Computing Surveys 55:14s, pages 1-36.
Crossref
Hao Wang, Tao Peng, Aydin Nassehi & Renzhong Tang. (2023) A data-driven simulation-optimization framework for generating priority dispatching rules in dynamic job shop scheduling with uncertainties. Journal of Manufacturing Systems 70, pages 288-308.
Crossref
Wenxin Ruan, Miao Yu, Yu Zhao & Duoyun Qin. (2023) Hybrid Flow Shop-Scheduling for Production of Prefabricated Component. Hybrid Flow Shop-Scheduling for Production of Prefabricated Component.
Manuel Lozano & Eduardo Rodriguez-Tello. (2023) Population-based iterated greedy algorithm for the S-labeling problem. Computers & Operations Research 155, pages 106224.
Crossref
Manuel Lozano & Francisco J. Rodríguez. 2023. Discrete Diversity and Dispersion Maximization. Discrete Diversity and Dispersion Maximization 107 133 .
Luca Fumagalli, Elisa Negri, Laura Cattaneo, Lorenzo Ragazzini & Marco Macchi. 2023. Digital Transformation in Industry. Digital Transformation in Industry 267 279 .
ZiYan Zhao, MengChu Zhou & ShiXin Liu. (2022) Iterated Greedy Algorithms for Flow-Shop Scheduling Problems: A Tutorial. IEEE Transactions on Automation Science and Engineering 19:3, pages 1941-1959.
Crossref
Krisztian Bakon, Tibor Holczinger, Zoltan Sule, Szilard Jasko & Janos Abonyi. (2022) Scheduling Under Uncertainty for Industry 4.0 and 5.0. IEEE Access 10, pages 74977-75017.
Crossref
Hossein Shokri Garjan, Alireza Abbaszadeh Molaei, Nazanin Fozooni & Ajith Abraham. 2022. Innovations in Bio-Inspired Computing and Applications. Innovations in Bio-Inspired Computing and Applications 505 516 .
Yunus DEMİR. (2021) Tekrarlı Açgözlü Algoritma Üzerine Kapsamlı Bir AnalizA Comprehensive Analysis on the Iterated Greedy Algorithm. Iğdır Üniversitesi Fen Bilimleri Enstitüsü Dergisi 11:4, pages 2716-2728.
Crossref
Ghazwan AlsoufiManal Abdulkareem ZeidanLamyaa Jasim Mohammed & Abdellah Salhi. (2021) A Robust Expected Makespan for Permutation Flow Shop Scheduling Depending on Machine Failure Rate. International Journal of Mathematical, Engineering and Management Sciences 6:5, pages 1345-1360.
Crossref
Shengluo Yang & Zhigang Xu. (2021) Intelligent Scheduling for Permutation Flow Shop with Dynamic Job Arrival via Deep Reinforcement Learning. Intelligent Scheduling for Permutation Flow Shop with Dynamic Job Arrival via Deep Reinforcement Learning.
Shengluo Yang, Zhigang Xu & Junyi Wang. (2021) Intelligent Decision-Making of Scheduling for Dynamic Permutation Flowshop via Deep Reinforcement Learning. Sensors 21:3, pages 1019.
Crossref
Sadiqi Assia, El Abbassi Ikram, El Barkany Abdellah & Darcherif Moumen. (2020) Real-Time Energy-Efficient Scheduling of Jobs and Maintenance in the Industry 4.0. Real-Time Energy-Efficient Scheduling of Jobs and Maintenance in the Industry 4.0.
Mageed Ghaleb, Hossein Zolfagharinia & Sharareh Taghipour. (2020) Real-time production scheduling in the Industry-4.0 context: Addressing uncertainties in job arrivals and machine breakdowns. Computers & Operations Research 123, pages 105031.
Crossref
Leandro do C. Martins, Christopher Bayliss, Pedro J. Copado-Méndez, Javier Panadero & Angel A. Juan. (2020) A Simheuristic Algorithm for Solving the Stochastic Omnichannel Vehicle Routing Problem with Pick-up and Delivery. Algorithms 13:9, pages 237.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.