Flow Shop Scheduling Problem to Find Minimum Make span with Transportation Time Constraint

Mehak Chadha, Payal Mehta

Abstract


In this  article, a job scheduling problem has been discussed in which the machines which are going to be used for the processing of the jobs have been placed on different locations. This  article provides different structural conditions for ‘n-job, 3-machine’ flow shop scheduling problem involving processing times and transportation time. This approach is very simple and easy to understand and, also provide an important tool for decision makers to design a schedule for constrained flow-shop scheduling problems. A heuristic approach is given to find an optimal sequence of jobs.


Keywords


Flow shop, Heuristic approach, Machine, Transportation time

Full Text:

PDF

References


Baker KR. Introduction of sequencing and scheduling. John Wiley and sons, New York. 1974. 305 pages.

Bansal SP. Resultant job in restricted two machine flow shop problem. International Journal of Microbiology and Allied Sciences 1986; 2: 35-45.

Bellman R. Mathematical aspects of scheduling theory. Journal of the Society for Industrial and Applied Mathematics 1956; 4: 168-205.

Belwal OK, Mittal A. N-jobs 2 machine flow shop scheduling problem with breakdown of machines, transportation time and equivalent job block. Bulletin of Pure and Applied Sciences-Mathematics 2008; 27(1): 153-9.

Chandramouli AB. Heuristic approach for n-jobs, 3-machines flow-shop scheduling problem involving transportation time, breakdown time and weights of jobs. Mathematical and Computational Applications 2005; 10: 301-5.

Gupta D, Sharma S. Minimizing rental cost under specified rental policy in two stage flow shop, the processing time associated with probabilities including breakdown interval and Job-block criteria. European Journal of Business and Management 2011; 3(2): 85-103.

Heydari. On flow shop schedule problem with processing of jobs and string of disjoint job blocks fixed and jobs and arbitrary order jobs. Journal of the Indian Society of Statistics and Operations Research 2003; 24: 1-4.

Jackson JR. An extension of Johnson’s results on job scheduling. Naval Research Logistics 1956; 3: 201-3.

Johnson SM. Optimal two stage and three stage production schedule with set-up times included. Naval Research Logistics 1954; 1: 61-8.

Khodadadi A. Solving constrained flow-shop scheduling problem with three machines. International Journal of Academic Research 2011; 3(1): 38-40.

Maggu and Das. On n x 2 sequencing problem with transportation time of jobs. Pure and Applied Mathematika Sciences, 1981. pp. 12-16.

Pandian P, Rajendran P. Solving Constraint flow shop scheduling problems with three machines. International Journal of Contemporary Mathematical Sciences 2010; 5(19): 921-9.


Refbacks

  • There are currently no refbacks.