Total views : 226

Flexible Flowshop Scheduling Model with Four Stages

Affiliations

  • Department of Mathematics, Graphic Era University, Dehradu – 248002, Uttarakhand, India
  • Department of Mathematics, Meerut College, Meerut – 250003, Uttar Pradesh, India

Abstract


Objectives: In this paper, we consider the Flexible Flowshop Scheduling (FFS) problem with parallel machines. The main objective of this paper is to obtain a good schedule of jobs to minimize the makespan of FFS problem. Methods/Statistical analysis: In this study, two heuristic algorithms have been developed of FFS to reduce the makespan. First, we constructed the new heuristic algorithm based on Minimum Processing Time Selective Approach (MPTSA) and Longest Processing Times (LPT) approach to find the optimal or near optimal sequence for minimization of makespan of FFS problem with parallel machines. Next, we developed the heuristic algorithm using PALMER approach. In the PALMER approach we sequence the jobs based on Longest Slope Value (LSV) and obtained the value of objective function. Findings: We compared both the heuristic algorithms with the help of numerical illustrations. We solved the same numerical by both the heuristic algorithm and result show that our constructed heuristic algorithm has resulted in a better industrial production makespan. The percentage improvement of our constructive heuristic algorithm is also calculated. Gantt chart is also generated to verify the effectiveness of constructed heuristic algorithm. Application/Improvements: Our constructed heuristic algorithm is more effective to reduced the makespan of FFS problems as compare to classic heuristic algorithm as Palmer approach and provide an important tool for decision makers in production management.

Keywords

Flexible Flowshop Scheduling, Gantt Chart, LPT Approach, Makespan, MPTSA Approach, Parallel Machines, Percentage Improvement.

Full Text:

 |  (PDF views: 188)

References


  • Tang LX, Wu YP, A genetic descent algorithm for hybrid flow shop scheduling [J]. Journal of Automation. 2002; 28(7):637−41.
  • Morton TE, Pentico DW. Heuristic Scheduling Systems with Applications to Production Systems and Project Management. John Wiley and Sons Inc., New York: 1993.
  • Arthanari TS, Ramamurthy KG. An extension of two machines sequencing problem. Opsearch.1971; 8(1):10−22
  • Salvador MS. A Solution to a Special Case of Flow Shop Scheduling Problems. In: Elmaghraby SE (Ed.), Symposium of the Theory of Scheduling and Applications. Springer, New York: 1973.
  • Brah SA, Hunsucker JL. Branch and Bound Algorithm for the Flow Shop with Multiple Processors. Eur J Oper Res., 1991; 51(1):88−99.
  • Portmann MC, Vignier A, Dardilhac D, Dezalay D. Branch and bound crossed with GA to solve hybrid flowshops. Eur J Oper Res. 1998: 107(2):389−400.
  • Sriskandarajah C, Sethi SP. Scheduling algorithms for flexible flow shops: worst and average case performance. European Journal of Operational Research. 1989; 43(2):143−60.
  • Palmer DS. Sequencing jobs through a multi-stage process in the minimum total time-a quick method of obtaining a near optimum. Operational Research Quarterly. 1965; 16(1):101−07.
  • Lin. HT, Liao CJ. A case study in a two-stage hybrid flow shop with setup time and dedicated machines. International Journal of Production Economics, 2003; 86(2):133-43.
  • Gupta JND, Krüger K, Lauff V, Werner F, Sotskov YN. Heuristics for hybrid flow shops with controllable processing times. Computers and Operations Research. 2002; 29(10):1417−39.
  • Alisantoso JD, Khoo LP, Jiang PY. An immune algorithm approach to the scheduling of a PCB flexible flow shop. The International Journal of Advanced Manufacturing Technology. 2003; 22(11–12):819−27.
  • Wang W, Hunsucker JL. An evaluation of the CDS heuristic in flow shops with multiple processors. Journal of the Chinese Institute of Industrial Engineers. 2003; 20(3):295−304.
  • Tyagi N, Varshney RG, Chandramouli AB. Learning and Forgetting Effects of Flexible Flow Shop Scheduling. International Journal of Innovation and Applied Studies. 2014; 7(3):857−67.
  • Linn R, Zhang W. Hybrid flow shop scheduling: A survey. Comput. Ind. Eng., 1999; 37(1–2):57−61.
  • Yanney JD, Kuo W. A practical approach to scheduling a multistage, multiprocessor flow-shop problem. International Journal of Production Research. 1989; 27(10):1733−42.
  • Finke DA, Medeiros DJ. Shop scheduling using tabu search and simulation. Proceedings of the Winter Simulation Conference. USA, 2002, p.1013−17.
  • Paul RJA. Production scheduling problem in the glass-container industry. Operations Research. 1979; 27(2):290−302.
  • Tsubone H, Ohba M, Takamuk H, Miyake Y. Production scheduling system in the hybrid flow shop. Omega. 1993; 21(2):205−14.
  • Rao KS, Musalaiah G, Chowdary GKMK. Finite Element Analysis of a Four Wheeler Automobile Car Chassis. Indian Journal of Science and Technology. 2016 Jan; 9(2):1−5.

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.