CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

3-Stage Specially Structured Flow Shop Scheduling to Minimize the Rental Cost Set Up Time Separated from Processing Time Including Transportation Time

by Deepak Gupta, Shashi Bala, Payal Singla
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 53 - Number 5
Year of Publication: 2012
Authors: Deepak Gupta, Shashi Bala, Payal Singla
10.5120/8417-0960

Deepak Gupta, Shashi Bala, Payal Singla . 3-Stage Specially Structured Flow Shop Scheduling to Minimize the Rental Cost Set Up Time Separated from Processing Time Including Transportation Time. International Journal of Computer Applications. 53, 5 ( September 2012), 15-18. DOI=10.5120/8417-0960

@article{ 10.5120/8417-0960,
author = { Deepak Gupta, Shashi Bala, Payal Singla },
title = { 3-Stage Specially Structured Flow Shop Scheduling to Minimize the Rental Cost Set Up Time Separated from Processing Time Including Transportation Time },
journal = { International Journal of Computer Applications },
issue_date = { September 2012 },
volume = { 53 },
number = { 5 },
month = { September },
year = { 2012 },
issn = { 0975-8887 },
pages = { 15-18 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume53/number5/8417-0960/ },
doi = { 10.5120/8417-0960 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:54:30.714157+05:30
%A Deepak Gupta
%A Shashi Bala
%A Payal Singla
%T 3-Stage Specially Structured Flow Shop Scheduling to Minimize the Rental Cost Set Up Time Separated from Processing Time Including Transportation Time
%J International Journal of Computer Applications
%@ 0975-8887
%V 53
%N 5
%P 15-18
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This article describes the development of a new heuristic algorithm which guarantees an optimal solution for specially structured flow shop problem with n-jobs,3- machines, to minimize the rental cost under specified rental policy in which set up times are separated from processes time, including transformation time. Further the processing times are not merely random but bear a well defined relationship to one another. Most of literature emphasized on minimization of idle time/ make span. But minimization of make span may not always lead to minimize rental cost of machines. Objective of this work is to minimize the rental cost of machines under a specified rental policy irrespective of make span.

References
  1. Anup (2002), "On two machine flow shop problem in which processing time assumes probabilities and there exists equivalent for an ordered job block", JISSOR, Vol. XXIII No. 1-4, pp. 41-44.
  2. Bagga P C (1969), "Sequencing in a rental situation", Journal of Canadian Operation Research Society, Vol. 7, pp. 152-153.
  3. Chander S, K Rajendra & Deepak C (1992), "An Efficient Heuristic Approach to the scheduling of jobs in a flow shop", European Journal of Operation Research, Vol. 61, pp. 318-325.
  4. Gupta Deepak & Sharma Sameer (2011), "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, Vol. 2, No. 3, pp. 85-103.
  5. Gupta D. , Sharma S. and Shashi B, "Specially Structured Three Stage Flowshop Scheduling to Minimize the Rental Cost", International Journal of Applied Physics and Mathematics, Vol. 2, No. 3, May 2012, pp. 156-158.
  6. Gupta J N D (1975), "Optimal Schedule for specially structured flow shop", Naval Research Logistic, Vol. 22, No. 2, pp. 255-269.
  7. Johnson, S. M. (1954), "Optimal two and three stage production schedule with set up times included", Naval Research Logistics Quart. 1(1), 61-68.
  8. M. Dell'Amico, Shop problems with two machines and time lags, Oper. Res. 44 (1996) 777–787.
  9. Maggu P L and Das G (1977), "Equivalent jobs for job block in job scheduling", Opsearch, Vol. 14, No. 4, pp. 277-281.
  10. Narian L Bagga P C (2005), "Two machine flow shop problem with availability constraint on each machine", JISSOR, Vol. XXIV 1-4, pp. 17-24.
  11. Narian,L. & Bagga, P. C. (1998), "Minimizing hiring cost of machines in n x 3flow shop problem", XXXI Annual ORSI Convention and International Conference on Operation Research and Industry, Agra[India].
  12. Pandian & Rajendran (2010), "Solving Constraint flow shop scheduling problems with three machines", Int. J. Contemp. Math. Sciences, Vol. 5, No. 19, pp. 921-929.
  13. Singh T P (1985), "On n×2 shop problem involving job block. Transportation times and Break-down Machine times", PAMS, Vol. XXI , pp. 1-2.
  14. Singh T P, K Rajindra & Gupta Deepak (2005), "Optimal three stage production schedule the processing time and set times associated with probabilities including job block criteria", Proceedings of National Conference FACM-2005,pp. 463-492.
  15. Singh, T P, Gupta Deepak (2005), "Minimizing rental cost in two stage flow shop , the processing time associated with probabilities including job block", Reflections de ERA, Vol 1, No. 2, pp. 107-120.
  16. Szware W (1977), "Special cases of the flow shop problems", Naval Research Logistic, Vol. 22, No. 3, pp. 483-492.
Index Terms

Computer Science
Information Sciences

Keywords

Specially structured flow shop scheduling. Rental policy Processing time Rental cost Transportation time Set up time Utilization Time

Powered by PhDFocusTM