Open Access
Issue
RAIRO-Oper. Res.
Volume 56, Number 6, November-December 2022
Page(s) 4129 - 4143
DOI https://doi.org/10.1051/ro/2022194
Published online 05 December 2022
  • V. Abdollahzadeh, I. Nakhaikamalabadi, S.M. Hajimolana and S.H. Zegordi, A multifactory integrated production and distribution scheduling problem with parallel machines and immediate shipments solved by improved whale optimization algorithm. Complexity 2018 (2018). DOI: 10.1155/2018/5120640. [CrossRef] [Google Scholar]
  • J. Acevedo-Chedid, J. Grice-Reyes, H. Ospina-Mateus, K. Salas-Navarro, A. Santander-Mercado and S.S. Sana, Soft-computing approaches for rescheduling problems in a manufacturing industry. RAIRO: Oper. Res. 55 (2021) S2125–S2159. [CrossRef] [EDP Sciences] [Google Scholar]
  • N. Bagheri Rad and J. Behnamian, Recent trends in distributed production network scheduling problem. Artif. Intell. Rev. 55 (2022) 2945–2995. [CrossRef] [Google Scholar]
  • B. Behdani, Z. Lukszo, A. Adhitya and R. Srinivasan, Decentralized vs. centralized management of abnormal situations in a multi-plant enterprise using an agent-based approach, in Computer Aided Chemical Engineering. Vol. 28. Elsevier (2010) 1219–1224. [CrossRef] [Google Scholar]
  • J. Behnamian, Decomposition based hybrid VNS–TS algorithm for distributed parallel factories scheduling with virtual corporation. Comput. Oper. Res. 52 (2014) 181–191. [CrossRef] [MathSciNet] [Google Scholar]
  • J. Behnamian, Multi-objective production network scheduling using sub-population genetic algorithm and elastic method. J. Ind. Eng. Res. Prod. Syst. 3 (2016) 133–147. [Google Scholar]
  • J. Behnamian and S.M.T. Fatemi Ghomi, The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine. Inf. Sci. 219 (2013) 181–196. [CrossRef] [Google Scholar]
  • J. Behnamian and S.M.T. Fatemi Ghomi, A survey of multi-factory scheduling. J. Intell. Manuf. 27 (2016) 231–249. [CrossRef] [Google Scholar]
  • J. Behnamian and S.M.T. Fatemi Ghomi, Multi-objective multi-factory scheduling. RAIRO: Oper. Res. 55 (2021) S1447–S1467. [CrossRef] [EDP Sciences] [Google Scholar]
  • P. Cowling and E. Soubeiga, Neighborhood structures for personnel scheduling: a summit meeting scheduling problem, in Proceedings of the 3rd International Conference on the Practice and Theory of Automated Timetabling, edited by E.K. Burke and W. Erben (2000) 277. [Google Scholar]
  • A. Delgoshaei and C. Gomes, A multi-layer perceptron for scheduling cellular manufacturing systems in the presence of unreliable machines and uncertain cost. Appl. Soft Comput. 49 (2016) 27–55. [CrossRef] [Google Scholar]
  • A. Gharaei and F. Jolai, A multi-agent approach to the integrated production scheduling and distribution problem in multi-factory supply chain. Appl. Soft Comput. 65 (2018) 577–589. [CrossRef] [Google Scholar]
  • S. Giordani, M. Lujak and F. Martinelli, A decentralized scheduling policy for a dynamically reconfigurable production system, in International Conference on Industrial Applications of Holonic and Multi-Agent Systems. Springer (2009) 102–113. [Google Scholar]
  • D. Lei and M. Liu, An artificial bee colony with division for distributed unrelated parallel machine scheduling with preventive maintenance. Comput. Ind. Eng. 141 (2020) 106320. [CrossRef] [Google Scholar]
  • D. Lei, Y. Yuan, J. Cai and D. Bai, An imperialist competitive algorithm with memory for distributed unrelated parallel machines scheduling. Int. J. Prod. Res. 58 (2020) 597–614. [CrossRef] [Google Scholar]
  • J. Lin, Backtracking search based hyper-heuristic for the flexible job-shop scheduling problem with fuzzy processing time. Eng. App. Artif. Intell. 77 (2019) 186–196. [CrossRef] [Google Scholar]
  • J. Lin, Z.-J. Wang and X. Li, A backtracking search hyper-heuristic for the distributed assembly flow-shop scheduling problem. Swarm Evol. Comput. 36 (2017) 124–135. [CrossRef] [Google Scholar]
  • C. Lu, Q. Liu, B. Zhang and L. Yin, A pareto-based hybrid iterated greedy algorithm for energy-efficient scheduling of distributed hybrid flowshop. Expert Syst. App. 204 (2022) 117555. [CrossRef] [Google Scholar]
  • Q. Luo, Q. Deng, G. Gong, X. Guo and X. Liu, A distributed flexible job shop scheduling problem considering worker arrangement using an improved memetic algorithm. Expert Syst. App. 207 (2022) 117984. [CrossRef] [Google Scholar]
  • J.-Y. Mao, Q.-K. Pan, Z.-H. Miao, L. Gao and S. Chen, A hash map-based memetic algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance to minimize total flowtime. Knowl.-Based Syst. 242 (2022) 108413. [CrossRef] [Google Scholar]
  • J. Mou, P. Duan, L. Gao, X. Liu and J. Li, An effective hybrid collaborative algorithm for energy-efficient distributed permutation flow-shop inverse scheduling. Future Gener. Comput. Syst. 128 (2022) 521–537. [CrossRef] [Google Scholar]
  • J. Park, Y. Mei, S. Nguyen, G. Chen and M. Zhang, An investigation of ensemble combination schemes for genetic programming based hyper-heuristic approaches to dynamic job shop scheduling. Appl. Soft Comput. 63 (2018) 72–86. [CrossRef] [Google Scholar]
  • A. Saadi, P. Fattahi, D. Rahmanii, S.M. Hassan Hosseini and S.S. Sana, An exact method for job sequencing in a mixed-model assembly line considering feeding lines based on the benders decomposition approach. Int. J. Manage. Sci. Eng. Manage. (2022) 1–14. [Google Scholar]
  • S.S. Sana, H. Ospina-Mateus, F.G. Arrieta and J.A. Chedid, Application of genetic algorithm to job scheduling under ergonomic constraints in manufacturing industry. J. Ambient Intell. Humanized Comput. 10 (2019) 2063–2090. [CrossRef] [Google Scholar]
  • Y. Sang and J. Tan, Intelligent factory many-objective distributed flexible job shop collaborative scheduling method. Comput. Ind. Eng. 164 (2022) 107884. [CrossRef] [Google Scholar]
  • S. Schulz, M. Schönheit and J.S. Neufeld, Multi-objective carbon-efficient scheduling in distributed permutation flow shops under consideration of transportation efforts. J. Cleaner Prod. 365 (2022) 132551. [CrossRef] [Google Scholar]
  • W. Shao, Z. Shao and D. Pi, Multi-local search-based general variable neighborhood search for distributed flow shop scheduling in heterogeneous multi-factories. Appl. Soft Comput. 125 (2022) 109138. [CrossRef] [Google Scholar]
  • A. Soares, A. Azevedo and J.P. De Sousa, Distributed planning and control systems for the virtual enterprise: organizational requirements and development life-cycle. J. Intell. Manuf. 11 (2000) 253–270. [CrossRef] [Google Scholar]
  • G. Wang, X. Li, L. Gao and P. Li, An effective multi-objective whale swarm algorithm for energy-efficient scheduling of distributed welding flow shop. Ann. Oper. Res. 310 (2022) 223–255. [CrossRef] [Google Scholar]
  • J.F. Williams, Heuristic techniques for simultaneous scheduling of production and distribution in multi-echelon structures: theory and empirical comparisons. Manage. Sci. 27 (1981) 336–352. [CrossRef] [Google Scholar]
  • H. Yahyaoui, S. Krichen, B. Derbel and E.-G. Talbi, A hybrid ILS-VND based hyper-heuristic for permutation flowshop scheduling problem. Proc. Comput. Sci. 60 (2015) 632–641. [CrossRef] [Google Scholar]
  • F. Zhao, X. Hu, L. Wang and Z. Li, A memetic discrete differential evolution algorithm for the distributed permutation flow shop scheduling problem. Complex Intell. Syst. 8 (2022) 141–161. [CrossRef] [Google Scholar]
  • Y. Zhou and J.-J. Yang, Automatic design of scheduling policies for dynamic flexible job shop scheduling by multi-objective genetic programming based hyper-heuristic. Proc. CIRP 79 (2019) 439–444. [CrossRef] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.