OPTIMAL TWO STAGES SPECIALLY STRUCTURED FLOW SHOP SCHEDULING: MINIMIZE THE RENTAL COST WITH INDEPENDENT SETUP 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.; BALA S.

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF APPLIED OPERATIONAL RESEARCH Year:2012 | Volume:2 | Issue:3 Page(s): 31-41

Download Full-Text

View:

318

Download:

149

Cites:

Information Journal Paper

Title

OPTIMAL TWO STAGES SPECIALLY STRUCTURED FLOW SHOP SCHEDULING: MINIMIZE THE RENTAL COST WITH INDEPENDENT SETUP TIME

Author(s)

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

Keywords

PROCESSING TIME

SET UP TIME

SPECIALLY STRUCTURED FLOW SHOP

MAKESPAN

UTILIZATION TIME

RENTAL COST

Abstract

One of the earliest results in flow shop scheduling theory is an algorithm given by Johnson’s [1] for scheduling jobs on two or three machines to minimize the total elapsed time whenever the PROCESSING TIMEs of jobs are random. The present paper is an attempt to develop a heuristic algorithm for two stages SPECIALLY STRUCTURED FLOW SHOP scheduling in which the PROCESSING TIMEs of the jobs are not completely random, but bear a well defined relationship to one another to minimize the UTILIZATION TIME of machines and hence their RENTAL COST under a specified rental policy. Further the PROCESSING TIMEs and independent SET UP TIMEs, each are associated with probabilities. A computer programme followed by a numerical illustration is given to validate the proposed algorithm.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

GUPTA, D., SHARMA, S., & BALA, S.. (2012). OPTIMAL TWO STAGES SPECIALLY STRUCTURED FLOW SHOP SCHEDULING: MINIMIZE THE RENTAL COST WITH INDEPENDENT SETUP TIME. INTERNATIONAL JOURNAL OF APPLIED OPERATIONAL RESEARCH, 2(3), 31-41. SID. https://sid.ir/paper/600449/en

Vancouver: Copy

GUPTA D., SHARMA S., BALA S.. OPTIMAL TWO STAGES SPECIALLY STRUCTURED FLOW SHOP SCHEDULING: MINIMIZE THE RENTAL COST WITH INDEPENDENT SETUP TIME. INTERNATIONAL JOURNAL OF APPLIED OPERATIONAL RESEARCH[Internet]. 2012;2(3):31-41. Available from: https://sid.ir/paper/600449/en

IEEE: Copy

D. GUPTA, S. SHARMA, and S. BALA, “OPTIMAL TWO STAGES SPECIALLY STRUCTURED FLOW SHOP SCHEDULING: MINIMIZE THE RENTAL COST WITH INDEPENDENT SETUP TIME,” INTERNATIONAL JOURNAL OF APPLIED OPERATIONAL RESEARCH, vol. 2, no. 3, pp. 31–41, 2012, [Online]. Available: https://sid.ir/paper/600449/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops