In this paper, a problem of scheduling jobs with different sizes and fuzzy processing times (FPT) on non-identical parallel batch machines to minimize makespan is investigated. Moreover, the processing time (PT) of each batch is subject to the location-based learning and total-PT-based deterioration effect. Since this is an NP-hard combinatorial optimization problem, an improved intelligent algorithm based on fruit fly optimization algorithm (IFOA) is proposed. To verify the performance of the algorithm, the IFOA is compared with three state-of-the-art algorithms. The comparative results demonstrate that the proposed IFOA outperforms the other compared algorithms.
AhmadiJ.H., AhmadiR.H., DasuS. and TangC.S., Batching and scheduling jobs on batch and discrete processors, Operations Research40 (1992), 750–763.
2.
TangL., ZhaoX., LiuJ. and LeungJ.Y.T., Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine, European Journal of Operational Research263 (2017), 401–411.
3.
PeiJ., LiuX., LiaoB., PardalosP.M. and KongM., Singlemachine scheduling with learning effect and resource-dependent processing times in the serial-batching production, Applied Mathematical Modelling58 (2018), 245–253.
4.
JiaZ.h., LiK. and LeungJ.Y.T., Effective heuristic for makespan minimization in parallel batch machines with non-identical capacities, International Journal of Production Economics169 (2015), 1–10.
5.
LiS., Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan, European Journal of Operational Research260 (2017), 12–20.
6.
ZhouS., XieJ., DuN. and PangY., A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes, Applied Mathematics and Computation334 (2018), 254–268.
7.
MokhtariH. and NorooziA., An efficient chaotic based pso for earliness/tardiness optimization in a batch processing flow shop scheduling problem, Journal of Intelligent Manufacturing29 (2018), 1063–1081.
8.
ZhengX., ZhouS. and ChenH., Ant colony optimisation algorithms for two-stage permutation flow shop with batch processing machines and nonidentical job sizes, International Journal of Production Research57 (2019), 3060–3079.
9.
MatinH.N.Z., SalmasiN. and ShahvariO., Makespan minimization in flowshop batch processing problem with different batch compositions on machines, International Journal of Production Economics193 (2017), 832–844.
10.
ZhouS., ChenH., XuR. and LiX., Minimising makespan on a single batch processing machine with dynamic job arrivals and non-identical job sizes, International Journal of Production Research52 (2014), 2258–2274.
11.
RibasI., CompanysR. and Tort-MartorellX., An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem, Expert Systems with Applications121 (2019), 347–361.
12.
ZhouS., LiX., DuN., PangY. and ChenH., A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost, Computers & Operations Research96 (2018), 55–68.
13.
ShahvariO. and LogendranR., A bi-objective batch processing problem with dual-resources on unrelated-parallel machines, Applied Soft Computing61 (2017), 174–192.
14.
CostaA., Hybrid genetic optimization for solving the batchscheduling problem in a pharmaceutical industry, Computers & Industrial Engineering79 (2015), 130–147.
15.
ChungT.P. and SunH., Scheduling batch processing machine problem with non-identical job sizes via artificial immune system, Journal of Industrial and Production Engineering35 (2018), 129–134.
16.
NiY. and ZhaoZ., Two-agent scheduling problem under fuzzy environment, Journal of Intelligent Manufacturing28 (2017), 739–748.
17.
LiaoT.W. and SuP., Parallel machine scheduling in fuzzy environment with hybrid ant colony optimization including a comparison of fuzzy number ranking methods in consideration of spread of fuzziness, Applied Soft Computing56 (2017), 65–81.
18.
GeyikF. and ElibalK., A linguistic approach to non-identical parallel processor scheduling with fuzzy processing times, Applied Soft Computing55 (2017), 63–71.
19.
ChengB., ZhuH., LiK. and LiY., Optimization of batch operations with a truncated batch-position-based learning effect, Omega85 (2019), 134–143.
20.
AzzouzA., EnnigrouM. and BenSaidL., Scheduling problems under learning effects: classification and cartography, International Journal of Production Research56 (2018), 1642–1661.
21.
GaoY., YuanJ., NgC.T. and ChengT., A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan, European Journal of Operational Research273 (2019), 74–81.
22.
PeiJ., LiuX., FanW., PardalosP.M. and LuS., A hybrid bavns algorithm for coordinated serial-batching scheduling with deteriorating jobs, financial budget, and resource constraint in multiple manufacturers, Omega82 (2019), 55–69.
23.
BiskupD., Single-machine scheduling with learning considerations, European Journal of Operational Research115 (1999), 173–178.
24.
JiM., TangX., ZhangX. and ChengT.E., Machine scheduling with deteriorating jobs and dejong’s learning effect, Computers & Industrial Engineering91 (2016), 42–47.
25.
PanW.T., A new fruit fly optimization algorithm: taking the financial distress model as an example, Knowledge-Based Systems26 (2012), 69–74.
26.
MontgomeryD.C., Design and analysis of experiments, John Wiley & Sons (2017).
27.
VahediNouriB., FattahiP. and RamezanianR., Hybrid fireflysimulated annealing algorithm for the flow shop problem with learning effects and flexible maintenance activities, International Journal of Production Research51 (2013), 3501–3515.
28.
BiswasA. and BiswasB., Analyzing evolutionary optimization and community detection algorithms using regression line dominance, Information Sciences396 (2017), 185–201.
29.
JiaZ.H., YanJ. and LeungJ.Y.T., Ant colony optimization algorithm for scheduling jobs with fuzzy processing time on parallel batch machines with different capacities, Applied Soft Computing75 (2019), 548–561.
30.
MeloukS., DamodaranP. and ChangP.Y., Minimizing makespan for single machine batch processing with nonidentical job sizes using simulated annealing, International Journal of Production Economics87 (2004), 141–147.
31.
RostamiM., PileroodA.E. and MazdehM.M., Multi-objective parallel machine scheduling problem with job deterioration and learning effect under fuzzy environment, Computers and Industrial Engineering85 (2015), 206–215.
32.
WangL. and ZhengX., A knowledge-guided multi-objective fruit fly optimization algorithm for the multi-skill resource constrained project scheduling problem, Swarm and Evolutionary Computation38 (2018), 54–63.
33.
ZhengX. and WangL., A two-stage adaptive fruit fly optimization algorithm for unrelated parallel machine scheduling problem with additional resource constraints, Expert Systems with Applications65 (2016), 28–39.
34.
LiuQ., ZhanM. and ChekemF.O., A hybrid fruit fly algorithm for solving flexible job-shop scheduling to reduce manufacturing carbon footprint, Journal of Cleaner Production168 (2017), 668–678.
