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

A Mathematical Approach for Three Stage Flow Shop Production Schedule with Jobs in a String of Disjoint Job Block

by Deepak Gupta, Sameer Sharma, Shefali Aggarwal
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 44 - Number 19
Year of Publication: 2012
Authors: Deepak Gupta, Sameer Sharma, Shefali Aggarwal
10.5120/6375-8836

Deepak Gupta, Sameer Sharma, Shefali Aggarwal . A Mathematical Approach for Three Stage Flow Shop Production Schedule with Jobs in a String of Disjoint Job Block. International Journal of Computer Applications. 44, 19 ( April 2012), 41-48. DOI=10.5120/6375-8836

@article{ 10.5120/6375-8836,
author = { Deepak Gupta, Sameer Sharma, Shefali Aggarwal },
title = { A Mathematical Approach for Three Stage Flow Shop Production Schedule with Jobs in a String of Disjoint Job Block },
journal = { International Journal of Computer Applications },
issue_date = { April 2012 },
volume = { 44 },
number = { 19 },
month = { April },
year = { 2012 },
issn = { 0975-8887 },
pages = { 41-48 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume44/number19/6375-8836/ },
doi = { 10.5120/6375-8836 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:36:01.925399+05:30
%A Deepak Gupta
%A Sameer Sharma
%A Shefali Aggarwal
%T A Mathematical Approach for Three Stage Flow Shop Production Schedule with Jobs in a String of Disjoint Job Block
%J International Journal of Computer Applications
%@ 0975-8887
%V 44
%N 19
%P 41-48
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The aim of this paper is to introduce the concept of disjoint job blocks in n-jobs, three machines flow shop scheduling problem to minimize the total elapsed time and rental cost of the machines under a specified rental policy in which the processing time associated with probabilities including transportation time. A heuristic approach for flow shop with a computational algorithm to find optimal or near optimal solution is described. A computer program followed by a numerical illustration is given to justify the proposed algorithm.

References
  1. Ahmad Pour Darvish Heydari, "On flow shop scheduling problem with processing of jobs in a string of disjoint job blocks: fixed order jobs and arbitrary order jobs", JISSOR, XXIV, 2003, 39- 43.
  2. A. B. Chandramouli, "Heuristic Approach for n-job,3-machine flow shop scheduling problem involving transportation time, breakdown interval and weights of jobs", Mathematical and Computational Applications. 10(2), 2005, 301-305.
  3. P. Dileepan and T. Sen, "Bicriteria state scheduling research for a single machine", Omega, 16, 1988, 53-59.
  4. D. Gupta, S. Sharma, Seema and Shefali, "Bicriteria in n × 2 flow shop scheduling under specified rental policy ,processing time and setup time each associated with probabilities including job-block", Industrial Engineering Letter. 1(1), 2011, 1 – 12. .
  5. D. Gupta, S. Sharma and Seema, "Bicriteria in n x 3 flow shop scheduling under specified rental policy, processing time associated with probabilities including transportation time and job block criteria", Mathematical Modelling and Theory. 1(2), 2011, 7-18.
  6. D. Gupta,S. Sharma S. & N. Gulati, "n×3 flow shop production schedule, processing time, setup time each associated with probabilities along with jobs in string of disjoint job-blocks", Antartica J. Math. 8(5), 2011, 443 – 457.
  7. S. M. Johnson. 1954. Optimal two and three stage production schedule with set up times included, Naval Research Logistics Quart. 1 (1954), 61-68.
  8. 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), 2008, 598-601.
  9. P. L. Maggu and G. Das, "Equivalent jobs for job block in job scheduling", Opsearch, 14(4), 1977, 277-281.
  10. L. Narian & P. C. Bagga, "Minimizing hiring cost of machines in n 3flow shop problem", XXXI Annual ORSI Convention and International Conference on Operation Research and Industry, 1988, Agra[India].
  11. P. Pandian and P. Rajendran, "Solving constrained flow-shop scheduling problems with three machines", Int. J. Contemp. Math. Sciences. 5(19), 2010, 921-929.
  12. R. D. Smith & R. A. Dudek, "A general algorithm for solution of the N-job, M-machine scheduling problem", Opn. Res. , 15(1), 1967, 71-82.
  13. W. E. Smith. 1967. Various optimizers for single stage production, Naval Research Logistics. 3 (1967), 59-66.
  14. T. Sen and S. K. Gupta, "A branch and bound procedure to solve a bicriteria scheduling problem", AIIE Trans. , 15, 1983, 84-88.
  15. T. P. Singh, "On n x 2 flow shop problem involving job block, transportation times & break- down machine times", PAMS XXI, 1985, 1-2.
  16. L. N. Van Wassenhove and L. F. Gelders, "Solving a bicriteria scheduling problem", AIIE Trans. , 15, 1980, 84-88.
  17. L. N. Van Wassenhove and K. R. Baker, " A bicriteria approach to time/cost trade-offs in sequencing", EJOR, 11, 1982, 48-54.
Index Terms

Computer Science
Information Sciences

Keywords

Flow Shop Scheduling disjoint Job Block transportation Time Processing Time

Powered by PhDFocusTM