Skip to main content
SpringerLink
Log in

Optimization of production scheduling in two stage Flow Shop Scheduling problem with m equipotential machines at first stage

  • Original article
  • Published:
International Journal of System Assurance Engineering and Management Aims and scope Submit manuscript

Abstract

Scheduling jobs on equipotential machines is an activity that is very much a part of industrial scheduling. This research reports a methodology for minimizing the make span and operating cost of machineries in flow shop scheduling problem with m-equipotential machineries at first stage in addition single machine at second stage. In our research, we develop an algorithm for finding the optimal schedule for two stage flow shop scheduling problem using branch and bound technique. Modified distribution method is applied to find the optimum allocation of processing time of jobs to equipotential machines. The procedure helps the manager to reduce the time of manufacturing and overall production cost.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  • Adak Z, Arıoğlu Akan MÖ, Bulkan S (2020) Multiprocessor open shop problem: literature review and future directions. J Comb Optim 40:547–569

    Article  MathSciNet  Google Scholar 

  • Belabid J, Aqil S, Allali K (2020) Solving permutation flow shop scheduling problem with sequence-independent setup time. J Appl Math 2020:1–11

    Article  MathSciNet  Google Scholar 

  • Brown A, Lomnicki Z (1966) Some application of branch and bound algorithm to the machine scheduling problem. Oper Res Q 17:173–186

    Article  Google Scholar 

  • Choi SH, Wang K (2012) Flexible flow shop scheduling with stochastic processing times: a decomposition-based approach. Comput Ind Eng 63(2):362–373. https://doi.org/10.1016/j.cie.2012.04.001

    Article  Google Scholar 

  • Chaudhry IA, Elbadawi IA, Usman M, TajammalChugtai M (2018) Minimising total flowtime in a no-wait flow shop (NWFS) using genetic algorithms. Ing Investig 38(3):68–79

    Google Scholar 

  • Choudhari SD, Khanna R (2017) Flow shop scheduling problem with loading and unloading time with four machines. Int J Math Res 9(1):13–26

    Google Scholar 

  • Gholizadeh H, Fazlollahtabar H, Gholizadeh R (2019) A modified branch and bound algorithm for a vague flow-shop scheduling problem. Iran J Fuzzy Syst 16(4):55–64

    MATH  Google Scholar 

  • Gmys J, Mezmaz M, Melab N, Tuyttens D (2020) A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem. Eur J Oper Res 284(3):814–833

    Article  MathSciNet  Google Scholar 

  • González-Neira E, Montoya-Torres J, Barrera D (2017) Flow-shop scheduling problem under uncertainties: review and trends. Int J Ind Eng Comput 8(4):399–426

    Google Scholar 

  • Gui L, Gao L, Li X (2020) Anomalies in special permutation flow shop scheduling problems. Chin J Mech Eng 33:1–7

    Article  Google Scholar 

  • Guinet A, Solomon MM, Kedia PK, Dussauchoy A (1996) A computational study of heuristics for two-stage flexible flowshops. Int J Prod Res 34(5):1399–1415

    Article  Google Scholar 

  • Gupta JND (1997) A flowshop scheduling problem with two operations per job. Int J Prod Res 35(8):2309–2325

    Article  Google Scholar 

  • Huang RH, Yu SC, Chen PH (2017) Energy-saving scheduling in a flexible flow shop using a hybrid genetic algorithm. J Environ Prot 8(10):1037–1056

    Article  Google Scholar 

  • Johnson SM (1954) Optimal two and three stage production schedules with setup times include. Naval Res Logist Q 1(1):61–68

    Article  Google Scholar 

  • Ignall E, Scharge L (1966) Application of Branch and Bound technique to some flow shop problems. Oper Res 13:400–412

    Article  MathSciNet  Google Scholar 

  • Komaki GM, Sheikh S, Malakooti B (2019) Flow shop scheduling problems with assembly operations: a review and new trends. Int J Prod Res 57(10):2926–2955

    Article  Google Scholar 

  • Krimi I, Benmansour R, Hanafi S, Elhachemi N (2019) Two-machine flow shop with synchronized periodic maintenance. RAIRO-Oper Res 53(1):351–365

    Article  MathSciNet  Google Scholar 

  • Laribi I, Yalaoui F, Belkaid F, Sari Z (2016) Heuristics for solving flow shop scheduling problem under resources constraints. IFAC-Papers on-Line 49(12):1478–1483

    Article  Google Scholar 

  • Lebbar G, Abbassi I, Jabri A, Barkany A, Darcherif M (2018) Multi-criteria blocking flow shop scheduling problems: formulation and performance analysis. Adv Prod Eng Manag 13(2):136–146

    Google Scholar 

  • Lee HT (1991) Parallel machine scheduling with non-simultaneous machine available time. Discret Appl Math 30(1):53–61

    Article  Google Scholar 

  • Lee I, Sikora R, Shaw MJ (1997) A genetic algorithm-based approach to flexible flow-line scheduling with variable lot sizes. IEEE Trans Syst Man Cybern Part B Cybern 27(1):36–54

    Article  Google Scholar 

  • Lomnieki ZA (1965) A Branch and Bound algorithm for the exact solution of three machines sequence problem. Oper Quast 16(1):89–100

    Google Scholar 

  • Mazda CN, Kurniawati DA (2020) Branch and Bound method to overcome delay delivery order in flow shop scheduling problem. In: IOP conference series: materials science and engineering, vol 1003, No 1, IOP Publishing, p 012129

  • Mc-Mahon GB, Burton PG (1967) “Flow shop scheduling with branch and bound method. Oper Res 15:473–481

    Article  Google Scholar 

  • Nailwal KK, Gupta D, Jeet K, Sharma S (2019) An improvement heuristic for permutation flow shop scheduling. Int J Process Manag Benchmarking 9(1):124–148

    Article  Google Scholar 

  • Narain L (2003) Minimizing total hiring cost of machines in n × m flow shop problem. J Decis Math Sci 7:23–32

    Google Scholar 

  • Ning ZH, Song YE, Kaidian LI, Siyu CH (2017) Effective iterated greedy algorithm for flow-shop scheduling problems with time lags. Chin J Mech Eng 30(3):652–662

    Article  Google Scholar 

  • Pang X, Xue H, Tseng ML, Lim MK, Liu K (2020) Hybrid flow shop scheduling problems using improved fireworks algorithm for permutation. Appl Sci 10(3):1174

    Article  Google Scholar 

  • Prakash D (1977) Bicriteria scheduling problems on parallel Machines. [PhD thesis]. Birekshurg, Virginia

  • Sáenz-Alanís CA, Jobish VD, Salazar-Aguilar MA, Boyer V (2016) A parallel machine batch scheduling problem in a brewing company. Int J Adv Manuf Technol 87(1):65–75

    Article  Google Scholar 

  • Santhi S, Selvakumari K (2020) Flow shop scheduling problems using branch and bound technique under LR-fuzzy number. PalArch’s J Archaeol Egypt/Egyptol 17(7):4791–4801

    Google Scholar 

  • Wang H (2005) Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions. Expert Syst 22(2):78–85. https://doi.org/10.1111/j.1468-0394.2005.00297.x

    Article  Google Scholar 

  • Wang H, Wang W, Sun H, Cui Z, Rahnamayan S, Zeng S (2017) A new cuckoo search algorithm with hybrid strategies for flow shop scheduling problems. Soft Comput 21(15):4297–4307

    Article  Google Scholar 

  • Wang S, Liu M, Chu C (2015) A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling. Int J Prod Res 53(4):1143–1167

    Article  Google Scholar 

  • Yaurima-Basaldua VH, Tchernykh A, Villalobos-Rodríguez F, Salomon-Torres R (2018) Hybrid flow shop with unrelated machines, setup time, and work in progress buffers for bi-objective optimization of tortilla manufacturing. Algorithms 11(5):68

    Article  MathSciNet  Google Scholar 

Download references

Funding

No funding agency.

Author information

Authors and Affiliations

  1. Maharishi Markandeshwar (Deemed To Be University), Mullana, India

    Deepak Gupta, Sonia Goel & Neeraj Mangla

Authors
  1. Deepak Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sonia Goel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Neeraj Mangla
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Neeraj Mangla.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gupta, D., Goel, S. & 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). https://doi.org/10.1007/s13198-021-01411-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13198-021-01411-5

Keywords

Search

Navigation