Authors:
Pooja Kaushik,Deepak Gupta,Sonia Goel,DOI NO:
https://doi.org/10.26782/jmcms.2025.02.00007Keywords:
Makespan,Trapezoidal Fuzzy Number (TrFN),Flow shop scheduling (FSS),Yager’s Ranking Formula,Transportation technique,Abstract
A flow shop is a workspace where machines, which could be humans or machines perform a range of tasks. It involves figuring out how to arrange several jobs in the most effective way possible. In the manufacturing sector, production scheduling is essential for several reasons, including lower product costs, higher productivity, customer happiness, and competitiveness. To adequately satisfy consumer needs and meet product demand, proper scheduling offers and promotes the proper usage of criteria such as available commodities, labour, and machines. This study illustrates the general algorithm and methodology comparison using fuzzy numbers, which is beneficial in figuring out the order of tasks. The aim is to provide the best way to minimize the makespan required to distribute shared resources over time to finish competing tasks. Furthermore, the machine processing times are not fixed; rather, they are interpreted as trapezoidal fuzzy numbers (TrFN). First, during the initial step, three parallel equipotential machines are taken and one machine is in the subsequent phase. Three parallel equipotential machines are taken initially and a single machine in the subsequent phase. Then a comparative study between branch and bound and heuristic methods like CDS (Campbell, Dudek, and Smith) and NEH (Nawaz, Enscore, and Ham) is done.Refference:
I. Allahverdi, Ali, et al. “A survey of scheduling problems with setup times or costs.” European journal of operational research 187.3 (2008): 985-1032. 10.1016/j.ejor.2006.06.060
II. Gupta, Arun, and S. Chauhan. “A heuristic algorithm for scheduling in a flow shop environment to minimize makespan.” International Journal of Industrial Engineering Computations 6.2 (2015): 173-184. 10.5267/j.ijiec.2014.12.002
III. Lee, Chung-Yee. “Parallel machines scheduling with no simultaneous machine available time.” Discrete Applied Mathematics 30.1 (1991): 53-61. 10.1016/0166-218X(91)90013-M
IV. Dubois, Didier, and Henri Prade. “Fuzzy real algebra: some results.” Fuzzy sets and systems 2.4 (1979): 327-348. 10.1016/0165-0114(79)90005-8
V. Gupta, Deepak, and Sonia Goel. “Three stage flow shop scheduling model with m-equipotential machines.” International Journal on Future Revolution in Computer Science & Communication Engineering 4.3 (2018): 269-274. https://www.ijrar.org/papers/IJRAR19J1166.pdf
VI. Gupta, Deepak, Sonia Goel, and Neeraj Mangla. “Optimization of production scheduling in two stage flow shop scheduling problem with m equipotential machines at first stage.” International Journal of System Assurance Engineering and Management 13.3 (2022): 1162-1169. https://link.springer.com/article/10.1007/s13198-021-01411-5
VII. Gupta, Deepak, and Sonia Goel. “Branch and bound technique for two stage flow shop scheduling model with equipotential machines at every stage.” International Journal of Operational Research 44.4 (2022): 462-472. 10.1504/IJOR.2022.125132
VIII. Ponnialagan, Dhanasekaran, Jeevaraj Selvaraj, and Lakshmana Gomathi Nayagam Velu. “A complete ranking of trapezoidal fuzzy numbers and its applications to multi-criteria decision making.” Neural Computing and Applications 30 (2018): 3303-3315. 10.1007/s00521-017-2898-7
IX. Palmer, Douglas S. “Sequencing jobs through a multi-stage process in the minimum total time—a quick method of obtaining a near optimum.” Journal of the Operational Research Society 16.1 (1965): 101-107. 10.1057/jors.1965.8
X. Ignall, Edward, and Linus Schrage. “Application of the branch and bound technique to some flow-shop scheduling problems.” Operations research 13.3 (1965): 400-412. 10.1287/opre.13.3.400
XI. McMahon, G. B., and P. G. Burton. “Flow-shop scheduling with the branch-and-bound method.” Operations Research 15.3 (1967): 473-481. 10.1287/opre.15.3.473
XII. Ganesan, K., and P. Veeramani. “Fuzzy linear programs with trapezoidal fuzzy numbers.” Annals of operations research143 (2006): 305-315.https://doi.org/10.1007/s10479-006-7390-1
XIII. Malhotra, K., et al. “Bi-objective flow shop scheduling with equipotential parallel machines.” Malays J Math Sci 16.3 (2022): 451-470. 10.47836/mjms.16.3.04
XIV. Zadeh, Lotfi A. “Fuzzy sets.” Information and Control (1965). http://liphy-annuaire.univ-grenoble- alpes.fr/pages_personnelles/bahram_houchmandzadeh/biblio/Zadeh_FuzzySetTheory _1965.pdf
XV. Zadeh, Lotfi Asker. “Fuzzy sets as a basis for a theory of possibility.” Fuzzy sets and systems 1.1 (1978): 3-28. 10.1016/0165-0114(78)90029-5
XVI. Smith, Richard D., and Richard A. Dudek. “A general algorithm for solution of the n-job, M-machine sequencing problem of the flow shop.” Operations Research 15.1 (1967): 71-82. 10.1287/opre.15.1.71]
XVII. Abbasbandy, Saeid, and T. Hajjari. “A new approach for ranking of trapezoidal fuzzy numbers.” Computers & mathematics with applications 57.3 (2009): 413-419. 10.1016/j.camwa.2008.10.090
XVIII. Chen, Shi-Jay, and Shyi-Ming Chen. “Fuzzy risk analysis based on the ranking of generalized trapezoidal fuzzy numbers.” Applied intelligence 26 (2007): 1-11. 10.1007/s10489-006-0003-5
XIX. Johnson, Selmer Martin. “Optimal two‐and three‐stage production schedules with setup times included.” Naval research logistics quarterly 1.1 (1954): 61-68. 10.1002/nav.3800010110
XX. Sharma, Sameer, and Deepak Gupta. “Minimizing rental cost under specified rental policy in two stage flow shop, the processing time associated with probabilities including break-down interval and job block criteria.” European Journal of Business and Management 3.2 (2011): 85-103.https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=00ebcb8318cb8481a13af7f6096b8da5eccc6820
XXI. Lomnicki, Z. A. “A “branch-and-bound” algorithm for the exact solution of the three-machine scheduling problem.” Journal of the operational research society 16.1 (1965): 89-100. 10.1057/jors.1965.7