Optimization in Three Phase Flowshop Scheduling Problem with Multiple Processor at First Level Including Transportation Time

SONIA; Sonia  Goel; Deepak  Gupta

doi:10.5269/bspm.76385

SONIA Department of Mathematics and Humanities, Maharishi Markandeshwar (Deemed to be University), Mullana, Ambala
Sonia Goel
Deepak Gupta

Abstract

The methodical process of organizing, managing, and maximizing work while ensuring the greatest possible use of both time and resources is known as scheduling. This paper indicates the desirable and necessary steps to discover the optimum solution for the three-phase flowshop scheduling problems. Here the multiple processors have been taken at the first phase and single processor at 2^nd and 3^rd stage along with transportation time between machines. Here the first methodologies B&B(Branch and Bound) is compared with the different heuristic methodologies like NEH(Nawaz Enscore Ham) and CDS(Campbell Dudek Smith) to solve the mention problem. Comparative study considered to select the best methodology among the three with the help of numerical example.

Downloads

Download data is not yet available.

References

References
[1] Allahverdi, A survey of scheduling problems with setup times or costs, European journal of operational research 187(2008), 985-1032, DOI: 10.1016/j.ejor.2006.06.060.
[2] Campbell, G. Herbert, A. Richard, Dudek, and L. Smith Milton, A heuristic algorithm for the n job, m machine sequencing problem. Management science 16(1970), B.630, DOI: 10.1287/mnsc.16.10.B630.
[3] Gupta, Arun, and Sant Chauhan, A heuristic algorithm for scheduling in a flow shop environment to minimize makespan, International Journal of Industrial Engineering Computations 6(2015), 173-184, DOI: 10.5267/j.ijiec.2014.12.002.
[4] 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(2018), 269-274.URL: https://ijrar.org/papers/IJRAR19J1166.
[5] Gupta, D. E. E. P. A. K., and S. O. N. I. A. Goel, Nx2 flow shop scheduling problem with parallel machines at every stage, processing time associated with probabilities, Adv Math Sci J 9(2020), 1061-1069, DOI: 10.37418/amsj.9.3.31.
[6] Ignall, Edward, and Linus Schrage, Application of the branch and bound technique to some flow-shop scheduling problems, Operations research 13(1965), 400-412, DOI: 10.1287/opre.13.3.400.
[7] ISMAIL, E. JANAKI1AND A. MOHAMED, and SINI RAHUMAN, UTILISING A DYNAMIC APPROACH TO REDUCE TARDINESS FOR SCHEDULING ISSUES WITH DISTINCT DUE DATES AND JOB BLOCKING TECHNIQUE TO REDUCE COST OF TARDINESS AND EARLY ARRIVAL, Journal of Theoretical and Applied Information Technology 101(2023), 6165-6177, URL: https://www.jatit.org/volumes/Vol101No15/24Vol101No15
[8] Lee, Chung-Yee, Parallel machines scheduling with no simultaneous machine available time, Discrete Applied Mathematics 30(1991), 53-61, DOI: 10.1016/0166-218X(91)90013-M.
[9] Malhotra, Khushboo, Comparison of Bb with Meta-heuristic Approach in Optimization of Three Stage Fss with Multiple Processors 1(2023), DOI: 10.21203/rs.3.rs-2822556/v1
[10] Palmer, S. Douglas, 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(1965), 101-107, DOI: 10.1057/jors.1965.8.
[11] Sauvey, Christophe, and Nathalie Sauer, Two NEH heuristic improvements for flowshop scheduling problem with makespan criterion, Algorithms 13(2020), 112, DOI: 10.3390/a13050112.
[12] Smith, D. Richard and A. Richard Dudek, A General Algorithm for Solution of the N-Job, M-Machine Sequencing Problem of the Flow Shop, Operations Research 15(1967), 71–82, DOI: 10.1287/opre.15.1.71.
[13] S.M. Johnson, Optimal two‐and three‐stage production schedules with setup times included, Naval research logistics quarterly 1(1954), 61-68, DOI: 10.1002/nav.3800010110.
[14] Yeh, Wei‐Chang, and Ali Allahverdi, A branch‐and‐bound algorithm for the three‐machine flow shop scheduling problem with bicriteria of makespan and total flowtime, International Transactions in Operational Research 11(2004), 323-339, DOI: 10.1111/j.1475-3995.2004.00461.x.
[15] Y. Feng, J. Kong, Multi-Objective Hybrid Flow-Shop Scheduling in Parallel Sequential Mode While Considering Handling Time and Setup Time, Appl. Sci. 13(2023),3563, DOI: 10.3390/app13063563.