Today, because the market is scattered around the world, manufacturing activities are not limited to a single location and have spread globally. As a result, the discussion of scheduling the factory has changed from a classic single to a network scheduling as a need in the real world. In this regard, this study considers the scheduling of multiple factories by taking into account the job transportation time between factories. The main problem here is that each job would be assigned to which factory and machine. In this research, unrelated parallel machines are considered in which the processing time of jobs depends on the machine and setup time. To minimize the makespan, first, a mixed-integer linear model was proposed in which two types of modeling have been combined. Then, a hyper-heuristic algorithm (HHA) was designed to solve the problem in a reasonable time by choosing the best method among four low-level heuristic methods that are precisely designed according to the properties of the problem. Finally, the efficiency of the proposed algorithm has been compared with the imperialist competitive algorithm (ICA) by conducting experiments. The results show that the proposed algorithm performs very well compared to the ICA and, in more than 75% of the test problems, the proposed algorithm was superior. Also, based on the analysis, in comparing the proposed algorithm with the ICA, it can be concluded that there is a significant difference between the results, and in all cases, the HHA was remarkably better. Considering the challenges and rapid changes of today’s market that traditional centralized production planning does not have enough flexibility to respond to them, the results of this research are expected to be useful and attractive for planners in this field.
Accepté le :
Première publication :
Publié le :
DOI : 10.1051/ro/2022194
Keywords: Cooperative production scheduling, hyper-heuristic algorithm, unrelated parallel machine, sequence-dependent setup time, transportation time
@article{RO_2022__56_6_4129_0,
author = {Behnamian, Javad and Asgari, Hamed},
title = {A hyper-heuristic for distributed parallel machine scheduling with machine-dependent processing and sequence-dependent setup times},
journal = {RAIRO. Operations Research},
pages = {4129--4143},
year = {2022},
publisher = {EDP-Sciences},
volume = {56},
number = {6},
doi = {10.1051/ro/2022194},
mrnumber = {4517329},
zbl = {1532.90028},
language = {en},
url = {https://www.numdam.org/articles/10.1051/ro/2022194/}
}
TY - JOUR AU - Behnamian, Javad AU - Asgari, Hamed TI - A hyper-heuristic for distributed parallel machine scheduling with machine-dependent processing and sequence-dependent setup times JO - RAIRO. Operations Research PY - 2022 SP - 4129 EP - 4143 VL - 56 IS - 6 PB - EDP-Sciences UR - https://www.numdam.org/articles/10.1051/ro/2022194/ DO - 10.1051/ro/2022194 LA - en ID - RO_2022__56_6_4129_0 ER -
%0 Journal Article %A Behnamian, Javad %A Asgari, Hamed %T A hyper-heuristic for distributed parallel machine scheduling with machine-dependent processing and sequence-dependent setup times %J RAIRO. Operations Research %D 2022 %P 4129-4143 %V 56 %N 6 %I EDP-Sciences %U https://www.numdam.org/articles/10.1051/ro/2022194/ %R 10.1051/ro/2022194 %G en %F RO_2022__56_6_4129_0
Behnamian, Javad; Asgari, Hamed. A hyper-heuristic for distributed parallel machine scheduling with machine-dependent processing and sequence-dependent setup times. RAIRO. Operations Research, Tome 56 (2022) no. 6, pp. 4129-4143. doi: 10.1051/ro/2022194
[1] , , and , A multifactory integrated production and distribution scheduling problem with parallel machines and immediate shipments solved by improved whale optimization algorithm. Complexity 2018 (2018). DOI: . | DOI
[2] , , , , and , Soft-computing approaches for rescheduling problems in a manufacturing industry. RAIRO: Oper. Res. 55 (2021) S2125–S2159. | MR | Zbl | Numdam | DOI
[3] and , Recent trends in distributed production network scheduling problem. Artif. Intell. Rev. 55 (2022) 2945–2995. | DOI
[4] , , and , 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. | DOI
[5] , Decomposition based hybrid VNS–TS algorithm for distributed parallel factories scheduling with virtual corporation. Comput. Oper. Res. 52 (2014) 181–191. | MR | Zbl | DOI
[6] , Multi-objective production network scheduling using sub-population genetic algorithm and elastic method. J. Ind. Eng. Res. Prod. Syst. 3 (2016) 133–147.
[7] and , The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine. Inf. Sci. 219 (2013) 181–196. | MR | Zbl | DOI
[8] and , A survey of multi-factory scheduling. J. Intell. Manuf. 27 (2016) 231–249. | DOI
[9] and , Multi-objective multi-factory scheduling. RAIRO: Oper. Res. 55 (2021) S1447–S1467. | MR | Zbl | Numdam | DOI
[10] and , 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 and (2000) 277.
[11] and , 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. | DOI
[12] and , A multi-agent approach to the integrated production scheduling and distribution problem in multi-factory supply chain. Appl. Soft Comput. 65 (2018) 577–589. | DOI
[13] , and , 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.
[14] and , An artificial bee colony with division for distributed unrelated parallel machine scheduling with preventive maintenance. Comput. Ind. Eng. 141 (2020) 106320. | DOI
[15] , , and , An imperialist competitive algorithm with memory for distributed unrelated parallel machines scheduling. Int. J. Prod. Res. 58 (2020) 597–614. | DOI
[16] , Backtracking search based hyper-heuristic for the flexible job-shop scheduling problem with fuzzy processing time. Eng. App. Artif. Intell. 77 (2019) 186–196. | DOI
[17] , and , A backtracking search hyper-heuristic for the distributed assembly flow-shop scheduling problem. Swarm Evol. Comput. 36 (2017) 124–135. | DOI
[18] , , and , A pareto-based hybrid iterated greedy algorithm for energy-efficient scheduling of distributed hybrid flowshop. Expert Syst. App. 204 (2022) 117555. | DOI
[19] , , , and , A distributed flexible job shop scheduling problem considering worker arrangement using an improved memetic algorithm. Expert Syst. App. 207 (2022) 117984. | DOI
[20] , , , and , 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. | DOI
[21] , , , and , An effective hybrid collaborative algorithm for energy-efficient distributed permutation flow-shop inverse scheduling. Future Gener. Comput. Syst. 128 (2022) 521–537. | DOI
[22] , , , and , 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. | DOI
[23] , , , and , 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.
[24] , , and , Application of genetic algorithm to job scheduling under ergonomic constraints in manufacturing industry. J. Ambient Intell. Humanized Comput. 10 (2019) 2063–2090. | DOI
[25] and , Intelligent factory many-objective distributed flexible job shop collaborative scheduling method. Comput. Ind. Eng. 164 (2022) 107884. | DOI
[26] , and , Multi-objective carbon-efficient scheduling in distributed permutation flow shops under consideration of transportation efforts. J. Cleaner Prod. 365 (2022) 132551. | DOI
[27] , and , Multi-local search-based general variable neighborhood search for distributed flow shop scheduling in heterogeneous multi-factories. Appl. Soft Comput. 125 (2022) 109138. | DOI
[28] , and , Distributed planning and control systems for the virtual enterprise: organizational requirements and development life-cycle. J. Intell. Manuf. 11 (2000) 253–270. | DOI
[29] , , and , An effective multi-objective whale swarm algorithm for energy-efficient scheduling of distributed welding flow shop. Ann. Oper. Res. 310 (2022) 223–255. | DOI
[30] , Heuristic techniques for simultaneous scheduling of production and distribution in multi-echelon structures: theory and empirical comparisons. Manage. Sci. 27 (1981) 336–352. | Zbl | DOI
[31] , , and , A hybrid ILS-VND based hyper-heuristic for permutation flowshop scheduling problem. Proc. Comput. Sci. 60 (2015) 632–641. | DOI
[32] , , and , A memetic discrete differential evolution algorithm for the distributed permutation flow shop scheduling problem. Complex Intell. Syst. 8 (2022) 141–161. | DOI
[33] and , 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. | DOI
Cité par Sources :
