Heuristic for Three Machines Flow Shop Scheduling Problem to Minimize the Weighted Mean Flow Time

Abstract:

In practical situations, machines might not be available during certain time of period due to deterministic or stochastic causes in many production systems. And, processing times are always not exact as they have been predicted. In this paper, we attempted to study the three machines flow shop scheduling problem in which probabilities are associated with processing times of jobs involving transportation time, machine breakdown interval and weights of jobs. A simple heuristic approach is proposed to find optimal or near optimal sequence minimizing the weighted mean production flow time. A numerical example has been provided to illustrate and clarify the proposed algorithm.

• Periodical: Advanced Materials Research (Volume 548)
• Pages: 714-718
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.548.714
• Online since: July 2012
• Authors: Ibrahima Camara, Hong Zhou
• Keywords: Breakdown Interval, Flow Shop, Heuristic Algorithm , Transportation Time, Uncertain Processing Time, Weighted Mean Flow Time

References

[1] S. M. Johnson, Optimal Two-stage and Three-stage Production Schedules with Set-up Times Included, Nav. Res. Log. Quar., 1(1), 61-68, (1954).

DOI: 10.1002/nav.3800010110

[2] A. Khodadadi, Development of a New Heuristic for Three Machines Flow-shop Scheduling Problem with Transportation Time of Jobs, World Applied Sciences Journal, 5(5), 598-601, (2008).

[3] A. B. Chandramouli, Heuristic Approach for n-jobs, 3-machines Flow-shop Scheduling Problem involving Transportation Time, Breakdown Time and Weights of Jobs, Mathematical and Computational Applications, 10(2), 301-305, (2005).

DOI: 10.3390/mca10020301

[4] P. Pandian, and P. Rajendran, Solving Constraint Flow shop Scheduling Problems with Three Machines, Int. J. Contemp. Math. Sciences, 5(19), 921-929, (2010).

[5] D. Gupta, S. Sharma, Seema, and G. Bhalla, Constrained Flow Shop Scheduling with n-Jobs, 3-Machines, Processing Time Associated with Probability involving Transportation Time, Breakdown Interval and Weightage of Jobs, Industrial Engineering Letters, Vol. 1, No. 2, (2011).

[6] D. Gupta, S. Sharma, and Seema, Heuristic Approach for n-Jobs, 3-Machines Flow Shop Scheduling Problem, Processing Time Associated With Probabilities involving Transportation Time, Breakdown Interval, Weightage of Jobs and Job-block Criteria. Mathematical Theory & Modeling, Vol. 1, No. 1, (2011).

DOI: 10.3390/mca10020301

[7] T. P. Singh, On 2 x n Flow-shop Problems involving Job-block, Transportation Time, Arbitrary Time and Breakdown Machine Time, PAMS, XXI(1-2) March, (1985).