Distributed scheduling has attracted much attention in recent years; however, distributed scheduling problem with uncertainty is seldom considered. In this study, fuzzy distributed two-stage hybrid flow shop scheduling problem (FDTHFSP) with sequence-dependent setup time is addressed and a diversified teaching-learning-based optimization (DTLBO) algorithm is applied to optimize fuzzy makespan and total agreement index. In DTLBO, multiple classes are constructed and categorized into two types according to class quality. Different combinations of global search and neighborhood search are used in two kind of classes. A temporary class with multiple teachers is built based on Pareto rank and difference index and evolved in a new way. Computational experiments are conducted and results demonstrate that the main strategies of DTLBO are effective and DTLBO has promising advantages on solving the considered problem.
AllaouiH. and ArtibaA., Scheduling two-stage hybrid flow shop with availability constraints, Comput Oper Res33 (2006), 1399–1419.
3.
YangJ., Minimizing total completion time in two-stage hybrid flow shop with dedicated machines, Comput Oper Res38(7) (2011), 1045–1053.
4.
WangS. and LiuM., A heuristic method for two-stage hybrid flow shop with dedicated machines, Comput Oper Res40(1) (2013), 438–450.
5.
WangS., WangX.D., ChuF. and YuJ.B., An energy-efficient twostage hybrid flow shop scheduling problem in a glass production, Int J Prod Res58(8) (2020), 2283–2314.
6.
WangS. and LiuM., A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem, Comput Oper Res40(4) (2013), 1064–1075.
7.
TanY., MönchL. and FowlerJ.W., A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines, J Scheduling21(1) (2017), 1–18.
8.
FanB., YangW. and ZhangZ., Solving the two-stage hybrid flow shop scheduling problem based on mutant firefly algorithm, J Amb Intel Hum Comp10(3) (2019), 979–990.
9.
YuJ.M., HuangR. and LeeD.H., Iterative algorithms for batching and scheduling to minimise the total job tardiness in two-stage hybrid flow shops, Int J Prod Res55(11) (2017), 3266–3282.
10.
FengX., ZhengF. and XuY., Robust scheduling of a two-stage hybrid flow shop with uncertain interval processing times, Int J Prod Res54(12) (2016), 3706–3717.
11.
KomakiG.M., TeymourianE. and KayvanfarV., Minimising makespan in the two-stage assembly hybrid flow shop scheduling problem using artificial immunne systems, Int J Prod Res54(4) (2016), 963–983.
12.
FigielskaE., A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages, Eur J Oper Res236(2) (2014), 433–444.
13.
WangS. and LiuM., Two-stage hybrid flow shop scheduling with preventive maintenance using multi-objective tabu search method, Int J Prod Res52(5) (2014), 1495–1508.
14.
LiuS.W., PeiJ., ChengH., LiuX.B. and PardalosP.M., Twostage hybrid flow shop scheduling on parallel batching machines considering a job-dependent deteriorating effect and noidentical job sizes, Appl Soft Comput84 (2019), 105701.
15.
WangS.J., WangX.D., ChuF. and YuJ.B., An energy-efficient two-stage hybrid flow shop scheduling problem in a glass production, Int J Prod Res (2019).
16.
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, Int J Comput Integ M28(5) (2015), 437–450.
17.
RabieeM., Sadeghi RadR., MazinaniM. and ShafaeiR., An intelligent hybrid meta-heuristic for solving a case of no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines, Int J Adv Manuf Tech71(5–8) (2014), 1229–1245.
18.
AssiriA.S., HussienA.G. and AminM., Ant lion optimization: variants, hybrids, and applications, IEEE Access8 (2020), 77746–77764.
19.
HussienA.G., AminM. and AzizM.E.A.E., A comprehensive review of moth-flame optimisation: variants, hybrids, and applications, J Exp Theor Artif Intel (2020), 1–21.
20.
HussienA.G., OlivaD., HousseinE.H., JuanA.A. and YuX., Binary whale optimization algorithm for dimensionality reduction, Mathe8(10) (2020), 1821.
21.
HussienA.G., AminM., WangM., LiangG., AlsanadA., GumaeiA. and ChenH., Crow search algorithm: theory, recent advances, and applications, IEEE Access8 (2020), 173548–173565.
22.
AbualigahL., ElazizM.A. and HussienA.G., Lightning search algorithm: a comprehensive survey, Appl Intell (2020)
23.
AbualigahL., GandomiA.H., ElazizM.A., HussienA.G., KhasawnehA.M., AlshinwanM. and HousseinE.H., Nature-Inspired Optimization Algorithms for Text Document ClusteringąłA Comprehensive Analysis, Algorithms (13) (2020), 345.
24.
LeiD.M. and WangT., Solving distributed two-stage hybrid flow shop scheduling using a shuffled frog-leaping algorithm with memeplex grouping, Eng Optimiz52(9) (2020), 1461–1474.
25.
CaiJ.C., ZhouR. and LeiD.M., Fuzzy distributed twostage hybrid flow shop scheduling problem with setup time: collabortive variable search, J Intell Fuzzy Syst38(3) (2020), 3189–3199.
26.
VelaC.R., AfsarS. and Jose PalaciosJ., Evolutionary tabu search for flexible due-date statisfaction in fuzzy job shop scheduling, Comput Oper Res119 (2020), 104931.
27.
DorfeshanY., Tavakkoli-MoghaddamR., MousaviS.M. and Vahedi-NouriB., A new weighted distance-based approximation methodology for flow shop scheduling group decisions under the interval-valued fuzzy processsing time, Appl Soft Comput91 (2020), 106248.
28.
SunL., LinL., GenM.S. and LiH.J., A hybrid cooperative coevolution algorithm for fuzzy flexible job shop scheduling, IEEE T Fuzzy Syst27(5) (2019), 1008–1022.
29.
LinJ., Backtracking search based hyper-heuristic for the flexible job-shop scheduling problem with fuzzy processing time, Eng Appl Artif Intel77 (2020), 186–196.
30.
LiuG.S., ZhouY. and YangH.D., Minimizing energy consumption and tardiness penalty for fuzzy flow shop scheduling with state-dependent setup time, J Clean Prod147 (2017), 470–484.
31.
GaoK.Z., SuganthanP.N., PanQ.K. and TasgetirenM.F., An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time, Int J Prod Res53(19) (2015), 5896–5911.
32.
LiJ.Q. and PanQ.K., Chemical-reaction optimization for solving fuzzy job-shop scheduling problem with flexible maintenance activities, Int J Prod Econ145(1) (2013), 4–17.
33.
WangL., ZhouG., XuY. and LiuM., A hybrid artificial bee colony algorithm for the fuzzy flexible job-shop scheduling problem, Int J Prod Res51(12) (2013), 3593–3608.
LiK., ChenJ.F., FuH., JiaZ.H. and FuW.Z., Uniform parallel machine scheduling with fuzzy processing times under resource consumption constraint, Appl Soft Comput82 (2019), 105585.
36.
ShaoZ.S., ShaoW.S. and PiD.C., Effective heuristics and metaheuristics for the distributed fuzzy blocking flow-shop scheduling problem, Swarm Evol Comput59 (2020), 100747.
37.
ZhengJ., WangL. and WangJ.J., A cooperative coevolution algorithm for multi-objective fuzzy distributed hybrid flow shop, Knowl-based Syst194 (2020), 105536.
38.
WangW.X., GeX.L., LiL.C. and SuJ.F., Proactive and reactive multi-project scheduling in uncertain environment, IEEE Access7 (2019), 88986–88997.
39.
RaoR.V., SavsaniV.J. and VakhariaD.P., Teaching-learningbased optimization: a novel method for constrained mechanical design optimization problems, Comput Aided Design43(3) (2011), 303–315.
40.
LinW.W., YuD.Y., ZhangC.Y. and LiuX., A multi-objective teaching-learning-based optimization algorithm to scheduling in turning process for minimizing makespan and carbon footprint, J Clean Prod101 (2015), 337–347.
41.
LiJ.Q., PanQ.K. and MaoK., A discrete teaching-learning-based optimisation algorithm for realistic flowshop scheduling problems, Eng Appl Artif Intel37 (2015), 279–292.
42.
LeiD.M., GaoL. and ZhengY.L., A novel teaching-learningbased optimization algorithm for energy-efficient scheduling in hybrid flow shop, IEEE T Eng Manage65(2) (2018), 330–340.
43.
XuY., WangL., WangS.Y. and LiuM., An effective teachinglearning-based optimization algorithm for the flexible job-shop scheduling problem with fuzzy processing time, Neurocomputing148 (2015), 260–268.
44.
ShaoW.S., PiD.C. and ShaoZ.S., A hybrid discrete teachinglearning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion, Comput Oper Res94 (2018), 89–105.
45.
MishraA. and ShrivastavaD., A TLBO and a Jaya heuristics for permutation flow shop scheduling to minimize the sum of inventory holding and batch delay costs, Comput Ind Eng124 (2018), 509–522.
46.
BuddalaR. and MahapatraS.S., Two-stage teaching-learningbased optimization method for flexible job-shop scheduling under machine breakdown, Int J Adv Manuf Tech100(5–8) (2019), 1419–1432.
47.
LeiD.M., SuB. and LiM., Cooperated teaching-learning-based optimisation for distributed two-stage assembly flow shop scheduling, Int J Prod Res (2020) in press.
48.
ZitzlerE. and ThieleL., Multi-objective evolutionary algorithms: a comparative case study and the strength Pareto approach, IEEE T Evolut Comput3(4) (1999), 257–271.
49.
LeiD.M., Pareto archive particle swarm optimization for multi-objective fuzzy job shop scheduling problems, Int J Adv Manuf Tech37 (2008), 157–165.
50.
LuongN.H., PoutreH.L. and BosmanP.A., Multi-objective genepool optimal mixing evolutionary algorithm with the interleaved multi-start scheme, Swarm Evol Comput40 (2018), 238–254.
51.
DengJ. and WangL., A competitive memetic algorithm for multiobjective distributed permutation flow shop scheduling problem, Swarm Evol Comput32 (2017), 121–131.
52.
TaguchiG., Introduction to quality engineering: designing quality into products and processes, Asian Productivity Organization (1986).
