Distributed assembly flow shop scheduling problem (DAFSP) has been extensively considered; however, DAFSP with Pm → 1 layout, in which m parallel machines are at fabrication stage and one machine is at assembly stage, is seldom handled. In this study, DAFSP with the above layout and transportation time is studied and an imperialist competitive algorithm with cooperation and division (CDICA) is presented to minimize makespan. Feature of the problem is used and a heuristic is applied to produce initial solution. Adaptive assimilation and evolution are executed in the weakest empire and adaptive cooperation is implemented between the winning empire and the weakest empire in imperialist competition process. Empire division is performed when a given condition is met. Many experiments are conducted. The computational results demonstrate that new strategies are effective and CDICA is a very competitive in solving the considered DAFSP.
XiongF.L., XingK.Y., WangF., LeiH. and HanL.B., Minimizing thetotal completion time in a distributed two stage assembly systemwith setup times, Comput. Oper. Res47 (2014), 92–105.
2.
XiongF.L. and XingK.Y., Meta-heuristics for the distributedtwo-stage assembly scheduling problem with bi-criteria of makespanand mean completion time, Int. J. Prod. Res52(9) (2014), 2743–2766.
3.
DengJ., WangL., WangS.Y. and ZhengX.L., A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem, Int. J. Prod. Res54(12) (2016), 3561–3577.
4.
ZhangG.H. and XingK.Y., Memetic social spider optimization algorithm for scheduling two-stage assembly flowshop in adistributed environment, Comput. Ind. Eng125 (2018), 423–433.
5.
LeiD.M., SuB. and LiM., Cooperated teaching-learning-based optimisation for distributed two-stage assembly flow shop scheduling, Int. J. Prod. Res59(23) (2021), 7232–7245.
6.
LiM., SuB. and LeiD.M., A novel imperialist competitive algorithm for fuzzy distributed assembly flow shop scheduling, J. Intell. Fuzzy Syst40(3) (2021), 4545–4561.
7.
PourhejazyP., ChengC.Y., YingK.C. and NamN.H., Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups, Ann. Oper. Res (2022), 1–22.
8.
WangJ., LeiD.M. and CaiJ.C., An adaptive artificial bee colonywith reinforcement learning for distributed three-stage assembly schduling with maintenance, Appl. Soft Comput117(2022) (2022), 1568–4946.
9.
ShaoZ.S., ShaoW.S. and PiD.C., Effective constructive heuristicand metaheuristic for the distributed assembly blocking flow-shop scheduling problem, Appl. Int50 (2020), 4647–4649.
10.
ZhaoF.Q., ZhaoJ.L., WangL. and TangJ.X., An optimal block knowledge driven backtracking search algorithm for distributed assembly No-wait flow shop scheduling problem, Appl. Soft Comput112 (2021), 107750.
11.
ZhangG., XingK. and CaoF., Scheduling distributed flowshops withflexible assembly and set-up time to minimise makespan, Int. J.Prod. Res56 (2018), 3226–3244.
12.
BehnamianJ., Graph colouring-based algorithm to parallel jobsscheduling on parallel factories, Int. J. Comput. Integ. M29(6) (2016), 622–635.
13.
LeiD.M., YuanY., CaiJ.C. and BaiD.Y., An imperialist competitive algorithm with memory for distributed unrelated parallel machines scheduling, Int. J. Prod. Res58(2) (2020), 597–614.
14.
LeiD.M. and LiuM.Y., An artificial bee colony with division for distributed unrelated parallel machine scheduling with preventive maintenance, Comput. Ind. Eng141 (2020), 0360–8352.
15.
DengJ. and WangL., A competitive memetic algorithm formulti-objective distributed permutation flow shop scheduling problem, Swarm Evol. Comput32 (2017), 121–131.
16.
RifaiA.P., NguyenH.T. and DawalS.Z.M., Multi-objective adaptive large neighborhood search for distributed reentrant permutation flowshop scheduling, Appl. Soft Comput40(1) (2016), 42–57.
17.
LiW.H., ChenX.L., LiJ.Q., SangH.Y., HanY.Y. and DuS.B., Animproved iterated greedy algorithm for distributed robotic flowshopscheduling with order constraints, Comput. Ind. Eng164(2022) (2022), 0360–8352.
18.
PanY.X., GaoK.Z., LiZ.W. and WuN.Q., Improved metaheuristics for solving distributed lot-streaming permutation flow shop scheduling problems, IEEE T. Autom. Sci. Eng (2022), 1–11.
19.
GengK.F. and YeC.M., A memetic algorithm for energy-efficient distributed re-entrant hybrid flow shop scheduling problem, J.Intell. Fuzzy Syst41(2) (2021), 3951–3971.
20.
LinS.W. and YingK.C., Minimizing makespan for solving the distributed no-wait flowshop scheduling problem, Comput. Ind.Eng99(2) (2016), 202–209.
21.
LiJ.Q., SongM.X., LingW., DuanP.Y., HanY.Y., SangH.Y. and PanQ.K., Hybrid artificial bee colony algorithm for a parallel batching distributed flow-shop problem with deteriorating jobs, IEEETrans. Cyber50(6) (2020), 2425–2439.
22.
WangL. and LiD.D., Fuzzy distributed hybrid flow shop scheduling problem with heterogeneous factory and unrelated parallel machine: a shuffled frog leaping algorithm with collaboration of multiple search strategies, IEEE Access8 (2020), 214209–214223.
23.
FeroneD., HatamiS., Gonzalez-NeiraE.M., JuanA.A. and FestaP., Abiased-randomized iterated local search for the distributed assembly permutation flow-shop problem, Int. T. Oper. Res27(3) (2020), 1368–1391.
24.
ZhangG.H., XingK.Y., ZhangG.Y. and HeZ.X., Memetic algorithm with meta-lamarckian learning and simplex search for distributed flexible assembly permutation flowshop scheduling problem, IEEE Access8 (2020), 96115–96128.
25.
LeiD.M., GaoL. and ZhengY.L., A novel teaching-learning-based optimization algorithm for energy-efficient scheduling in hybridflow shop, IEEE Trans. Eng. Manage65(2) (2018), 330–340.
26.
PourhejazyP., ChengC.Y., YingK.C. and NamN.H., Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups, Ann. Oper. Res (2022), 1–22.
27.
ChaouchI., DrissO.B. and GhediraK., A novel dynamic assignment rule for the distributed job shop scheduling problem using a hybridant-based algorithm, Appl. Intell49(5) (2019), 1903–1924.
28.
MahmoodjanlooM., Tavakkoli-MoghaddamaR., BaboliA. and Bozorgi-AmiriA., Distributed job-shop rescheduling problem considering reconfigurability of machines: a selfadaptive hybrid equilibrium optimiser, Int. J. Prod. Res (2021), 1–22.
29.
ChaouchI., DrissO.B. and Ghedira KhaledK., A novel dynamic assignment rule for the distributed job shop scheduling problemusing a hybrid ant-based algorithm, Appl. Intell49(5) (2019), 1903–1924.
30.
SahmanM.A., A discrete spotted hyena optimizer for solvingdistributed job shop scheduling problems, Appl. Soft Comput106 (2021), 107349.
31.
LeeC.Y., ChengT.C.E. and LinB.M.T., Minimizing the makespan in the3-machine assembly-type flow shop scheduling problem, Manage.Sci39 (1993), 616–625.
32.
ChengT. and WangG., Scheduling the fabrication and assembly of components in a two-machine flowshop, IIE Trans31(2) (1999), 135–143.
33.
FraminanJ.M., Perez-GonzalezP. and Fernandez-ViagasV., Deterministic assembly scheduling problems: a review and classification of current-type scheduling models and solution procedures, Euro. J. Oper. Res.273 (2019), 401—417.
34.
KomakiG.M., SheikhS. and MalakootiB., Flow shop scheduling problems with assembly operations: a review and new trends, Int. J. Prod. Res.57(10) (2019), 2926–2955.
35.
HosseiniS. and KhaledA.A., A survery on the imperialist competitive algorithm metaheuristic in engineering domain and directions for future research, Appl. Soft Comput24(2014) (2014), 1078–1094.
36.
LiM., LeiD.M. and CaiJ.C., Two-level imperialist competitive algorithm for energy-efficient hybrid flow shop scheduling problem with relative importance of objectives, Swarm Evol. Comput49 (2019), 34–43.
37.
LeiD.M., LiM. and WangL., A two-phase meta-heuristic for multiobjective flexible job shop scheduling problem with totalenergy consumption threshold, IEEE Trans. Cyber49(3) (2019), 1097–1109.
38.
LiM., LeiD.M. and XiongH.J., An imperialist competitive algorithm with the diversified operators for many-objective scheduling inflexibe job shop, IEEE Access7 (2019), 29553–29562.
39.
ShokrollahpourE., ZandiehM. and DorriB., A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flow shop problem, Int. J. Prod. Res49 (2011), 3087–3103.
40.
GoldansazS.M., JolaiF. and AnarakiA.H.Z., A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop, Appl. Math. Model37 (2013), 9603–9616.
41.
SeidgarH., KianiM., AbediM. and FazlollahtabarH., An efficient imperialist competitive algorithm for scheduling in the two-stageassembly flow shop problem, Int. J. Prod. Res52 (2014), 1240–1256.
42.
NaderiB. and YazdaniM., A model and imperialist competitivealgorithm for hybrid flow shops with sublots and setup times, J. Manuf. Syst33(4) (2014), 647–653.
43.
KarimiS., ArdalanZ., NaderiB. and MohammadiM., Scheduling flexible job-shops with transportation times: mathematical modelsand a hybrid imperialist competitive algorithm, Appl. Math.Model41 (2017), 667–682.
44.
ZandiehM., KhatamiA.R. and RahmatiS.H.A., Flexible job shopscheduling under condition-based maintenance: improved version of imperialist competitive algorithm, Appl. Soft Comput58(2017), 449–464.
45.
TadayoniradS., SeidgarH., FazlollahtabarH. and ShafaeiR., Robustscheduling in two-stage assembly flow shop with random breakdowns: integrated meta-heuristic algorithms and simulation approach, Assembly Autom39(5) (2019), 944–962.
46.
LeiD.M., YuanY., CaiJ.C. and BaiD.Y., An imperialist competitive algorithm with memory for distributed parallel machines scheduling, Int. J. Prod. Res58(2) (2020), 597–614.
47.
GuoJ., LeiD.M. and LiM., Two-phase imperialist competitive algorithm for energy-efficient flexible job shop scheduling,5, J.Intell. Fuzzy Syst40(6) (2021), 12125–12137.
48.
MarandiF. and GhomiS.M.T.F., Integrated multi-factory productionand distributed scheduling applying vehicle routing approach, Int. J. Prod. Res57(3) (2019), 722–748.
49.
PanZ.X., LeiD.M. and ZhangQ.Y., A new imperialist competitive algorithm for multiobjective low carbon parallel machines scheduling, Math. Probl. Eng2018(1) (2018), 1–13.
50.
TaoX.R., LiJ.Q., HuangT.H. and DuanP., Discrete imperialist competitive algorithm for the resource-constrained hybrid flow shop problem with energy consumption, Complex Intell. Syst7(1) (2021), 2199–4536.
51.
MontgomeryD.C., Design and Analysis of Experiments, Wiley (2008).
