Distributed scheduling has attracted much attention in multiple factories. However, uncertainties are often neglected in the previous works and this neglecting may result in the low value of the obtained schedule. In this study, fuzzy distributed scheduling is addressed in two-stage hybrid flow shop with sequence-dependent setup times(SDST) which is a frequently studied constraint in single factory and seldom handled in multiple factories. A collaborative variable search (CVS) is proposed to optimize total agreement index and fuzzy makespan simultaneously. Seven neighborhood structures and two global search operators are used in two cooperated variable search parts to generate high quality solutions. Experiments are conducted and the computational results reveal that CVS has promising advantages on the considered fuzzy distributed scheduling problem.
RuizR. and Vazquez-RodriguezJ.A., The hybrid flow shop scheduling problem, European Journal of Operational Research205(1) (2010), 1–18.
2.
GuptaJ.N.D., Two-stage, hybrid flowshop scheduling problem, Journal of the Operational Research Society39(4) (1988), 359–364.
3.
AllaouiH. and ArtibaA., Scheduling two-stage hybrid flow shop with availability constraints, Computers & Operations Research33(5) (2006), 1399–1419.
4.
WangS. and LiuM., A genetic algorithm for two-stage nowait hybrid flow shop scheduling problem, Computers & Operations Research40(4) (2013), 1064–1075.
5.
TanY., MonchL. and FowlerJ.W., A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines, Journal of Scheduling21(2) (2018), 209–226.
6.
YangJ., Minimizing total completion time in two-stage hybrid flow shop with dedicated machines, Computers & Operations Research38(7) (2011), 1045–1053.
7.
WangS. and LiuM., A heuristic method for two-stage hybrid flow shop with dedicated machines, Computers & Operations Research40(1) (2013), 438–450.
8.
WangS., WangX., ChuF. and YuJ., An energy-efficient twostage hybrid flow shop scheduling problem in a glass production, International Journal of Production Research (2019).
9.
FanB., YangW. and ZhangZ., Solving the two-stage hybrid flow shop scheduling problem based on mutant firefly algorithm, Journal of Ambient Intelligence and Humanized Computing10(3) (2019), 979–990.
10.
YuJ.M., HuangR. and LeeD.H., Iterative algorithms for batching and scheduling to minimise the total job tardiness in two-stage hybrid flow shops, International Journal of Production Research55(11) (2017), 3266–3282.
11.
FengX., ZhengF. and XuY., Robust scheduling of a two-stage hybrid flow shop with uncertain interval processing times, International Journal of Production Research54(12) (2016), 3706–3717.
12.
KomakiG.M., TeymourianE. and KayvanfarV., Minimising makespan in the two-stage assembly hybrid flow shop scheduling problem using artificial immune systems, International Journal of Production Research54(4) (2016), 963–983.
13.
FigielskaE., A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages, European Journal of Operational Research236(2) (2014), 433–444.
14.
WangS. and LiuM., Two-stage hybrid flow shop scheduling with preventive maintenance using multi-objective tabu search method, International Journal of Production Research52(5) (2014), 1495–1508.
15.
KheirandishO., Tavakkoli-MoghaddamR. and Karimi-NasabM., An artificial bee colony algorithm for a two-stage hybrid flowshop scheduling problem with multilevel product structures and requirement operations, International Journal of Computer Integrated Manufacturing28(5) (2015), 437–450.
16.
RabieeM., RadR.S., MazinaniM. and ShafaeiR., An intelligent hybrid meta-heuristic for solving a case of no-wait twostage flexible flow shop scheduling problem with unrelated parallel machines, International Journal of Advanced Manufacturing Technology71(5–8) (2014), 1229–1245.
17.
ThoneyK.A., HodgsonT.J., KingR.E., TanerM.R. and WilsonA.D., Satisfying due-dates in large multi-factory supply chains, IIE Transactions34(9) (2002), 803–811.
18.
LeiD.M., YuanY., CaiJ.C. and BaiD.Y., An imperialist competitive algorithm with memory for distributed unrelated parallel machines scheduling, International Journal of Production Research (2019), in press.
19.
HookerJ.N., A hybrid method for planning and scheduling, Constraints10 (2005), 385.
20.
ChenZ.L. and PundoorG., Order Assignment and Scheduling in a Supply Chain, Operations Research54(3) (2006), 555–572.
21.
Terrazas-MorenoS. and GrossmannI.E., A multiscale decomposition method for the optimal planning and scheduling of multi-site continuous multiproduct plants, Chemical Engineering Science66(19) (2011), 4307–4318.
22.
BehnamianJ. and Fatemi GhomiS.M.T., The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine, Information Sciences219 (2013), 181–196.
23.
BehnamianJ., Decomposition based hybrid VNSTS algorithm for distributed parallel factories scheduling with virtual corporation, Computers & Operations Research52 (2014), 181–191.
24.
LinS.W., YingK.C. and HuangC.Y., Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm, International Journal of Production Research51(16) (2013), 5029–5038.
25.
NaderiB. and RuizR., A scatter search algorithm for the distributed permutation flowshop scheduling problem, European Journal of Operational Research239(2) (2014), 323–334.
26.
WangS.Y., WangL., LiuM. and XuY., An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem, International Journal of Production Economics145(1) (2013), 387–396.
27.
YingK.C. and LinS.W., Minimizing makespan in distributed blocking flowshops using hybrid iterated greedy algorithms, IEEE Access5 (2017), 15694–15705.
28.
LinS.W. and YingK.C., Minimizing makespan for solving the distributed no-wait flowshop scheduling problem,, Computers & Industrial Engineering99 (2016), 202–209.
29.
ZhangG., XingK. and CaoF., Scheduling distributed flowshops with flexible assembly and set-up time to minimise makespan, International Journal of Production Research56(9) (2018), 3226–3244.
30.
DengJ., WangL., WangS.Y. and ZhengX.L., A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem, International Journal of Production Research54(12) (2016), 3561–3577.
31.
LinJ., WangZ.J. and LiX.D., A backtracking search hyperheuristic for the distributed assembly flow-shop scheduling problem, Swarm and Evolutionary Computation36 (2017), 124–135.
32.
YingK.C. and LinS.W., Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks, Expert Systems with Applications92 (2018), 132–141.
33.
HaoJ.H., LiJ.Q., DuY., SongM.X., DuanP. and ZhangY.Y., Solving distributed hybrid flowshop scheduling problems by a hybrid brain storm optimization algorithm, IEEE Access7 (2019), 66879–66894.
34.
EnginO. and GozenS., Parallel machine scheduling problems with fuzzy processing time and fuzzy duedate: An application in an engine valve manufacturing process, Journal of Multiple-Valued Logic and Soft Computing15(2–3) (2009), 107–123.
35.
EnginO., KahramanC. and YilmazM.K., Computational intelligence in flow shop and job shop scheduling, A scatter search method for multiobjective fuzzy permutation flow shop scheduling problem: A real world application, Vol. 230, Springer, Berlin, Heidelberg, 2009.
36.
JeetK., SharmaS. and NailwalK.K., Two-machine fuzzy flow shop scheduling using black hHole algorithm, Global Journal of Pure and Applied Mathematics13(6) (2017), 1935–1946.
37.
KahramanC., EnginO. and YilmazM.K., A new artificial immune system algorithm for multiobjective fuzzy flow shop problems, International Journal of Computational Intelligence Systems2(3) (2009), 236–247.
38.
PaulS.K. and AzeemA., Minimization of work-in-process inventory in hybrid flow shop scheduling using fuzzy logic, International Journal of Industrial Engineering-Theory Applications and Practice17(2) (2010), 115–127.
39.
YuanF.Y., XuX. and YinM.H., A novel fuzzy model for multi-objective permutation flow shop scheduling problem with fuzzy processing time, Advances in Mechanical Engineering11(4) (2019), in press.
40.
AllahverdiA., GuptaJ.N.D. and AldowaisanT., A review of scheduling research involving setup considerations, Omega27(2) (1999), 219–239.
41.
LinH.T. and LiaoC.J., A case study in a two-stage hybrid flow shop with setup time and dedicated machines, International Journal of Production Economics86(2) (2003), 133–143.
42.
HekmatfarM., GhomiS.M.T.F. and KarimiB., Two stage reentrant hybrid flow shop with setup times and the criterion of minimizing makespan, Applied Soft Computing11(8) (2011), 4530–4539.
43.
LeeG.C., HongJ.M. and ChoiS.H., Efficient heuristic algorithm for scheduling two-stage hybrid flowshop with sequencedependent setup times, Mathematical Problems in Engineering (2015).
44.
WangS. and LiuM., Two-stage hybrid flow shop scheduling with preventive maintenance using multi-objective tabu search method, International Journal of Production Research52(5) (2014), 1495–1508.
45.
LeiD.M., Fuzzy job shop scheduling problem with availability constraints, Computers & Industrial Engineering58(4) (2010), 610–617.
46.
LeiD.M., A genetic algorighm for flexible job shop scheduling with fuzzy processing time, International Journal of Production Research48(10) (2010), 2995–3013.
47.
LeiD.M., Solving fuzzy job shop scheduling problems using random key genetic algorithm, International Journal of Advanced Manufacturing Technology49(1-4) (2010), 253–262.
LeiD.M., Pareto archive particle swarm optimization for multi-objective fuzzy job shop scheduling problems, International Journal of Advanced Manufacturing Technology37(1-2) (2008), 157–165.
50.
DengJ. and WangL., A competitive memetic algorithm for multi-objective distributed permuation flow shop scheduling problem, Swarm and Evolutionary Computation32 (2017), 121–131.
51.
ZitzlerE. and ThieleL., Multiobjective evolutionary algorighms: a comparative case study and the strength pareto approach, IEEE Transactions on Evolutionary Compution3 (2000), 257–271.
52.
LeiD.M., LiM. and WangL., A two-phase meta-heuristic for multiobjective flexible job shop scheduling problem with total energy consumption threshold, IEEE Transactions on Cybernetics49(3) (2019), 1097–1109.
