SCHEDULING N JOBS ON M MACHINES USING BRANCH AND BOUND TECHNIQUE

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.

HOJATI S.M.H.; TAGHAVIFARD MOHAMMAD TAGHI

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

Journal Paper

Paper Information

Journal: MODARES TECHNICAL AND ENGINEERING Year:2003 | Volume:- | Issue:11 Page(s): 45-52

Download Full-Text

Persian Verion

View:

1,389

Download:

Cites:

Information Journal Paper

Title

SCHEDULING N JOBS ON M MACHINES USING BRANCH AND BOUND TECHNIQUE

Author(s)

HOJATI S.M.H. | TAGHAVIFARD MOHAMMAD TAGHI | Issue Writer Certificate

Keywords

SCHEDULINGQ4

JOB SHOPQ4

BRANCH AND BOUNDQ4

TWO - PHASEQ4

HEURISTIC METHODQ3

Abstract

The problem of SCHEDULING n Jobs on m machines in JOB SHOPs to minimize Make Span is analyzed through a simple Two Phase Technique and BRANCH AND BOUND algorithm. In the first phase of the algorithm method by a forward SCHEDULING process the earliest starting and finishing times for each operation considering the logical and technological constraints are determined. If two or more operations are ready to be processed by one machine at a time, two branches are generated. On one branch theSPT→MWKR priority rules and on the other one the MWKR →SPT rules are applied.The second phase starts with the best Make Span calculated in the first phase and by using a backward SCHEDULING process and a combination of SPT, MWKR priority rules and a BRANCH AND BOUND approach the SCHEDULING task is performed. The minimum Make Span calculated in both phases is considered as the final solution.

Cites

No record.

References

No record.

Cite

APA: Copy

HOJATI, S.M.H., & TAGHAVIFARD, MOHAMMAD TAGHI. (2003). SCHEDULING N JOBS ON M MACHINES USING BRANCH AND BOUND TECHNIQUE . MODARES TECHNICAL AND ENGINEERING, -(11), 45-52. SID. https://sid.ir/paper/25065/en

Vancouver: Copy

HOJATI S.M.H., TAGHAVIFARD MOHAMMAD TAGHI. SCHEDULING N JOBS ON M MACHINES USING BRANCH AND BOUND TECHNIQUE . MODARES TECHNICAL AND ENGINEERING[Internet]. 2003;-(11):45-52. Available from: https://sid.ir/paper/25065/en

IEEE: Copy

S.M.H. HOJATI, and MOHAMMAD TAGHI TAGHAVIFARD, “SCHEDULING N JOBS ON M MACHINES USING BRANCH AND BOUND TECHNIQUE ,” MODARES TECHNICAL AND ENGINEERING, vol. -, no. 11, pp. 45–52, 2003, [Online]. Available: https://sid.ir/paper/25065/en

Related Journal Papers