PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
2024 | 34 | nr 1 | 175--191
Tytuł artykułu

A Heuristic Approach to Minimizing the Waiting Time of Jobs in Two Stage Flow Shop Scheduling

Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
The paper presents the influence of the waiting time of jobs in a 2 machine k-job Flow Shop Scheduling (FSS) problem. The main intention of the study is to find a sequence of jobs that delivers the least sum of the time of waiting for jobs. A heuristic approach has been adopted to achieve the desired objective. The experiments are conducted for more than 2000 problems of various sizes for the problems with special structures and problems with random times of processing. The weighted mean absolute error (WMAE) for the average of the sum of the waiting times of jobs is computed for both kind of problems after comparing with the optimal solutions. WMAE has been obtained less than 0.0075 for problems with special structures and less than 0.087 for problems with random times of processing. The WMAE is also reducing significantly with the increase in job size. The results demonstrate that the presented step-by-step procedure of the heuristic delivers significantly close to optimal solutions. (original abstract)
Rocznik
Tom
34
Numer
Strony
175--191
Opis fizyczny
Twórcy
autor
  • General Shivdev Singh Diwan Gurbachan Singh Khalsa College Patiala, Punjab, India
  • Punjabi University, Patiala, Punjab, India
autor
  • Maharishi Markandeshwar University, Mullana, Haryana, India
Bibliografia
  • [1] Alburaikan, A., Garg, H., and Khalifa, H. A. E.-W. A novel approach for minimizing processing times of three-stage flow shop scheduling problems under fuzziness. Symmetry 15, 1 (2023), 130.
  • [2] Alharbi, M. G., and Khalifa, H. A. E.-W. On a flow-shop scheduling problem with fuzzy pentagonal processing time. Journal of Mathematics 2021 (2021), 6695174.
  • [3] Bhatnagar, V., Das, G., and Mehta, O. P. n-job two machine flow-job shop scheduling problem having minimum total waiting time for all jobs. PAMS 10, 1-2 (1979), 11-23.
  • [4] Chakraborty, U. K., and Laha, D. An improved heuristic for permutation flowshop scheduling. International Journal of Information and Communication Technology 1, 1 (2007), 89-97.
  • [5] Goyal, B., Gupta, D., Rani, D., and Rani, R. Special structures in flowshop scheduling with separated set-up times and concept of job block: Minimization of waiting time of jobs. Advances in Mathematics: Scientific Journal 9, 7 (2020), 4607-4619.
  • [6] Goyal, B., and Kaur, S. Specially structured flow shop scheduling models with processing times as trapezoidal fuzzy numbers to optimize waiting time of jobs. In Soft Computing for Problem Solving: Proceedings of SocProS 2020, Volume 2, A. Tiwari, K. Ahuja, A. Yadav, J. C. Bansal, K. Deep, A. K.Nagar, Eds., vol. 1393 of Advances in Intelligent Systems and Computing, Springer, 2021, pp. 27-42.
  • [7] Goyal, B., and Kaur, S. Flow shop scheduling-especially structured models under fuzzy environment with optimal waiting time of jobs. International Journal of Design Engineering 11, 1 (2022), 47-60.
  • [8] Gupta, D., and Goyal, B. Optimal scheduling for total waiting time of jobs in specially structured two stage flow shop problem processing times associated with probabilities. Arya Bhatta Journal of Mathematics and Informatics 8, 1 (2016), 45-52.
  • [9] Gupta, D., and Goyal, B. Minimization of total waiting time of jobs in n×2 specially structured flow shop scheduling with set up time separated from processing time and each associated with probabilities. International Journal of Engineering Research and Application 7, 6 (2017), 27-33.
  • [10] Gupta, J. N. D. Optimal schedules for special structure flowshops. Naval Research Logistics Quarterly 22, 2 (1975), 255-269.
  • [11] Gürsoy, B., and Soner Kara, S. Modelling of just-in-time distrubution network under raw material quality and time constraints. Sigma Journal of Engineering and Natural Sciences 39, 3 (2021), 313-321.
  • [12] Khalifa, H. A. E.-W. On single machine scheduling problem with distinct due dates under fuzzy environment. International Journal of Supply and Operations Management 7, 3 (2020), 272-278.
  • [13] Khalifa, H. A. E.-W., Alodhaibi, S. S., and Kumar, P. Solving constrained flow-shop scheduling problem through multistage fuzzy binding approach with fuzzy due dates. Advances in Fuzzy Systems 2021 (2021), 6697060.
  • [14] Liang, Z., Zhong, P., Liu, M., Zhang, C., and Zhang, Z. A computational efficient optimization of flow shop scheduling problems. Scientific Reports 12, 1 (2022), 845.
  • [15] Nailwal, K. K., Gupta, D., and Jeet, K. Heuristics for no-wait flow shop scheduling problem. International Journal of Industrial Engineering Computations 7, 4 (2016), 671-680.
  • [16] Nawaz, M., Enscore Jr, E. E., and Ham, I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11, 1 (1983), 91-95.
  • [17] Yang, D.-L., and Kuo, W.-H. Minimizing makespan in a two-machine flowshop problem with processing time linearly dependent on job waiting time. Sustainability 11, 24 (2019), 6885.
  • [18] Yilmaz, B. G., and Yılmaz, Ö. F. Lot streaming in hybrid flowshop scheduling problem by considering equal and consistent sublots under machine capability and limited waiting time constraint. Computers & Industrial Engineering 173 (2022), 108745.
  • [19] Yilmaz, Ö. F. An integrated bi-objective u-shaped assembly line balancing and parts feeding problem: optimization model and exact solution method. Annals of Mathematics and Artificial Intelligence 90, 7-9 (2022), 679-696.
  • [20] Yilmaz, Ö. F., and Yazıcı B. Tactical level strategies for multi-objective disassembly line balancing problem with multi-manned stations: an optimization model and solution approaches. Annals of Operations Research 319, 2 (2022), 1793-1843.
  • [21] Zhou, T., Khalifa, H. A. E.-W., Najafi, S. E., and Edalatpanah, S. A. Minimizing the machine processing time in a flow shop scheduling problem under piecewise quadratic fuzzy numbers. Discrete Dynamics in Nature and Society 2022 (2022), 3990534.
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.ekon-element-000171687068

Zgłoszenie zostało wysłane

Zgłoszenie zostało wysłane

Musisz być zalogowany aby pisać komentarze.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.