A SINGLE MACHINE SEQUENCING PROBLEM WITH IDLE INSERT: SIMULATED ANNEALING AND BRANCH-AND-BOUND METHODS

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.

TAVAKOLI MOGHADAM R.; VASEI M.

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

Journal Paper

Paper Information

Journal: International Journal of Industrial Engineering & Production Research Year:2008 | Volume:19 | Issue:4 Page(s): 47-56

Download Full-Text

View:

250

Download:

176

Cites:

Information Journal Paper

Title

A SINGLE MACHINE SEQUENCING PROBLEM WITH IDLE INSERT: SIMULATED ANNEALING AND BRANCH-AND-BOUND METHODS

Author(s)

TAVAKOLI MOGHADAM R. | VASEI M. | Issue Writer Certificate

Keywords

SINGLE MACHINE SEQUENCING

EARLINESS/ TARDINESS

IDLE INSERT

SIMULATED ANNEALING

BRANCH-AND-BOUND METHODS

Abstract

In this paper, a SINGLE MACHINE SEQUENCING problem is considered in order to find the sequence of jobs minimizing the sum of the maximum earliness and tardiness with idle times (n/1/I/ETmax). Due to the time complexity function, this sequencing problem belongs to a class of NP-hard ones. Thus, a special design of a SIMULATED ANNEALING (SA) method is applied to solve such a hard problem. To compare the associated results, a branch-and-bound (B&B) method is designed and the upper/lower limits are also introduced in this method. To show the effectiveness of these methods, a number of different types of problems are generated and then solved. Based on the results of the test problems, the proposed SA has a small error, and computational time for achieving the best result is very small.

Cites

No record.

References

No record.

Cite

APA: Copy

TAVAKOLI MOGHADAM, R., & VASEI, M.. (2008). A SINGLE MACHINE SEQUENCING PROBLEM WITH IDLE INSERT: SIMULATED ANNEALING AND BRANCH-AND-BOUND METHODS. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH), 19(4), 47-56. SID. https://sid.ir/paper/546529/en

Vancouver: Copy

TAVAKOLI MOGHADAM R., VASEI M.. A SINGLE MACHINE SEQUENCING PROBLEM WITH IDLE INSERT: SIMULATED ANNEALING AND BRANCH-AND-BOUND METHODS. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH)[Internet]. 2008;19(4):47-56. Available from: https://sid.ir/paper/546529/en

IEEE: Copy

R. TAVAKOLI MOGHADAM, and M. VASEI, “A SINGLE MACHINE SEQUENCING PROBLEM WITH IDLE INSERT: SIMULATED ANNEALING AND BRANCH-AND-BOUND METHODS,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH), vol. 19, no. 4, pp. 47–56, 2008, [Online]. Available: https://sid.ir/paper/546529/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops