A comparative study of N*2 FSSP with transportation time & processing time as trapezoidal fuzzy number

Pooja Kaushik; Sonia  Goel; Deepak  Gupta

doi:10.5269/bspm.76378

Pooja Kaushik Maharishi Markandeshwar Engineering College, Maharishi Markandeshwar (Deemed to be University), Mullana (Ambala), Haryana, India
Sonia Goel
Deepak Gupta

Resumo

For the industrial and service industries to use resources efficiently, scheduling is crucial. Scheduling issues can vary widely depending on the industry and production setting. In these production circumstances, n jobs are processed by m separate machines. Finding a precise solution to scheduling issues becomes more challenging as the number of jobs and machines used. This study describes the bi stage flow shop scheduling problem when there are parallel equipotential processors at first stage and single at second stage with transportation time included and processing time as trapezoidal fuzzy number. The effectiveness of heuristics is compared in finding the minimum makespan. This study focuses on the comparative study of B&B, Particle Swarm Optimization (PSO) and Palmar method for solving the two stage FSSP under fuzzy processing times and transportation times. The main goal is to reduce the makespan while determining the optimal job sequence.

Downloads

Não há dados estatísticos.

Referências

Chen, S. J. and Hsu, M. C., Fuzzy risk analysis based on the ranking of generalized trapezoidal fuzzy numbers, Appl. Intell. 26, 1–11 (2007).

Dubois, D. and Prade, H., Fuzzy real algebra: some results, Fuzzy Sets Syst. 2, 327–348 (1979).

Gupta, J. N. D. and Stafford, E. F., Flowshop scheduling research after five decades, Eur. J. Oper. Res. 169, 699–711 (2006).

Gupta, D. and Goel, S., Three stage flow shop scheduling model with m-equipotential machines, Int. J. Future Revolut. Comput. Sci. Commun. Eng. 4, 269–274 (2018).

Gupta, D., Goel, S. and Mangla, N., Optimization of production scheduling in two stage flow shop scheduling problem with m equipotential machines at first stage, Int. J. Syst. Assur. Eng. Manag. 13, 1162–1169 (2022).

Gupta, D. and Goel, S., Branch and bound technique for two stage flow shop scheduling model with equipotential machines at every stage, Int. J. Oper. Res. 44, 462–472 (2022).

Johnson, S. M., Optimal two- and three-stage production schedules with setup times included, Naval Res. Logist. Q. 1, 61–68 (1954).

Kennedy, J. and Eberhart, R., Particle swarm optimization, Proc. Int. Conf. Neural Netw. (ICNN’95), 4, 1942–1948 (1995).

Goyal, B. and Kaur, S., Specially structured flow shop scheduling models with processing times as trapezoidal fuzzy numbers to optimize waiting time of jobs, Soft Comput. Probl. Solving 2, 27–42 (2021).

Kuo, I.-H., Hoong, S.-J., Kao, T.-W., Lin, T.-L., Lee, C.-L., Terano, T. and Pan, Y., An efficient flow-shop scheduling algorithm based on a hybrid particle swarm optimization model, Expert Syst. Appl. 36, 7027–7032 (2009).

Palmer, D. S., Sequencing jobs through a multi-stage process in the minimum total time: a quick method of obtaining a near optimum, J. Oper. Res. Soc. 16, 101–107 (1965).

Wang, Y., Zhao, X. and Liu, F., A fuzzy approach to two-stage flow shop scheduling with uncertain processing times, Appl. Soft Comput. 47, 304–315 (2016).

Hundal, T. S. and Rajgopal, J., An extension of Palmer’s heuristic for the flow shop scheduling problem, Int. J. Prod. Res. 26, 1119–1124 (1988).

Zadeh, L. A., Fuzzy sets, Inform. Control 8, 338–353 (1965).

Kaushik, P., Gupta, D. and Goel, S., Comparative study of B&B with heuristics NEH and CDS for bi-stage flow shop scheduling problem under fuzzy environment, J. Emerg. Technol. Innov. Res. Math. Sci. 20, 73–89 (2025).