Rental Cost minimization for FSSP with equipotential machines

Kanika Gupta; Deepak Gupta; Sonia Goel

doi:10.5269/bspm.76518

Kanika Gupta MMDU, Mullana https://orcid.org/0009-0000-9062-0585
Deepak Gupta MMDU, Mullana https://orcid.org/0000-0002-9461-8770
Sonia Goel MMDU, Mullana https://orcid.org/0000-0003-1211-6003

Resumen

Scheduling, the method that deals with arranging the jobs on machines in industries or preparing a sequence of programs to be run on computers or in setting a time table and in many other such situations, is a powerful tool to handle these conditions easily. Usually, in industries for doing specific tasks, there are multiple machines instead of a single one. But all the machines are not having the same operational cost. So, jobs are assigned to these machines in a sequence so that the unit operational cost can be reduced to minimum along with reducing the total elapsed time. The present paper gives a brief description of a situation where the first stage of jobs is completed on equipotential machines and for the second stage the machine is taken on rent. So, the objective
considered in this paper is to arrange the jobs in such a way that the rental cost can be minimized along with the total elapsed time.

Descargas

La descarga de datos todavía no está disponible.

Citas

Aggoune, R., Minimizing the makespan for the flow shop scheduling problem with availability constraints, Eur. J. Oper. Res. 153, 534–543 (2004).

Gemmill, D., Scheduling a two-machine flowshop with travel times to minimize maximum lateness, Int. J. Prod. Res. 35, 1–15 (1997).

Gupta, D., Branch and bound technique for three stage flow shop scheduling problem including breakdown interval and transportation time, J. Inf. Eng. Appl. 2, 24–29 (2012).

Gupta, D. and Goel, S., Three stage flow shop scheduling model with m-equipotential machines, Int. J. Res. Anal. Rev. IJRAR19J1166 (2019).

Gupta, D. and Goel, S., Branch and bound technique for two stage flow shop scheduling model with equipotential machines at every stage, (2022).

Gupta, D., Goel, S. and Mangla, N., Optimization of production scheduling in two phase flow shop scheduling problem by branch and bound technique under fuzzy environment, Int. J. Adv. Sci. Technol. 29, 6773–6781 (2020).

Gupta, D., Singla, P. and Bala, S., Two stage flow shop scheduling problem including transportation time and weightage of jobs with branch and bound method, Int. J. Appl. Oper. Res. 3, 0–0 (2013).

Ho, J. C. and Chang, Y.-L., A new heuristic for the n-job, m-machine flow-shop problem, Eur. J. Oper. Res. 52, 194–202 (1991).

Ignall, E. and Schrage, L., Application of the branch and bound technique to some flow-shop scheduling problems, Oper. Res. 13, 400–412 (1965).

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

Lomniciki, Z., A branch-and-bound algorithm for the exact solution of the three-machine scheduling problem, J. Oper. Res. Soc. 16, 89–100 (1965).

Maggu, P., Das, G., Singh, M. and Singhal, M., On 3×n sequencing problem involving equivalent-job for a job-block with transportation-times of jobs, Optimization 12, 271–279 (1981).

Maggu, P. L., Das, G. and Kumar, R., On equivalent-job for job-block in 2×n sequencing problem with transportationtimes, J. Oper. Res. Soc. Jpn. 24, 136–146 (1981).

Malhotra, K. and Goel, S., Comparison of BB with meta-heuristic approach in optimization of three stage FSS with multiple processors, (n.d.).

Malhotra, K., Gupta, D., Goel, S. and Tripathi, A. K., Bi-objective flow shop scheduling with equipotential parallel machines, Malays. J. Math. Sci. 16, 451–470 (2022).

Mansouri, M., Bahmani, Y. and Smadi, H., A hybrid method for the parallel flow-shop scheduling problem, Comput. Sci. Math. Forum 6, (2023).

Mokotoff, E., Parallel machine scheduling problems: A survey, Asia-Pac. J. Oper. Res. 18, 193 (2001).

Mokotoff, E., An exact algorithm for the identical parallel machine scheduling problem, Eur. J. Oper. Res. 152, 758–769 (2004).

Singh, T. and Gupta, S., Minimization of rental cost in 3-stage flow shop with parallel machines including transportation time, Acta Cienc. Indica 34, 629–634 (2008).