Abstract

In most manufacturing and distribution systems, semi-finished jobs are transferred from one processing facility to another by transporters such as automated guided vehicles and conveyors and finished jobs are delivered to customers or warehouses by vehicles such as trucks. Most machine scheduling models assume either that there are a finite number of transporters for delivering jobs or that jobs are delivered instantaneously from one location to another without transportation time involved. In this study we study a new simple heuristic algorithm for a ‘3- machine, n-job’ flow shop scheduling problem in which transportation time and break down times of machines are considered. A heuristic approach method to find optimal and near optimal sequence minimizing the total elapsed time.

Keywords:

Break down time, flow-shop scheduling problem, optimal sequence, transportation time,

References

1. Chandramouli, A.B., 2005. Consider a new simple heuristic algorithm for a 3-machine n-job flow- shop scheduling problem in which jobs are attached with weights to indicate their relative importance and the transportation time and break-down intervals of machine. Math. Comput. Appl., 10(2): 301-305.
   
2. Jackson, J.R., 1956. An extension of Johnson's results on job lot scheduling. Naval Res. Logist. Q., 3: 201-203.
   CrossRef    
3. Johnson, S.M., 1954. Optimal two and three-stage production schedules with set up times include. Navel Res. Logist. Q., 1: 61-681.
   CrossRef    
4. Langston, M.A., 1987. Interchange transportation planning in the deterministic flow shop environment. Oper. Res., 35: 556-564.
   CrossRef    
5. Maggu, P.L. and G. Das, 1980. On 2xn sequencing problem with transportation time of jobs. Pure Appl. Math. Sci., 12: 1-6.
   
6. Maggu, P.L. and A. Khodadadi, 1988. On heuristic approach for solution of a scheduling problem involving weights of jobs and break down times for machines. J. Indian Soc. Stat. Oper. Res., 9: 1-4.
   
7. Maggu, P.L., G. Das and R. Kumar, 1981. On equivalent job for job block in 2xn sequencing problem with transportation times. J. Oper. Res. Soc. Jpn., 24: 136-146.
   CrossRef    
8. Mitten, L.G., 1959. Sequencing n jobs on two machines with arbitrary time lags. Manage. Sci., 5: 293-298.
   CrossRef    
9. Yu, W., 1996. The two-machine flow-shop problem with delays and the one-machine total tardiness problem. Ph.D. Thesis, Eindhoven University of Technology, Eindhoven, Netherlands.
   

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.