A MATHEMATICAL ANALYSIS ON LINKAGE OF A NETWORK OF QUEUES WITH TWO MACHINES IN A FLOW SHOP INCLUDING TRANSPORTATION TIME

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

GUPTA D.; SHARMA S.; SHARMA S.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF APPLIED OPERATIONAL RESEARCH Year:2013 | Volume:3 | Issue:1 Page(s): 1-18

Download Full-Text

View:

327

Download:

131

Cites:

Information Journal Paper

Title

A MATHEMATICAL ANALYSIS ON LINKAGE OF A NETWORK OF QUEUES WITH TWO MACHINES IN A FLOW SHOP INCLUDING TRANSPORTATION TIME

Author(s)

GUPTA D. | SHARMA S. | SHARMA S. | Issue Writer Certificate

Keywords

FLOWSHOP

BISERIAL

WAITING TIME

SERVICE TIME

MAKESPAN

IDLE TIME

TRANSPORTATION TIME

Abstract

This paper represents linkage network of queues consisting of BISERIAL and parallel servers linked to a common server in series with a flow shop scheduling system consisting of two machines. The significant TRANSPORTATION TIME of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + SERVICE TIME) in the queue network is the setup time for the first machine. The objective of the paper is of two folds, on one hand it minimizes the total WAITING TIME and SERVICE TIME of jobs/customers in the queue network, and on the other hand it minimizes the IDLE TIME of the machines for the optimal sequence of jobs/customers in a given queue FLOWSHOP linkage model. A computer programme followed by a numerical illustration is given to justify the proposed algorithm.

Cites

No record.

References

Cite

APA: Copy

GUPTA, D., SHARMA, S., & SHARMA, S.. (2013). A MATHEMATICAL ANALYSIS ON LINKAGE OF A NETWORK OF QUEUES WITH TWO MACHINES IN A FLOW SHOP INCLUDING TRANSPORTATION TIME. INTERNATIONAL JOURNAL OF APPLIED OPERATIONAL RESEARCH, 3(1), 1-18. SID. https://sid.ir/paper/607898/en

Vancouver: Copy

GUPTA D., SHARMA S., SHARMA S.. A MATHEMATICAL ANALYSIS ON LINKAGE OF A NETWORK OF QUEUES WITH TWO MACHINES IN A FLOW SHOP INCLUDING TRANSPORTATION TIME. INTERNATIONAL JOURNAL OF APPLIED OPERATIONAL RESEARCH[Internet]. 2013;3(1):1-18. Available from: https://sid.ir/paper/607898/en

IEEE: Copy

D. GUPTA, S. SHARMA, and S. SHARMA, “A MATHEMATICAL ANALYSIS ON LINKAGE OF A NETWORK OF QUEUES WITH TWO MACHINES IN A FLOW SHOP INCLUDING TRANSPORTATION TIME,” INTERNATIONAL JOURNAL OF APPLIED OPERATIONAL RESEARCH, vol. 3, no. 1, pp. 1–18, 2013, [Online]. Available: https://sid.ir/paper/607898/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops